Abstract
Iterative detection (ID) has proven to be a near-optimal solution for concatenated Finite State Machines (FSMs) with interleavers over an additive white Gaussian noise (AWGN) channel. When perfect channel state information (CSI) is not available at the receiver, an adaptive ID (AID) scheme is required to deal with the unknown, and possibly time-varying parameters. The basic building block for ID or AID is the soft-input soft-output (SISO) or adaptive SISO (A-SISO) module. The complexity of SISOs and A-SISOs increases exponentially with constraint length. In this paper, Reduced State SISO (RS-SISO) algorithms have been applied for complexity reduction of the A-SISO module. We show that serially concatenated CPM (SCCPM) with AID has turbo-like performance over fading ISI channels and also RS-A-SISO systems have large iteration gains. Various design options for RS-A-SISO algorithms are evaluated and performance and complexity is compared.
Original language | English |
---|---|
Pages | 1162-1166 |
Number of pages | 5 |
Publication status | Published - 2001 |
Externally published | Yes |
Event | IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: 2001 Nov 25 → 2001 Nov 29 |
Other
Other | IEEE Global Telecommunicatins Conference GLOBECOM'01 |
---|---|
Country/Territory | United States |
City | San Antonio, TX |
Period | 01/11/25 → 01/11/29 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Global and Planetary Change