By Topic

Reduced-Complexity Approach to Iterative Detection of Coded SOQPSK

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Erik Perrins ; Dept. of Electr. Eng. & Comput. Sci., Kansas Univ., Lawrence, KS ; Michael Rice

We develop a reduced-complexity approach for the detection of coded shaped-offset quadrature phase-shift keying (SOQPSK), a highly bandwidth-efficient and popular constant-envelope 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 binary-to-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 trellis-coded quadrature modulation (XTCQM) interpretation.

Published in:

IEEE Transactions on Communications  (Volume:55 ,  Issue: 7 )