Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

Viterbi, Andrew J.

doi:10.1109/tit.1967.1054010

Cited by 4,947 publications

(1,236 citation statements)

References 5 publications

Supporting

Mentioning

1,114

Contrasting

Unclassified

Order By: Relevance

“…Figure 8 illustrates the MAP state sequence decoded using the signal amplitude Gaussian mixtures as the output distributions of our HMM, and the statistical decoding procedure based on that of Viterbi. 68 This results in a state sequence of the current blockades in terms of the GMM amplitude distribution kernels. Partial-then-deep blockade for cis polymer entry and a deep-then-partial blockade for trans polymer entry emerge as common patterns.…”

Section: Geometry Of the ␣Hl Channel Probed With Ssdnamentioning

confidence: 99%

Probing single nanometer-scale pores with polymeric molecular rulers

Henrickson¹,

DiMarzio

Wang³

et al. 2010

The Journal of Chemical Physics

View full text Add to dashboard Cite

We previously demonstrated that individual molecules of single-stranded DNA can be driven electrophoretically through a single Staphylococcus aureus ␣-hemolysin ion channel. Polynucleotides thread through the channel as extended chains and the polymer-induced ionic current blockades exhibit stable modes during the interactions. We show here that polynucleotides can be used to probe structural features of the ␣-hemolysin channel itself. Specifically, both the pore length and channel aperture profile can be estimated. The results are consistent with the channel crystal structure and suggest that polymer-based "molecular rulers" may prove useful in deducing the structures of nanometer-scale pores in general.

show abstract

Section: Geometry Of the ␣Hl Channel Probed With Ssdnamentioning

confidence: 99%

Probing single nanometer-scale pores with polymeric molecular rulers

Henrickson¹,

DiMarzio

Wang³

et al. 2010

The Journal of Chemical Physics

View full text Add to dashboard Cite

show abstract

“…Correspondingly, in the receiver, the soft-decision Iturbi algorithm (Viterbi, 1967) and the Berlekamp-Massey (BM) algorithm (Massey, 1969) are employed in the decoding process. Integrating with the DAF (N) scheme, the modulated symbols of a codeword are partitioned into N equal parts for distributed relaying.…”

Section: Rscc Coded Daf Systemsmentioning

confidence: 99%

Distributed Amplify and Forward Cooperation While Maintaining Transmission Freedom

Arwa¹

2011

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

Problem statement:This study proposes a novel Distributed Amplify and-Forward (DAF) cooperative scheme, achieving higher diversity order and yet maintaining the same transmission freedom as the conventional Amplify-and-Forward (AF) scheme. In the DAF scheme, a user's transmitted symbols are partitioned into several sequences in order to be relayed by different users. Approach: In the cooperative network, each user still uses half of their transmission for relaying others' signals. But instead of relaying one user's entire transmitted sequence, it helps different users for the relaying. Theoretical analysis of the DAF scheme is carried out in order to justify its advantages over the existing schemes. The outage behavior and Diversity-Multiplexing Tradeoff (DMT) analyses of the DAF scheme are presented. Results: Through outage behavior analysis, it is shown the DAF scheme achieves substantial diversity gains over the AF scheme. Furthermore, the DMT analysis justices both the scheme's achievable diversity gains and its ability to maintain the same multiplexing gain as the AF scheme. The theoretical analyses are then extended to a general cooperative network consisting of N (N≥2) relays, showing the diversity order can be increased with respect to the number of relays but not at the expense of each user's multiplexing gain. Conclusion: Finally, a practical coded cooperative system that integrates the DAF scheme with the concatenated Reed-Solomon Convolution Codes (RSCC) is proposed, validating the achievable performance gain offered by the DAF scheme.

show abstract

“…Two well-known forward error correction (FEC) codes, convolutional code (CC) [1] and turbo code (TC) [2,3], were widely adopted by communication standards. The prevalent trellis decoding algorithms of the CCs and TCs are Viterbi algorithm (VA) [1] and maximum a posteriori algorithm (MAP) [2], respectively.…”

Section: Introductionmentioning

confidence: 99%

“…The prevalent trellis decoding algorithms of the CCs and TCs are Viterbi algorithm (VA) [1] and maximum a posteriori algorithm (MAP) [2], respectively. Nowadays, the MAP decoding is widely used to decode the CCs because of rapid growth of iterative detection and decoding [4].…”

Section: Introductionmentioning

confidence: 99%

Unified encoder embedded trellis router designs for decoding convolutional and turbo codes

Lin

Hsieh

2017

IEICE Electron. Express

View full text Add to dashboard Cite

Communication systems usually adopted different encoding structures of convolutional codes (CCs) and turbo codes (TCs). This Letter proposes a unified encoder embedded trellis router (UEETR) to support various decoding of single-binary/double-binary (SB/DB) CC and TC encoding structures with a small hardware overhead. Furthermore, a lowlatency UEETR and a hardware-shared radix-4 UEETR are explored to reduce initial setting time and to support radix-4 SB/DB CC and TC decoding, respectively. In addition, a flexible decoding kernel with a small area cost of proposed UEETR has been implemented by a 90-nm process.

show abstract

Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

Cited by 4,947 publications

References 5 publications

Probing single nanometer-scale pores with polymeric molecular rulers

Probing single nanometer-scale pores with polymeric molecular rulers

Distributed Amplify and Forward Cooperation While Maintaining Transmission Freedom

Unified encoder embedded trellis router designs for decoding convolutional and turbo codes

Contact Info

Product

Resources

About