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

Noncoherent coded modulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
90
0
1

Year Published

1998
1998
2011
2011

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 104 publications
(91 citation statements)
references
References 14 publications
0
90
0
1
Order By: Relevance
“…In order to improve the performance, an increasing trend for PUD systems is to use a sequence of symbols at each time instant and apply a ML estimator for the used symbol sequence (Leib & Pasupathy, 1988;Divsalar & Simon, 1990;Lodge & Moher, 1990;Leib & Pasupathy, 1991;Colavolpe & Raheli, 1999;Guo & Qiu, 2006;Tian & Yang, 2008). The performance of noncoherent sequence detectors, which have no access to the absolute signal phase information, has been shown to approach that of the corresponding coherent sequence detectors if the phase ambiguity problem is solved but at the cost of increasing the decoder complexity (Raphaeli, 1996).…”
Section: Multiple Symbol Sequence Detectionmentioning
confidence: 99%
“…In order to improve the performance, an increasing trend for PUD systems is to use a sequence of symbols at each time instant and apply a ML estimator for the used symbol sequence (Leib & Pasupathy, 1988;Divsalar & Simon, 1990;Lodge & Moher, 1990;Leib & Pasupathy, 1991;Colavolpe & Raheli, 1999;Guo & Qiu, 2006;Tian & Yang, 2008). The performance of noncoherent sequence detectors, which have no access to the absolute signal phase information, has been shown to approach that of the corresponding coherent sequence detectors if the phase ambiguity problem is solved but at the cost of increasing the decoder complexity (Raphaeli, 1996).…”
Section: Multiple Symbol Sequence Detectionmentioning
confidence: 99%
“…In particular, the integer , originally introduced as the phase-memory parameter in [18], quantifies the amount of channel memory taken into account in the trellis diagram of the considered detection block. By defining (14) (15) (16) it follows that the soft output on the right-hand side of (3), generated by a TM algorithm, that is denoted by , can be written as (17) It is possible to show that the quantities and can be calculated via forward and backward recursions, respectively, as [14] (18) (19) At this point, we emphasize that once the memory truncation is performed in (13), the TM-FB algorithm runs on a finite trellis (defined by the states ). In other words, no additional tree pruning is required.…”
Section: B Tm Adaptive Fb Algorithmsmentioning
confidence: 99%
“…The pilot symbols can be inserted in several points of the encoder structure. Their insertion leads to schemes that are antirotational invariant [15] and, consequently, noncoherently noncatastrophic [16]; that is, the unknown phase rotation introduced by the channel does not lead to any catastrophic behavior.…”
mentioning
confidence: 99%
“…Using this property, we propose an efficient quantization scheme that maps points in the Grassmann manifold to points on a sphere that are appropriate for protection against channel effects. Specifically, we leverage existing trellis coded quantization (TCQ) technique for the noncoherent communication in our vector encoder [3]- [6]. This scheme enjoys efficient encoding and decoding with complexity linear to the total number of antennas, while providing decent performance.…”
Section: Introductionmentioning
confidence: 99%