CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Serially concatenated continuous phase modulation with convolutional codes over rings

Ming Xiao (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Tor Aulin (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
IEEE Transactions on Communications (00906778 (ISSN)). Vol. 54 (2006), 8, p. 1387-1396.
[Artikel, refereegranskad vetenskaplig]

In this paper, we investigate serially concatenated continuous phase modulation (SCCPM) with convolutional codes (CC) over rings. The transmitted signals are disturbed by additive white Gaussian noise. The properties for systems with both infinite and finite block lengths are investigated. For an infinite-length system, we check the convergence threshold using the extrinsic information transfer chart. For a finite-length system, we use union-bound techniques to estimate the error floors. In the union-bound analysis, we consider both the order and the position of nonzero permuted symbols. A simple method for determining a CPM error event through the sum of the input symbol sequence is shown. Thus, we can determine if the output symbol sequence of an error event in the ring CC can form an error event in CPM. Two properties concerning the interleaver gain (IG) are investigated. A recursive search algorithm for the maximal IG is shown. Compared with previous SCCPM with a binary CC, the proposed system shows an improvement concerning the convergence threshold or error floors.



Denna post skapades 2009-12-08.
CPL Pubid: 103096

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datorteknik (Chalmers)

Ämnesområden

Information Technology

Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:


Efficient Coding Techniques for Networks & Channels with Transmission Errors