• Please send your full manuscript to: jocm@vip.163.com

A Node Encoding of Torus Topology and Its Improved Routing Algorithm

Yang Xiaoqiang1, Li Junmin2, Du Huimin2, and Han Jungang2
1. School of Microelectronics, Xidian University, Xi'an, China
2. Department of computer science, Xi'an University of science and technology, Xi'an, China
2. Department of computer science, Xi'an Institute of Post & Telecommunications, Xi'an , China
2. School of Microelectronics, Xidian University, Xi'an, China
Abstract—With the feature size of semiconductortechnology reducing and intellectual properties (IP) coresincreasing, on chip communication architectures have agreat influence on the performance and area of System-on-Chip (SoC) design. Network-on-Chip (NoC) has beenproposed as a promising solution to complex SoCcommunication problems and has been widely accepted byacademe and industry. This paper discusses how to choosesuitable topology and node encoding scheme for NoC, andproposes a two-dimensional plane code based on JohnsonCode by the combination of Torus topology withcorresponding node encoding. The node encoding impliesthe relation among neighbouring nodes and the globalinformation of routing. And it has good scalablecharacteristics. The two methods for code compressing arealso presented to reduce the storage space of node addressand increase the utilization rate of channel bandwidth.Utilizing the code, the improved X-Y routing is proposed,which is implemented with only three or six logic operationsin middle nodes. The node structure is designed at the sametime. The experimental results show combination of theproposed code with Torus topology can simplify the routingalgorithm in the implementation of NoC, decrease siliconresource consumption and greatly improve communicationperformance.

Index Terms—Node Encoding, Network Topology, RoutingAlgorithm, Network on Chip, Compressed Code

 
Cite: Yang Xiaoqiang, Li Junmin, Du Huimin and Han Jungang, "A Node Encoding of Torus Topology and Its Improved Routing Algorithm," Journal of Communications, vol. 3, no.6, pp. 3-10, 2008.

Copyright © 2013-2019 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com