ACM Home Page
Please provide us with feedback. Feedback
Extended layered decoding of LDPC codes
Full text PdfPdf (552 KB)
Source
Great Lakes Symposium on VLSI archive
Proceedings of the 18th ACM Great Lakes symposium on VLSI table of contents
Orlando, Florida, USA
SESSION: Session 6B: ADC and LDPC table of contents
Pages 457-462  
Year of Publication: 2008
ISBN:978-1-59593-999-9
Authors
Zhiqiang Cui  Oregon State University, Corvallis, OR, USA
Zhongfeng Wang  Oregon State University, Corvallis, OR, USA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 97,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1366110.1366218
What is a DOI?

ABSTRACT

In this paper, we propose an extended layered decoding approach for low density parity check (LDPC) codes. Compared to conventional layered decoding algorithms, the proposed approach has no constraint in the column weight of each layer. Hence, it enables more flexibility in high-throughput LDPC decoder design with layered decoding. Simulations on structured and random LDPC codes show that the proposed decoding method achieves significantly faster convergence and slightly better error correction performance than the conventional two phase massage passing sum-product algorithm. We also propose an efficient highly parallel decoder architecture for generic quasi-cyclic LDPC codes to facilitate the practical application of the proposed decoding scheme.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21--28, Jan. 1962.
 
2
D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399--431, Mar. 1999.
 
3
X.-Y. Hu, E. Eleftheriou, D.-M. Arnold, and A. Dholakia, "Efficient implementation of the sum--product algorithm for decoding LDPC codes," in Proc. IEEE Globecom, San Antonio, TX, Nov. 2001, pp. 1036---1036E.
 
4
C. E. Jones, M. Valles, M. Smith, and J. Villasenor, "Approximate Min* constraint node updating for LDPC code decoding," IEEE MILCOM conference, Oct. 2003.
 
5
J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier, X. Hu, "Reduced--Complexity Decoding of LDPC Codes," IEEE Trans. on Commun., vol 53, pp. 1288--1299, Aug. 2005.
 
6
E. Sharon, S. Litsyn, and J. Goldberger, "An efficient message-passing schedule for LDPC decoding," The 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, pp. 223--226, Sept., 2004.
 
7
D. E. Hocevar, "A reduced complexity decoder architecture via layered decoding of LDPC codes," IEEE Workshop on Signal Processing Systems, pp. 107 -- 112 , 2004.
 
8
M. M. Mansour and N. R. Shanbhag, "Turbo decoder architectures for low--density parity--check codes," IEEE Global Telecommunications Conference, vol. 2, pp.1383--1388, Nov., 2002.
 
9
H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat--accumulate codes,", Int. Confe. on Turbo codes, Sept. 2000.
 
10
L. Chen, J. Xun, I. Djurdjevic, and S. Lin, "Near Shannon Limit Quasi--Cyclic Low Density Parity-Check Codes," in IEEE Trans. on Communications, vol. 52, pp 1038--42, July, 2004.
 
11
H. Xiao--Yu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Transactions on Information Theory, vol. 51, issue 1, pp. 386--398, Jan. 2005.
 
12
I. Djurdjevic, Jun Xu, K. Abdel-Ghaffar, Shu Lin, "A class of low--density parity--check codes constructed based on Reed--Solomon codes with two information symbols," IEEE Communications Letters, vol 7, pp. 317--319, July 2003.
 
13
M. Cocco, J. Dielissen, M. Heijligers, A. Hekstra, J. Huisken, "A scalable architecture for LDPC decoding," Automation and Test in Europe Conference and Exhibition, vol. 3, pp. 88--93, Feb. 2004.
 
14
Z. Wang and Z. Cui, "A memory efficient partially parallel decoder architecture for QC-LDPC codes," 39th Asilomar Conference on Signals, Systems & Computers, pp. 729--733, 2005.
 
15
P. Radosavljevic, A. de Baynast, M. Karkooti, and J. R. Cavallaro, , "Multi--Rate High--Throughput LDPC Decoder: Tradeoff Analysis Between Decoding Throughput and Area," IEEE PIMRC'06, Sept. 2006.
 
16
T. Bhatt., V. Sundaramurthy, V. Stolpman, and D. McCain, "Pipelined Block-Serial Decoder Architecture for Structured LDPC Codes," IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 4, pp. IV--225 -- IV--228, 2006.

Collaborative Colleagues:
Zhiqiang Cui: colleagues
Zhongfeng Wang: colleagues