2000 International Zurich Seminar on Broadband Communications. Accessing, Transmission, Networking. Proceedings (Cat. No.00TH84
DOI: 10.1109/izsbc.2000.829264
|View full text |Cite
|
Sign up to set email alerts
|

Iterative joint channel estimation and detection of coded CPM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…The new estimate b (n) at the nth step is then determined by applying (8a) and therefore by maximizing Λ( b, b (n−1) ), given by (17), with respect to b. The corresponding result is…”
Section: Em-based Synchronizationmentioning
confidence: 99%
See 1 more Smart Citation
“…The new estimate b (n) at the nth step is then determined by applying (8a) and therefore by maximizing Λ( b, b (n−1) ), given by (17), with respect to b. The corresponding result is…”
Section: Em-based Synchronizationmentioning
confidence: 99%
“…Such an algorithm has been applied to various problems, as in [15], for instance, wherein it is used for channel and noise variance estimation in combination with optimal BCJR-based detection. The same is done in [16] in combination with a suboptimal filter-based equalizer and in [17] for a coded CPM system. In [18], channel gain, and delay estimation is performed in an uncoded CDMA system with a hard-output iterative serial interference canceller.…”
Section: Introductionmentioning
confidence: 99%
“…In , it has been shown that the PSP‐based SISO‐FO algorithm performs better than the SISO‐FB algorithm for CPM signals. Another SISO demodulator has been addressed in where the expectation–maximization (EM) algorithm is used to estimate the channel. The EM algorithm performs quite well in quasi‐static channels, but its iterative nature for refining one parameter by multiple observations makes it difficult to be applied for time‐varying channels .…”
Section: Introductionmentioning
confidence: 99%
“…Coded CPM, which can be regarded as a serial concatenation scheme, provides an attractive solution under these requirements based on the previously mentioned properties of CPM and serial concatenation principles [8], [9]. In this paper we consider the combination of turbo codes and CPM.…”
Section: Introductionmentioning
confidence: 99%