Change search
ReferencesLink to record
Permanent link

Direct link
On performance bounds for serially concatenated codes with the general inner code and interleaver
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-5407-0835
2005 (English)In: Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, NEW YORK: IEEE , 2005, 258-262 p.Conference paper (Refereed)
Abstract [en]

We investigate the union bound for symbol interleaved serially concatenated codes (SCC) with non-uniform error properties. We calculate the distance spectrum of the SCC using the input difference symbol sequence spectrum (DSSS) of the inner code. Then we modify the trellis search algorithm for general codes to calculate the DSSS. We also show the mapping approach between difference symbols with the different alphabet size. For the symbol interleaver, we use the multinomial coefficient to calculate the probability of the permuted sequence. Numerical results for symbol interleaved serially concatenated continuous phase modulation (SCCPM) show that the bound is tight in the medium to high signal-to-noise ratio (SNR) region.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2005. 258-262 p.
National Category
URN: urn:nbn:se:kth:diva-28997DOI: 10.1109/ITW.2005.1531900ISI: 000235213600058OAI: diva2:395582
Information Theory Workshop on Coding and Complexity Rotorua, NEW ZEALAND, AUG 29-SEP 01, 2005
QC 20110207Available from: 2011-02-07 Created: 2011-01-25 Last updated: 2011-11-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Xiao, Ming
By organisation
Communication Theory

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 29 hits
ReferencesLink to record
Permanent link

Direct link