Name
Abstract | ||
|---|---|---|
In this paper, we present performance upper bounds for convolutional codes terminated with finite input sequence. To obtain the upper bounds, we define a generalized weight enumerator representing the relation between the Hamming distance of the coded output and the Hamming distance of selected input bits of the code. The upper bounds on frame error rate (FER) and average bit error rate (BER) of selected bits are obtained from the generalized weight enumerators. We present a low complexity method to compute the weight enumerator of terminated convolutional codes based on a modified trellis. We also present a generalized weight enumerator of single error event to provide tighter performance upper bounds by removing codewords composed of multiple error events from the weight enumerator. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/WCNC.2003.1200355 | 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003. |
Keywords | Field | DocType |
performance upper bounds,terminated convolutional codes,finite input sequence,generalized weight enumerator,Hamming distance,frame error rate,bit error rate,modified trellis,single error event,codewords,multiple error events,transfer function | Discrete mathematics,Enumerator polynomial,Combinatorics,Convolutional code,Upper and lower bounds,Hamming distance,Transfer function,Frame error rate,Viterbi algorithm,Mathematics,Bit error rate | Conference |
Volume | ISSN | ISBN |
1 | 1525-3511 | 0-7803-7700-1 |
Citations | PageRank | References |
1 | 0.40 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hichan Moon | 1 | 63 | 12.40 |
| Donald C. Cox | 2 | 350 | 93.52 |