Show simple item record

dc.contributor.authorLeong, Chi Waen_US
dc.date.accessioned2007-05-15T19:06:18Z
dc.date.available2007-05-15T19:06:18Z
dc.date.issued1997-12-01T00:00:00Zen_US
dc.identifier.urihttp://hdl.handle.net/1993/1228
dc.description.abstractThe thesis has two main topics, both related to turbo codes. The first one deals with the design of reduced complexity decoding of turbo codes. In particular, two new decoders are designed using ideas from the M-algorithm: one to decode the constituent code and the other the entire turbo code. Both decoders are found to be suitable only for short turbo codes with information block size less than 300 bits. For these turbo codes the two decoders have a lower complexity with a small degradation in error performance when compared to the original decoder used to decode the turbo codes. Therefore they are recommended in applications where short turbo codes are used and a small processing delay is required. The second topic of the thesis is whether the turbo code is superior to any other code. A partial answer is found by comparing short BCH codes to turbo codes with similar parameters. It is found that the BCH codes are more attractive than the turbo codes in both decoding complexity and error performance. This implies that traditional block codes are better than turbo codes with similar parameters.en_US
dc.format.extent4491662 bytes
dc.format.extent184 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoengen_US
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleReduced complexity decoding and relative performance of turbo codesen_US
dc.typeinfo:eu-repo/semantics/masterThesis
dc.typemaster thesisen_US
dc.degree.disciplineElectrical and Computer Engineeringen_US
dc.degree.levelMaster of Science (M.Sc.)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record