Gear-shift decoding

IEEE Transactions on Communications

Volumn 54, Issue 7, 2006, Pages 1235-1242

  Ardakani, Masoud ^a,b   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Extrinsic information transfer (EXIT) charts; Iterative decoders; Low density parity check (LDPC) codes

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DYNAMIC PROGRAMMING; ITERATIVE METHODS;

EXTRINSIC INFORMATION TRANSFER CHARTS; ITERATIVE DECODERS; LOW-DENSITY PARITY-CHECK CODES;

DECODING;

EID: 33746367125     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2006.877971     Document Type: Article

References (21)

1. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
2. T. J. Richardson, A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
3. A. Shokrollahi, "New sequence of linear time erasure codes approaching the channel capacity," in Proc. Int. Symp. Appl. Algebra, Algebraic Algorithms, Error-Correcting Codes, 1999, pp. 65-67.
4. A. Shokrollahi, IMA Volumes in Mathematics and its Applications. New York: Springer, 2000, vol. 123, pp. 153-166.
5. S.-Y. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
6. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes, Related Topics, Brest, France, Sep. 2000, pp. 1-8.
7. S. ten Brink, "Rate one-half code for approaching the Shannon limit by 0.1 dB," Electron. Lett., vol. 36, pp. 1293-1294, Jul. 2000.
8. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
9. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
10. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 11, pp. 2711-2736, Nov. 2001.
11. P. Zarrinkhat and A. H. Banihashemi, "Hybrid decoding of low-density parity-check codes," in Proc. 3rd Int. Symp. Turbo Codes, Brest, France, Sep. 2003, pp. 503-506.
12. S. Ten Brink, "Iterative decoding trajectories of parallel concatenated codes," in Proc. 3rd IEE/ITG Conf. Source, Channel Coding, Munich, Germany, Jan. 2000, pp. 75-80.
13. S. Ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
14. D. Divsalar, S. Dolinar, and F. Pollara, "Low complexity turbo-like codes," in Proc. 2nd Int. Symp. Turbo Codes, Sep. 2000, pp. 73-80.
15. H. El Gamal and A. R. Hammons, "Analyzing the turbo decoder using the Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 671-686, Feb. 2001.
16. M. Ardakani and F. R. Kschischang, "A more accurate one-dimensional analysis and design of irregular LDPC codes," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 2106-2114, Dec. 2004.
17. M. Ardakani and F. R. Kschischang, "Gear-shift decoding," in Proc. 21st Biennial Symp. Commun., Kingston, ON, Canada, Jun. 2002, pp. 86-90.
18. A. J. Blanksby and C. J. Howland, "A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check decoder," IEEE J. Solid-State Circuits, vol. 37, no. 3, pp. 404-412, Mar. 2002.
19. M. M. Mansour and N. R. Shanbhang, "High-throughput LDPC decoders," IEEE Trans. VLSI Syst., vol. 11, no. 12, pp. 976-996, Dec. 2003.
20. M. Ardakani and F. R. Kschischang, "Properties of optimum binary message-passing decoders," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3658-3665, Oct. 2005.
21. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure channel properties," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.