.png){kind=icon}
Return
Efficient computation of trellis code generating functions
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2003.822702.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
distance spectrum
error probability
generating functions
transfer functions
trellis-code modulation
trellis codes
union bounds
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available
Cited Papers
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
OAAIShareSave
View more