2004
DOI: 10.1109/tcomm.2004.826353
|View full text |Cite
|
Sign up to set email alerts
|

Embedding Carrier Phase Recovery Into Iterative Decoding of Turbo-Coded Linear Modulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
54
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 120 publications
(55 citation statements)
references
References 16 publications
1
54
0
Order By: Relevance
“…This requires resetting the BICM detector and performing many detection iterations. We use the embedded estimation procedure [28] to avoid this overhead: when the parameters h (k) eq and τ (k) are updated, the BICM detector is not reset, but keeps the extrinsic and a priori probabilities from the previous iteration of the BICM detector. In this case, the overhead related to the proposed SAGE estimation algorithm becomes reasonable.…”
Section: The Following Remarks Are Of Interestmentioning
confidence: 99%
“…This requires resetting the BICM detector and performing many detection iterations. We use the embedded estimation procedure [28] to avoid this overhead: when the parameters h (k) eq and τ (k) are updated, the BICM detector is not reset, but keeps the extrinsic and a priori probabilities from the previous iteration of the BICM detector. In this case, the overhead related to the proposed SAGE estimation algorithm becomes reasonable.…”
Section: The Following Remarks Are Of Interestmentioning
confidence: 99%
“…The authors in [11] have developed a blind recovery technique for QAM receivers. The work in this paper is also based on blind, or pilotless, operation and we motivate this in part by recalling a result from Anastasopoulos [3] who showed pilotless techniques to be more efficient at lower SNRs where pilot insertion loss is considerable.…”
Section: Introductionmentioning
confidence: 99%
“…This can be accomplished, in an efficient way, by applying the SPA to the FG representing the joint APP distribution function of , , and 4 (5) where we have assumed that the information symbols are independent, uniformly, and identically distributed (hence, ), we have denoted by the code indicator function, equal to 1 if is the codeword corresponding to and to zero otherwise, and finally, due to the phase model (2), we have used the conditional Markov property and discarded the term since is uniformly distributed. The pdf can be further expressed as (6) whereas the term in (5) is given by…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…6 By applying the SPA, we find and by simple manipulations, we have (22) To simplify the algorithm, in this case, we can also use the approximation . To summarize, one iteration of the proposed joint detector/ decoder is formed by the following basic steps:…”
Section: Proposed Algorithmmentioning
confidence: 99%
See 1 more Smart Citation