1988
DOI: 10.1109/26.2724
|View full text |Cite
|
Sign up to set email alerts
|

Reduced-state sequence estimation with set partitioning and decision feedback

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
262
0
2

Year Published

1992
1992
2011
2011

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 605 publications
(265 citation statements)
references
References 15 publications
1
262
0
2
Order By: Relevance
“…The number of trellis states of JRSSE-M is given by [13]. To distinguish between different partitionings, we characterize them by the number of used subsets: For DDFSE which may be seen as a special case of RSSE we have L κ ∈ {1, 8} for 8PSK.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The number of trellis states of JRSSE-M is given by [13]. To distinguish between different partitionings, we characterize them by the number of used subsets: For DDFSE which may be seen as a special case of RSSE we have L κ ∈ {1, 8} for 8PSK.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…In the worst case, only a single hypothesis with respect to the desired user signal may be held in memory and error propagation deteriorates performance. In this paper, we solve this problem by using the breadth-first sequential search algorithm (SA) [2], which may be interpreted as a combination of RSSE [13] and the M-algorithm. The considered states are defined according to an Ungerboeck set-partitioning, and a number of M paths is selected and stored for each state ν.…”
Section: Introductionmentioning
confidence: 99%
“…Two of the more well known techniques are reduced state sequence estimation [EQ88] and delayed decision feedback estimation [DHH89]. Tree-search algorithms can be partitioned into optimal and suboptimal approaches.…”
Section: Decision Feedback Equalizationmentioning
confidence: 99%
“…Another more sophisticated algorithm is the reduced-state sequence estimation (RSSE), suggested by Eyuboglu and Qureshi [21]. Trellis states as defined in VA are merged using Ungerboeck-like set partitioning principles resulting in a simpler trellis.…”
Section: Suboptimal Viterbi-like Algorithmsmentioning
confidence: 99%
“…The complexity of VA increases rapidly with m and v, but hitherto most literatures focused on the effect of v. It seems that only a few researchers noticed that the complexity can be large for large m, even when v is very small [21]. In fact, the effect of m should deserve a lot of attention, as the effect of ISI in multilevel system is more noticeable [60].…”
Section: Trends Of Digital Transmission and Mlsementioning
confidence: 99%