Reduced complexity decoding algorithms for low-density parity check codes and turbo codes

Simple item page
dc.contributor.advisorFossorier, Marc P. C.
dc.contributor.authorChen, Jinghu
dc.contributor.departmentElectrical Engineering
dc.date.accessioned2009-03-06T19:20:52Z
dc.date.available2009-03-06T19:20:52Z
dc.date.graduated2003-12
dc.date.issued2003-12
dc.description.abstractIterative decoding techniques have been receiving more and more attentions with the invention of turbo codes and the rediscovery of low-density parity-check (LDPC) codes. An important aspect in the study of iterative decoding is the tradeoff between decoding performance and complexities. For both LDPC codes and turbo codes, optimum decoding algorithms can provide very good performance. However, complicated operations are involved in the optimum decoding, and prohibit the wide applications of LDPC codes and turbo codes in the next generation digital communication and storage systems. Although there exist sub-optimum decoding algorithms for both LDPC codes and turbo codes, the decoding performance is degraded with the sub-optimum algorithms, and under some circumstances, the gap is very large. This research investigates the reduced complexity decoding algorithms of LDPC codes and turbo codes. For decoding LDPC codes, new algorithms, namely the normalized BP-based algorithm and the offset BP-based algorithm, are proposed. For these two reduced complexity algorithms, density evolution algorithms are derived, and are used to determine the best decoder parameters associated with each of the algorithms. Numerical results show that the new algorithms can achieve near optimum decoding performances for infinite code lengths, and simulation results reveal the same conclusion for short to medium code lengths. In addition to the advantage of low computational complexities, the two new algorithms are less subject to quantization errors and correlation effects than the optimum BP algorithm, and consequently are more suitable for hardware implementation. For a special kind of LDPC codes - the geometric LDPC codes, we propose the normalized APP-based algorithm, which is even more simplified yet still can achieve the near optimum performance. For decoding turbo codes, two new sub-optimum decoding algorithms are proposed. The first is the bi-directional soft-output Viterbi algorithm (bi-SOVA), which is based on utilizing a backward SOYA decoding in addition to the conventional forward one, and can achieve better performance than the uni-directional SOYA. The second is the normalized Max-Log-MAP algorithm, which improves the performance of the Max-Log-MAP decoding by scaling the soft outputs with some predetermined factors.
dc.description.degreePh.D.
dc.format.extentxiii, 117 pages
dc.identifier.urihttp://hdl.handle.net/10125/6885
dc.languageeng
dc.publisherUniversity of Hawaii at Manoa
dc.relationTheses for the degree of Doctor of Philosophy (University of Hawaii at Manoa). Electrical Engineering; no. 4380
dc.rightsAll UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
dc.rights.urihttps://scholarspace.manoa.hawaii.edu/handle/10125/2048
dc.titleReduced complexity decoding algorithms for low-density parity check codes and turbo codes
dc.typeThesis
dc.type.dcmiText
local.identifier.callnumberAC1 .H3 no. 4380
local.thesis.degreelevelPhD

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
uhm_phd_4380_uh.pdf
Size:
3.79 MB
Format:
Adobe Portable Document Format
Description:
Version for UH users
Download
No Thumbnail Available
Name:
uhm_phd_4380_r.pdf
Size:
3.79 MB
Format:
Adobe Portable Document Format
Description:
Version for non-UH users. Copying/Printing is not permitted
Download

Collections

Ph.D. - Electrical Engineering