Show simple item record

dc.contributor.advisorPerrins, Eriken
dc.contributor.authorKumaraswamy, Dileep
dc.date.accessioned2016-04-05T17:35:57Zen
dc.date.available2016-04-05T17:35:57Zen
dc.date.issued2007-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/604543en
dc.descriptionITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevadaen_US
dc.description.abstractSerially concatenated coded (SCC) systems with continuous phase modulations (CPMs) as recursive inner codes have been known to give very high coding gains at low operative signal to noise ratios (SNRs). Moreover, concatenated coded systems with iterative decoding approach the bit error rate (BER) bounds given by the maximum likelihood (ML) criterion. Although SCC systems by themselves are reduced complexity systems when compared to the ML decoding, when very highly bandwidth efficient CPMs such as pulse code modulation /frequency modulation (PCM/FM) is used [1], they present a problem of extremely high decoding complexity at the receiver. The complexity of a CPM is described by the size of its trellis which is a function of the modulation index, the cardinality of the source alphabet and the length of the frequency pulse used. The surveyed complexity reduction techniques adopt approximations which will reduce the size of the trellis with minimal expense of power. In this paper, we present reduced complexity approaches to sub-optimally decode SCC PCM/FM by mainly two approaches - 1) Frequency pulse truncation. 2) Decision feedback.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © held by the author; distribution rights International Foundation for Telemeteringen
dc.titleON REDUCED COMPLEXITY TECHNIQUES FOR BANDWIDTH EFFICIENT CONTINUOUS PHASE MODULATIONS IN SERIALLY CONCATENATED CODED SYSTEMSen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentUniversity of Kansasen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-08-18T10:43:14Z
html.description.abstractSerially concatenated coded (SCC) systems with continuous phase modulations (CPMs) as recursive inner codes have been known to give very high coding gains at low operative signal to noise ratios (SNRs). Moreover, concatenated coded systems with iterative decoding approach the bit error rate (BER) bounds given by the maximum likelihood (ML) criterion. Although SCC systems by themselves are reduced complexity systems when compared to the ML decoding, when very highly bandwidth efficient CPMs such as pulse code modulation /frequency modulation (PCM/FM) is used [1], they present a problem of extremely high decoding complexity at the receiver. The complexity of a CPM is described by the size of its trellis which is a function of the modulation index, the cardinality of the source alphabet and the length of the frequency pulse used. The surveyed complexity reduction techniques adopt approximations which will reduce the size of the trellis with minimal expense of power. In this paper, we present reduced complexity approaches to sub-optimally decode SCC PCM/FM by mainly two approaches - 1) Frequency pulse truncation. 2) Decision feedback.


Files in this item

Thumbnail
Name:
ITC_2007_07-11-03.pdf
Size:
297.6Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record