1996
DOI: 10.1109/26.486599
|View full text |Cite
|
Sign up to set email alerts
|

Per-survivor processing and tentative decisions: what is in between?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

1997
1997
2013
2013

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(6 citation statements)
references
References 10 publications
0
6
0
Order By: Relevance
“…A full complexity PSP approach [11,12] (i.e., considering all trellis paths) is not appropriate here because of the huge number of states and paths in the trellis considered in this paper. One might think of using reduced complexity PSP [17] or tentative decision (TD) algorithms. However, since these algorithms consider a limited number of paths, the selection of these paths (according to their probability) at each symbol period makes these algorithms intractable in our application.…”
Section: Phase Tracking Methodsmentioning
confidence: 99%
“…A full complexity PSP approach [11,12] (i.e., considering all trellis paths) is not appropriate here because of the huge number of states and paths in the trellis considered in this paper. One might think of using reduced complexity PSP [17] or tentative decision (TD) algorithms. However, since these algorithms consider a limited number of paths, the selection of these paths (according to their probability) at each symbol period makes these algorithms intractable in our application.…”
Section: Phase Tracking Methodsmentioning
confidence: 99%
“…LMS channel tracking was proposed early on for adaptive receivers 82, 83, and it continues to be a popular form of tracking 53, 84–101. Different step sizes can be used for different taps depending on the average tap power 61, 102, 103.…”
Section: Channel Trackingmentioning
confidence: 99%
“…To reduce complexity, the number of channel models can be less than the number of states. In Reference 89, channel models are kept for the best K states. In Reference 97, the states are partitioned and a channel estimate is maintained for each partition.…”
Section: Data‐directed Trackingmentioning
confidence: 99%
“…The PSP algorithm was first proposed by Seshadri [92]; as well as by Raheli et al [93], [94] for blind equalization in single-user ISI-contaminated channels. Xie et al extended their own earlier work [91] to include the estimation of user delays along with channel and data estimation [95].…”
Section: H Blind Detectionmentioning
confidence: 99%