Title:
The Design of Rate-Compatible Structured Low-Density Parity-Check Codes

Simple item page
dc.contributor.advisor McLaughlin, Steven W.
dc.contributor.author Kim, Jaehong en_US
dc.contributor.committeeMember Barry, John
dc.contributor.committeeMember Boldyreva, Alexana
dc.contributor.committeeMember Clements, Mark
dc.contributor.committeeMember Li, Ye
dc.contributor.department Electrical and Computer Engineering en_US
dc.date.accessioned 2008-02-07T18:13:05Z
dc.date.available 2008-02-07T18:13:05Z
dc.date.issued 2006-11-14 en_US
dc.description.abstract The main objective of our research is to design practical low-density parity-check (LDPC) codes which provide a wide range of code rates in a rate-compatible fashion. To this end, we first propose a rate-compatible puncturing algorithm for LDPC codes at short block lengths (up to several thousand symbols). The proposed algorithm is based on the claim that a punctured LDPC code with a smaller level of recoverability has better performance. The proposed algorithm is verified by comparing performance of intentionally punctured LDPC codes (using the proposed algorithm) with randomly punctured LDPC codes. The intentionally punctured LDPC codes show better bit error rate (BER) performances at practically short block lengths. Even though the proposed puncturing algorithm shows excellent performance, several problems are still remained for our research objective. First, how to design an LDPC code of which structure is well suited for the puncturing algorithm. Second, how to provide a wide range of rates since there is a puncturing limitation with the proposed puncturing algorithm. To attack these problems, we propose a new class of LDPC codes, called efficiently-encodable rate-compatible (E2RC) codes, in which the proposed puncturing algorithm concept is imbedded. The E2RC codes have several strong points. First, the codes can be efficiently encoded. We present low-complexity encoder implementation with shift-register circuits. In addition, we show that a simple erasure decoder can also be used for the linear-time encoding of these codes. Thus, we can share a message-passing decoder for both encoding and decoding in transceiver systems that require an encoder/decoder pair. Second, we show that the non-systematic parts of the parity-check matrix are cycle-free, which ensures good code characteristics. Finally, the E2RC codes having a systematic rate-compatible puncturing structure show better puncturing performance than any other LDPC codes in all ranges of code rates. The throughput performance of incremental redundancy (IR) hybrid automatic repeat request (HARQ) systems highly depends on the performance of high-rate codes. Since the E2RC codes show excellent puncturing performance in all ranges of code rates, especially at high puncturing rate, we verify that E2RC codes outperform in throughput than other LDPC codes in IR-HARQ systems. en_US
dc.description.degree Ph.D. en_US
dc.identifier.uri http://hdl.handle.net/1853/19723
dc.publisher Georgia Institute of Technology en_US
dc.subject LDPC en_US
dc.subject Efficiently-encodable en_US
dc.subject Rate-compatible en_US
dc.subject Channel codes en_US
dc.subject.lcsh Error-correcting codes (Information theory)
dc.subject.lcsh Algorithms
dc.title The Design of Rate-Compatible Structured Low-Density Parity-Check Codes en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor McLaughlin, Steven W.
local.contributor.corporatename School of Electrical and Computer Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 6dd787f4-cda3-43a9-90ef-755d743781db
relation.isOrgUnitOfPublication 5b7adef2-447c-4270-b9fc-846bd76f80f2
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
kim_jaehong_200612_phd.pdf
Size:
2.35 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations