Algorithms of Finding the First Two Minimum Values and Their Hardware Implementation

Given a set of numbers X, finding the minimum value of X, min_1st, is a very easy task. However, efficiently finding its second minimum value, min_2nd, requires the derivations of min_1st and finding the minimum value from the set of the remaining numbers. Efficient algorithms and cost-effective hardware of finding the two smallest of X are greatly needed for the low-density parity-check (LDPC) decoder design. The following two architectures are developed in this paper: (1) sorting-based (XS) approach and (2) tree structure (TS) approach. Experimental results show that the XS approach provides less number of comparisons, while the TS approach achieves higher speed performance at lower hardware cost. Since the hardware unit is repeatedly used in the LDPC decoder design, the proposed high-speed low-cost TS approach is strongly recommended.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  David Declercq,et al.  A low-cost parallel scalable FPGA architecture for regular and irregular LDPC decoding , 2006, IEEE Transactions on Communications.

[3]  Tong Zhang,et al.  )-Regular Low-Density Parity-Check Code Decoder , .

[4]  Vincent C. Gaudet,et al.  Degree-Matched Check Node Decoding for Regular and Irregular LDPCs , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[5]  Frank Kienle,et al.  A synthesizable IP core for DVB-S2 LDPC code decoding , 2005, Design, Automation and Test in Europe.

[6]  T. Ikenaga,et al.  High-Throughput LDPC Decoder for Long Code-Length , 2006, 2006 International Symposium on VLSI Design, Automation and Test.

[7]  Duncan G. Elliott,et al.  Termination Sequence Generation Circuits for Low-Density Parity-Check Convolutional Codes , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[8]  Lei Yang,et al.  Code construction and FPGA implementation of a low-error-floor multi-rate low-density Parity-check code decoder , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Joseph R. Cavallaro,et al.  Configurable, High Throughput, Irregular LDPC Decoder Architecture: Tradeoff Analysis and Implementation , 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

[10]  Anthony D. Fagan,et al.  A Versatile Variable Rate LDPC Codec Architecture , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.

[11]  Zhigang Cao,et al.  An FPGA implementation of a structured irregular LDPC decoder , 2005, 2005 IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications.

[12]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[13]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[14]  Joseph R. Cavallaro,et al.  Semi-parallel reconfigurable architectures for real-time LDPC decoding , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[15]  Keshab K. Parhi,et al.  Overlapped message passing for quasi-cyclic low-density parity check codes , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[16]  Guido Masera,et al.  Implementation of a Flexible LDPC Decoder , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[17]  Jun Tang,et al.  Reconfigurable Shuffle Network Design in LDPC Decoders , 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

[18]  Hsie-Chia Chang,et al.  A 3.33Gb/s (1200,720) low-density parity check code decoder , 2005, Proceedings of the 31st European Solid-State Circuits Conference, 2005. ESSCIRC 2005..

[19]  In-Cheol Park,et al.  Loosely coupled memory-based decoding architecture for low density parity check codes , 2006, IEEE Trans. Circuits Syst. I Regul. Pap..