.png){kind=icon}
返回
Efficient computation of trellis code generating functions
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2003.822702.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For trellis codes, generating function techniques provide the distance spectrum and a union bound on bit-error rate. The computation of the generating function of a trellis code may be separated into two stages. The first stage reduces the number of states as much as possible using low-complexity approaches. The second stage produces the generating function from the reduced-state diagram through some form of matrix inversion, which has a relatively high complexity. In this paper, we improve on the amount of state reduction possible during the low-complexity first stage. We also show that for a trellis code that is a linear convolutional code followed by a signal mapper, the number of states may always be reduced from N-2 to ((N-2 - N)/2) + 1 using low-complexity techniques. Finally, we analytically compare the complexity of various matrix inversion techniques and verify through simulation that the two-stage approach we propose has the lowest complexity. In an example, the new technique produced the union bound in about half the time required by the best algorithm already in the literature.
Keyword:
distance spectrum
error probability
generating functions
transfer functions
trellis-code modulation
trellis codes
union bounds
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
Clinical Characteristics and Overall Survival Among Acute Myeloid Leukemia (AML) Patients with TP53 Gene Mutation (TP53m) or Chromosome 17p Deletion (17p del).png)
Blood
OAAI
BloodIF0
OAAI分享收藏
查看更多内容