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

Adaptive Modulation and Coding Schemes Based on LDPC Codes with Irregular Modulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(10 citation statements)
references
References 16 publications
0
10
0
Order By: Relevance
“…To prove Proposition 1(i), we first show that the achievable rate R(H, Q) can be asymptotically characterized by C MT and Q regardless of channel realization H. Combining (38) and (39), we obtain (37). With Remark 1, we can obtain an upper bound for the full CSIT capacity as detailed below.…”
Section: A Proof Of Propositionmentioning
confidence: 96%
See 1 more Smart Citation
“…To prove Proposition 1(i), we first show that the achievable rate R(H, Q) can be asymptotically characterized by C MT and Q regardless of channel realization H. Combining (38) and (39), we obtain (37). With Remark 1, we can obtain an upper bound for the full CSIT capacity as detailed below.…”
Section: A Proof Of Propositionmentioning
confidence: 96%
“…In a MIMO channel with antenna correlation, information rates should be carefully allocated to different channel eigen-directions. Adaptive modulation is a standard approach for this purpose [37], [38]. Denote the number of bits carried by the symbol on the n-th eigen-direction by Q n , and its average over all eigen-directions byQ.…”
Section: Introductionmentioning
confidence: 99%
“…At the transmitter, it requires N 2 c multiplications per OFDM symbol as shown in (3). At the receiver, in addition to the matrix operation for despreading, MMSEC is applied to compensate for collapse of orthogonality due to frequency selective fading, and it requires 2 × N c multiplications according to (9) and (10). Thus computational complexity by FSS totally increases by 2N c (N c +1) per OFDM symbol.…”
Section: Throughput Performance Evaluationmentioning
confidence: 99%
“…Low Density Parity Check is a channel coding that adds redundancy bits used for error detection and correction (Ahn and Yang, 2010). Gallager (1962) invented the LowDensity Parity Check Code (LDPC) that achieves the target of a random but systematic code, enabling near Shannonlimit performance.…”
Section: Orthogonal Frequency Division Multiplexing and Low Density Pmentioning
confidence: 99%