Abstract
This paper presents an efficient architecture of finding the first two minimum values for row operation in LDPC decoding. Given a set of numbers X, efficient algorithm and its corresponding hardware implementation for finding the first minimum value, min-1st, second minimum value, min-2nd and the position of min-1st are greatly needed in LDPC decoder design. The design is based on sorting-based approach proposed in[10]. Compared to the conventional architecture, our architecture performs better in both speed and area. An extension method is also presented to apply the proposed architecture when the number of inputs is an any positive integer.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 |
| Pages | 95-98 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 - Penang Duration: 2011 Mar 4 → 2011 Mar 6 |
Other
| Other | 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 |
|---|---|
| City | Penang |
| Period | 11/3/4 → 11/3/6 |
Keywords
- LDPC codes
- LDPC decoder
- min-sum algoritm
- minimum finder
- sorting-based architecture
ASJC Scopus subject areas
- Signal Processing
Fingerprint Dive into the research topics of 'A sorting-based architecture of finding the first two minimum values for LDPC decoding'. Together they form a unique fingerprint.
Cite this
Xie, Q., Chen, Z., Peng, X., & Goto, S. (2011). A sorting-based architecture of finding the first two minimum values for LDPC decoding. In Proceedings - 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications, CSPA 2011 (pp. 95-98). [5759850] https://doi.org/10.1109/CSPA.2011.5759850