| 1. |
- Xiao, Ming, 1975-, et al.
(författare)
-
Serially concatenated continuous phase modulation with ring convolutional codes
- 2004
-
Ingår i: 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS. - NEW YORK : IEEE. ; , s. 513-513
-
Konferensbidrag (refereegranskat)abstract
- Serially concatenated continuous phase modulation (SCCPM) systems with ring convolutional codes (CC) are investigated. Both EXIT chart and union bound techniques are used to compare with the simulation results and are used as analysis tools. The latter is for the first time generalized to a non-binary interleaver for a serially concatenated system, where both the order and position of the permuted non-zero symbols have to be considered.
|
|
| 2. |
- Xiao, Ming, 1975, et al.
(författare)
-
serially concatenated continuous phase modulation with ring convolutional codes
- 2004
-
Ingår i: IEEE, international symposium on information theory, 27 June-2 July 2004. - 0780382803 ; , s. 513-
-
Konferensbidrag (refereegranskat)abstract
- A serially concatenated continuous phase modulation (SCCPM) system with ring convolutional codes (CC) is introduced. Both EXIT chart and union bound techniques are used to compare with the simulation results and are used as analysis tools. The latter is for the first time generalized to a non-binary interleaver for a serially concatenated system. Results show that a substantial improvement can be achieved in convergence threshold through this scheme compared to previous SCCPM systems with the same state complexity. From the analysis methods, some design principles are proposed.
|
|
| 3. |
- Xiao, Ming, 1975-, et al.
(författare)
-
Serially concatenated continuous phase modulation with symbol interleavers : Performance, properties and design principles
- 2004
-
Ingår i: GLOBECOM '04. - 0780387945 ; , s. 179-183
-
Konferensbidrag (refereegranskat)abstract
- Serially concatenated continuous phase modulation (SCCPM) systems with symbol interleavers are investigated. The transmitted signals are disturbed by additive white Gaussian noise (AWGN). Iterative detection with extrinsic information is used at the receiver side. Compared to bit interleaved SCCPM systems, this scheme shows a substantial improvement in convergence threshold at the price of a higher error floor. In addition to showing this property, we also investigate the underlying reason by error event analysis. In order to estimate bit error rate performance, we generalize traditional union bounds for a bit interleaver to the non-binary interleaver. For the latter, both the order and the position of permuted non-zero symbols have to be considered. From the analysis, some principal properties are presented. Finally some design principles are proposed. The paper concentrates on SCCPM, but the proposed analysis methods and conclusions can be widely used in many other systems such as serially concatenated trellis coded modulation etcetera.
|
|
| 4. |
- Xiao, Ming, 1975
(författare)
-
Some concatenated and iterative decoding approaches for continuous phase modulation
- 2004
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Several concatenated and iterative decoding approaches are used toimprove the power efficiency of continuous phase modulation (CPM).First a symbol interleaver is used for serially concatenated CPM(SCCPM). Convergence of iterative decoding for this scheme can beearlier (lower SNR: Signal-to-Noise-Ratio) compared to bitinterleaved SCCPM. Then a ring convolutional code (CC) is used asthe outer code in this symbol interleaved SCCPM. By setting thedenominator of the CPM modulation index equal to the alphabet sizeof the system (CPM, interleaver and ring CC), a naturalcombination of them is achieved. Further improvements on earlierconvergence or error floors are achieved with this scheme.Finally, irregular repeat accumulate (IRA) codes with CPM (IRCPM)are considered. CPM now takes the role of the accumulator. Thisscheme shows even earlier convergence than SCCPM. To analyze the error floor performance, we derive the union boundfor symbol interleaved SCCPM. In this bound analysis, we have toconsider the order of nonzero permuted difference symbols that arenot identical. We also derive the union bound for IRCPM from itsequivalent structure. This structure introduces a virtualinterleaver before CPM. Thus, the union bound analysis for SCCPMis now applicable.
|
|
