FPGA implementation for image object detection system on NoCs

This paper presents a routing approach for the mesh network on chip. This routing approach can choose the appropriate intermediate router to achieve the fast routing. It can balance the traffic load and achieve deadlock free. From the experimental results, our approach can improve at least 8.3% of the packet transmission latency comparing with the latest works. Next, the image object detection system, which includes 5 hardware intellectual properties and mesh network, is implemented in a FPGA platform. The total logic element is about 27,912, and the memory bits are 680,216. Its working frequency is 25 MHz such that it can process 22 frames per second for 320*240 image size.

[1]  W. Dally,et al.  Route packets, not wires: on-chip interconnection networks , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[2]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[3]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

[4]  Tobias Bjerregaard,et al.  A survey of research and practices of Network-on-chip , 2006, CSUR.

[5]  An-Yeu Wu,et al.  Traffic-Balanced Routing Algorithm for Irregular Mesh-Based On-Chip Networks , 2008, IEEE Transactions on Computers.

[6]  Manfred Glesner,et al.  Deadlock-free routing and component placement for irregular mesh-based networks-on-chip , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[7]  José Duato,et al.  A Cost-Effective Approach to Deadlock Handling in Wormhole Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[8]  Pierre Fraigniaud,et al.  A General Theory for Deadlock Avoidance in Wormhole-Routed Networks , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  José Duato,et al.  994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .

[10]  Ping-Kuo Weng,et al.  VLSI architecture design for a fast parallel label assignment in binary image , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[11]  Ge-Ming Chiu,et al.  The Odd-Even Turn Model for Adaptive Routing , 2000, IEEE Trans. Parallel Distributed Syst..

[12]  Jie Wu,et al.  A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model , 2003, IEEE Trans. Computers.

[13]  Lionel M. Ni,et al.  The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[14]  José Duato,et al.  Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and tori , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[15]  Tieniu Tan,et al.  A survey on visual surveillance of object motion and behaviors , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[16]  José Duato,et al.  FC3D: Flow Control-Based Distributed Deadlock Detection Mechanism for True Fully Adaptive Routing in Wormhole Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[17]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.