Optimal finite alphabet sources over partial response channels

Simple item page
dc.contributorNarayanan, Krishna R.
dc.contributorMiller, Scott L.
dc.creatorKumar, Deepak
dc.date.accessioned2004-11-15T19:45:00Z
dc.date.accessioned2017-04-07T19:48:46Z
dc.date.available2004-11-15T19:45:00Z
dc.date.available2017-04-07T19:48:46Z
dc.date.created2003-08
dc.date.issued2004-11-15
dc.description.abstractWe present a serially concatenated coding scheme for partial response channels. The encoder consists of an outer irregular LDPC code and an inner matched spectrum trellis code. These codes are shown to offer considerable improvement over the i.i.d. capacity (> 1 dB) of the channel for low rates (approximately 0.1 bits per channel use). We also present a qualitative argument on the optimality of these codes for low rates. We also formulate a performance index for such codes to predict their performance for low rates. The results have been verified via simulations for the (1-D)/sqrt(2) and the (1-D+0.8D^2)/sqrt(2.64) channels. The structure of the encoding/decoding scheme is considerably simpler than the existing scheme to maximize the information rate of encoders over partial response channels.
dc.identifier.urihttp://hdl.handle.net/1969.1/1044
dc.language.isoen_US
dc.publisherTexas A&M University
dc.subjectISI channels
dc.subjectPartial response channels
dc.subjectCapacity
dc.subjectSpectrum matching
dc.titleOptimal finite alphabet sources over partial response channels
dc.typeBook
dc.typeThesis

Files

Collections

Texas A&M University at College Station