2009
DOI: 10.1109/tsp.2009.2025153
|View full text |Cite
|
Sign up to set email alerts
|

Full-Rank and Rank-Deficient Precoding Schemes for Single-Carrier Block Transmissions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…In [29], information theoretic bounds are obtained for separate and joint channel and data estimations. The work in [30] focus on single carrier precoding optimization for peak to average power ratio, whereas [21], [31] is oriented towards multi-carrier transmissions. In the GSP scheme, instead of sending the same number of data symbols as the number of pilots (T ), the number of data symbols is reduced, optimized, and further precoded to avoid the possible pilot contamination in both the channel estimation and the data detection.…”
Section: Introductionmentioning
confidence: 99%
“…In [29], information theoretic bounds are obtained for separate and joint channel and data estimations. The work in [30] focus on single carrier precoding optimization for peak to average power ratio, whereas [21], [31] is oriented towards multi-carrier transmissions. In the GSP scheme, instead of sending the same number of data symbols as the number of pilots (T ), the number of data symbols is reduced, optimized, and further precoded to avoid the possible pilot contamination in both the channel estimation and the data detection.…”
Section: Introductionmentioning
confidence: 99%
“…Related work on precoded superimposed training: In [20], [21], precoder and pilots are optimized under the condition T ≥ K + d and found to be proportional to the sub-discrete Fourier transform (DFT) matrix. In addition to that, authors in [22] provide orthogonal precoder and pilot design using the Cramer-Rao lower bound of the channel estimation error, whereas they compare joint and individual data & channel estimations via mutual information bounds in [23].…”
Section: Introductionmentioning
confidence: 99%
“…If the precoding matrix is full rank, it is impossible to make the training sequence orthogonal to precoded data . However, if the precoding matrix is rank deficient, training sequence can be embedded into the precoded data in a special orthogonal manner without bandwidth expansion . Early results that involved rank‐deficient precoding schemes were the data‐dependent superimposed training (DDST) in 1 study .…”
Section: Introductionmentioning
confidence: 99%
“…14 However, if the precoding matrix is rank deficient, training sequence can be embedded into the precoded data in a special orthogonal manner without bandwidth expansion. 18 Early results that involved rank-deficient precoding schemes were the datadependent superimposed training (DDST) in 1 study. 19 With the special orthogonal constraints in rank-deficient precoding, the channel is estimated independently of the precoded data, while the training sequence is completely nulled out in symbol detection.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation