Reduced-Complexity Approach to Iterative Detection of Coded SOQPSK

Abstract

We develop a reduced-complexity approach for the detection of coded shaped-offset quadrature phase-shift keying (SOQPSK), a highly bandwidth-efficient and popular constantenvelope modulation. The complexity savings result from viewing the signal as a continuous-phase modulation (CPM). We give a simple and convenient closed-form expression for a recursive binaryto-ternary precoder for SOQPSK. The recursive nature of this formulation is necessary in serially concatenated systems where SOQPSK serves as the inner code. We show that the proposed detectors are optimal in the full-response case, and are near-optimal in the partial-response case due to some additional complexity reducing approximations. In all cases, the proposed detectors achieve large coding gains for serially concatenated coded SOQPSK. These gains are similar to those reported recently by Li and Simon, which were obtained using a more complicated cross-correlated trelliscoded quadrature modulation (XTCQM) interpretation.

DOI: 10.1109/TCOMM.2007.900614

Extracted Key Phrases

10 Figures and Tables

Cite this paper

@article{Perrins2007ReducedComplexityAT, title={Reduced-Complexity Approach to Iterative Detection of Coded SOQPSK}, author={Erik Perrins and Michael Rice}, journal={IEEE Trans. Communications}, year={2007}, volume={55}, pages={1354-1362} }