An efficient algorithm for computing free distance (Corresp.)

Bahl, Lalit R.; Cullum, C. D.; Frazer, W. D.; Jelinek, F.

doi:10.1109/tit.1972.1054821

Cited by 51 publications

(18 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The first task is to verify the validity of the max module, and to determine a suitable memory depth. Take the (6,3,3) convolutional code as an example where 10 different memory depths are selected based on integer times of kl=9. When the Eb/No is respectively1.5db, 2db, and 2.5db, the BER is shown with or without the max module separately in Fig.…”

Section: Fig 3 Convergence Of Ber Performance For Memory Depthmentioning

confidence: 99%

“…6. It can be seen that, except for (6,3,1), the other (2k, k, l) convolutional codes have different degrees of advantage over (2, 1, l) convolutional codes. …”

Section: Fig 3 Convergence Of Ber Performance For Memory Depthmentioning

confidence: 99%

“…Early classical convolutional codes have self-orthogonal codes, orthogonalizable codes, and "quicklook-in" codes [1,2]. In the 1970s, to search optimum codes, some scholars proposed a Viterbi decoding search algorithm by computer [3]. In the 1980s, punctured convolutional codes and tail-biting convolutional codes were widely used in a variety of digital communication systems [4].…”

Section: Introductionmentioning

confidence: 99%

“…However, even if k is not too large, as a result of the multiplier effect, the growth of memory length of the (2k, k, l) convolutional codes is more significant than those of the (2, 1, l) convolutional codes. So, we will pick out (6,3) and (8,4), which are two double loop cyclic codes, as embedded codes in [10] to construct (6, 3, l) and (8, 4, l …”

mentioning

confidence: 99%

See 3 more Smart Citations

The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes

Wan-quan¹,

Zhang²

2014

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-The free distance of (n, k, l) convolutional codes has some connection with the memory length, which depends on not only l but also on k. To efficiently obtain a large memory length, we have constructed a new class of (2k, k, l) convolutional codes by (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generation function are also given in this paper. With the help of some matrix modules, we designed a single structure Viterbi decoder with a parallel capability, obtained a unified and efficient decoding model for (2k, k, l) convolutional codes, and then give a description of the decoding process in detail. By observing the survivor path memory in a matrix viewer, and testing the role of the max module, we implemented a simulation with (2k, k, l) convolutional codes. The results show that many of them are better than conventional (2, 1, l) convolutional codes.

show abstract

Section: Fig 3 Convergence Of Ber Performance For Memory Depthmentioning

confidence: 99%

“…6. It can be seen that, except for (6,3,1), the other (2k, k, l) convolutional codes have different degrees of advantage over (2, 1, l) convolutional codes. …”

Section: Fig 3 Convergence Of Ber Performance For Memory Depthmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes

Wan-quan¹,

Zhang²

2014

Journal of Information Processing Systems

View full text Add to dashboard Cite

show abstract

“…Bahl et al [21] Invented the Maximum A-Posteriori (MAP) algorithm. 1974 Bahl et al [22] Proposed the symbol based MAP algorithm.…”

mentioning

confidence: 99%

Near-Capacity Wireless System Design Principles

Nguyen

et al. 2015

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Abstract-In this tutorial, the design procedure of nearcapacity channel code design invoking non-binary EXtrinsic Information Transfer (EXIT) charts is illustrated by using design examples of Irregular Concatenated Coding Arrangements (ICCAs) relying on Irregular Convolutional Codes (IrCCs). More specifically, in order to benchmark the near-capacity design examples, both the capacity and the Outage Probability (OP) of the Continuous-input Continuous-output Memoryless Channel (CCMC), of the Discrete-input Continuous-output Memoryless Channel (DCMC) as well as of the Differential Discreteinput Continuous-output Memoryless Channel (D-DCMC) are characterised. Furthermore, the EXIT-chart aided near-capacity design principles are illustrated by detailing the design process of three characteristic prototype schemes, which represent the family of coherent and non-coherent detection based systems as well as Multi-Input Multi-Output (MIMO) systems, respectively. Moreover, the beneficial application of the EXIT-chart based design principle is also demonstrated in the context of cooperative systems using a specific distributed MIMO prototype scheme.

show abstract

Capacity of channels with uncoded side information

Shamai

Verdú

1995

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Parallel independent channels where no encoding is allowed for one of the channels are studied. The Slepian‐Wolf theorem on source coding of correlated sources is used to show that any information source whose entropy rate is below the sum of the capacity of the coded channel and the input/output mutual information of the uncoded channel is transmissible with arbitrary reliability. The converse is also shown. Thus, coding of the side information channel is unnecessary when its mutual information is maximized by the source distribution. Applications to superposed coded/uncoded transmission on Gaussian channels are studied and an information‐theoretic interpretation of Parallel‐Concatenated channel codes and, in particular. Turbo codes is put forth.

show abstract

An efficient algorithm for computing free distance (Corresp.)

Cited by 51 publications

References 7 publications

The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes

The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes

Near-Capacity Wireless System Design Principles

Capacity of channels with uncoded side information

Contact Info

Product

Resources

About