Reduced-Complexity Approach to Iterative Detection of Coded SOQPSK
The work
| Authors | Erik S. Perrins; Michael David Rice |
|---|---|
| Editors | |
| Type | article |
| Year | 2007 |
| Citekey | perrins2007reducedcomplexity |
Where it appeared
| Published in | IEEE Transactions on Communications |
|---|---|
| Publisher | IEEE Communications Society |
| Volume | 55 |
| Issue | 7 |
| Pages | 1354--1362 |
Identifiers
| DOI | 10.1109/tcomm.2007.900614 |
|---|---|
| OpenAlex | W2151282997 |
Access
| Landing page | https://doi.org/10.1109/tcomm.2007.900614 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
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 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.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-29 13:03 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@article{perrins2007reducedcomplexity,
title = {Reduced-Complexity Approach to Iterative Detection of Coded SOQPSK},
author = {Erik S. Perrins and Michael David Rice},
year = {2007},
journal = {IEEE Transactions on Communications},
publisher = {IEEE Communications Society},
volume = {55},
number = {7},
pages = {1354--1362},
doi = {10.1109/tcomm.2007.900614},
}
This record lives at https://refs.drheap.org/perrins2007reducedcomplexity/ and will keep doing so.