Cochannel Receivers for CPM Signals Based Upon the Laurent Representation

Murphy, Peter; Ford, Gary E.

doi:10.1007/978-1-4615-6237-5_11

Cited by 6 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This also leads to the well-known interpretation of MSK as offset-QPSK in which the pulse shape is a half-cycle sinusoid with period 4T [12]. Information bitsα n can be decoded by differential decoding of the estimated pseudo-symbolsâ 0,n andâ 0,n−1 .…”

Section: Code Design Based On Laurent Decompositionmentioning

confidence: 98%

“…Information bitsα n can be decoded by differential decoding of the estimated pseudo-symbolsâ 0,n andâ 0,n−1 . Note that a 0,n = n i=0α i [12], [13]. In this case, the Viterbi algorithm can be applied because of the memory structure of CPM signals.…”

Section: Code Design Based On Laurent Decompositionmentioning

confidence: 98%

“…where (·) T denotes transpose, n(t) is a complex Gaussian noise with power spectral density [s 1 (t), s 2 (t), · · · , s M (t)] T is the transmitted signal vector with s m (t) being the CPM signal from transmit antenna m. The complex baseband binary CPM signal s(t) can be written as the sum of K = 2 L−1 pulse-amplitude modulation (PAM) signals as [12]- [14] …”

Section: Code Design Based On Laurent Decompositionmentioning

confidence: 99%

See 2 more Smart Citations

Simplified receiver design for STBC binary continuous phase modulation

Liu

Punnoose²,

Liu

2008

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Existing space-time codes have focused on multipleantenna systems with linear modulation schemes such as phaseshift keying and quadrature amplitude modulation. Continuous phase modulation (CPM) is an attractive scheme for digital transmission because of its constant envelope which is needed for power efficient transmitters. Recent research has shown that space-time coded CPM can achieve transmit diversity to improve performance while maintaining the compact spectrum of CPM signals. However, these efforts mainly combine spacetime coding (STC) with CPM to achieve spatial diversity at the cost of a high decoding complexity. In this paper, we design space-time block codes (STBC) for binary CPM with modulation index h = 1/2 and derive low-complexity receivers for these systems. The proposed scheme has a much lower decoding complexity than STC CPM with the Viterbi decoder and still achieves near-optimum error performances.

show abstract

Section: Code Design Based On Laurent Decompositionmentioning

confidence: 98%

Section: Code Design Based On Laurent Decompositionmentioning

confidence: 98%

Section: Code Design Based On Laurent Decompositionmentioning

confidence: 99%

See 1 more Smart Citation

Simplified receiver design for STBC binary continuous phase modulation

Liu

Punnoose²,

Liu

2008

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…Among such MLSD based solutions, many demodulation algorithms are derived using the Laurent representation of binary CPM signals and the resulting demodulator is then structured into a bank of matched filters followed by a Viterbi module search. This structure is also used to deal with multiuser [9] or cochannel CPM signal detection [8]. Generally, the complexity of MLSD-based CPM decoders grows for longer partial response lengths or for high modulation alphabet size.…”

Section: Introductionmentioning

confidence: 99%

Contribution of state modelling in efficient MAP symbol-by-symbol demodulation schemes for CPM-MIMO systems

Boujemía¹,

Marcos²

2014

Signal Processing

View full text Add to dashboard Cite

International audienceIn [1], a state space model was derived for the demodulation of Continuous Phase Modulation (CPM) signals, based on which the demodulation problem was solved through the symbol-by-symbol Bayesian estimation built around the MAP Symbol-by-symbol Detector (MAPSD). In this paper, a new state space model considered in the augmented state composed of the symbol and the phase state is proposed and the corresponding modified MAPSD demodulation scheme is presented. The main contribution of the paper however consists in deriving optimal and suboptimal symbol-by-symbol MAP detection schemes for MIMO systems operating with CPM signals. For this, a state model description of the corresponding demodulation problem is introduced based on which two CPM-MIMO Bayesian demodulators are proposed. The first one uses a Zero Forcing (ZF) pre-processing block to separate the different CPM signals followed by a bank of MAPSD based CPM demodulators. The second demodulator consists in a joint decision feedback (DF) CPM-MIMO MAPSD detector. Simulations confirm the good performance in term of BER of both proposed structures. Particularly, high BER's performance of the partially joint CPM-MIMO-MAPSD/DF is recorded and an emphasis is made on the implementation simplicity of this new detector with no constraint on the modulation index or the alphabet size

show abstract