2014 IEEE Globecom Workshops (GC Wkshps) 2014
DOI: 10.1109/glocomw.2014.7063631
|View full text |Cite
|
Sign up to set email alerts
|

Punctured vs. multidimensional TCM — A comparison w.r.t. complexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…An optimal polynomial time algorithm is then proposed to solve the problem. It is presented in [94] that punctured trellis-coded modulation (TCM) can obtain a high coding rate flexibility and a low decoding complexity, thus being an attractive alternative to MD-TCM for low-latency applications with high spectral efficiency. In [95], a robust link adaptation is enabled to support user data rates with a given reliability in a precoded DL system.…”
Section: Multiple Pathsmentioning
confidence: 99%
“…An optimal polynomial time algorithm is then proposed to solve the problem. It is presented in [94] that punctured trellis-coded modulation (TCM) can obtain a high coding rate flexibility and a low decoding complexity, thus being an attractive alternative to MD-TCM for low-latency applications with high spectral efficiency. In [95], a robust link adaptation is enabled to support user data rates with a given reliability in a precoded DL system.…”
Section: Multiple Pathsmentioning
confidence: 99%