Low-complexity high-speed VLSI design of low-density parity-check decoders Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/9593v053b

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Low-Density Parity-check (LDPC) codes have attracted considerable attention due to their capacity approaching performance over AWGN channel and highly parallelizable decoding schemes. They have been considered in a variety of industry standards for the next generation communication systems. In general, LDPC codes achieve outstanding performance with large codeword lengths (e.g., N>1000 bits), which lead to a linear increase of the size of memory for storing all the soft messages in LDPC decoding. In the next generation communication systems, the target data rates range from a few hundred Mbit/sec to several Gbit/sec. To achieve those very high decoding throughput, a large amount of computation units are required, which will significantly increase the hardware cost and power consumption of LDPC decoders. LDPC codes are decoded using iterative decoding algorithms. The decoding latency and power consumption are linearly proportional to the number of decoding iterations. A decoding approach with fast convergence speed is highly desired in practice. This thesis considers various VLSI design issues of LDPC decoder and develops efficient approaches for reducing memory requirement, low complexity implementation, and high speed decoding of LDPC codes. We propose a memory efficient partially parallel decoder architecture suited for quasi-cyclic LDPC (QC-LDPC) codes using Min-Sum decoding algorithm. We develop an efficient architecture for general permutation matrix based LDPC codes. We have explored various approaches to linearly increase the decoding throughput with a small amount of hardware overhead. We develop a multi-Gbit/sec LDPC decoder architecture for QC-LDPC codes and prototype an enhanced partially parallel decoder architecture for a Euclidian geometry based LDPC code on FPGA. We propose an early stopping scheme and an extended layered decoding method to reduce the number of decoding iterations for undecodable and decodable sequence received from channel. We also propose a low-complexity optimized 2-bit decoding approach which requires comparable implementation complexity to weighted bit flipping based algorithms but has much better decoding performance and faster convergence speed.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Language
File Format
File Extent
  • 1360019 bytes
Replaces
Additional Information
  • description.provenance : Submitted by Zhiqiang Cui (cuiz@onid.orst.edu) on 2007-09-07T23:11:12Z No. of bitstreams: 1 Cui_thesis.pdf: 1360019 bytes, checksum: 302daf63f801c4f7084ce0578c9e699c (MD5)
  • description.provenance : Made available in DSpace on 2007-09-18T18:05:01Z (GMT). No. of bitstreams: 1 Cui_thesis.pdf: 1360019 bytes, checksum: 302daf63f801c4f7084ce0578c9e699c (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2007-09-17T18:57:13Z (GMT) No. of bitstreams: 1 Cui_thesis.pdf: 1360019 bytes, checksum: 302daf63f801c4f7084ce0578c9e699c (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2007-09-18T18:04:59Z (GMT) No. of bitstreams: 1 Cui_thesis.pdf: 1360019 bytes, checksum: 302daf63f801c4f7084ce0578c9e699c (MD5)

Relationships

In Administrative Set:
Last modified: 10/21/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items