SEQUENTIAL DECODING ALGORITHMS OF CONVOLUTIONAL CODES: IMPLEMENTATION, IMPROVEMENT AND COMPARISON

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

HADI M.; PAKRAVAN M.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2015 | Volume:3 | Issue:2 (10) Page(s): 61-73

Download Full-Text

Persian Verion

View:

1,049

Download:

Cites:

Information Journal Paper

Title

SEQUENTIAL DECODING ALGORITHMS OF CONVOLUTIONAL CODES: IMPLEMENTATION, IMPROVEMENT AND COMPARISON

Author(s)

HADI M. | PAKRAVAN M.R. | Issue Writer Certificate

Keywords

CONVOLUTIONAL CODESQ2

SEQUENTIAL DECODING OF CONVOLUTIONAL CODESQ2

VITERBI ALGORITHMQ2

FANO ALGORITHMQ2

STACK ALGORITHMQ2

CONVOLUTIONAL CODE CONSTRAINT LENGTHQ2

Abstract

Error correction capability of CONVOLUTIONAL CODES is improved by increasing code constraint length. However, increasing the constraint length results in high complexity of optimum Viterbi decoding algorithm because the number of computations in VITERBI ALGORITHM is exponentially proportional to the constraint length. Consequently, decoding of high constraint length CONVOLUTIONAL CODES using VITERBI ALGORITHM may practically be impossible. Sub-optimum decoding algorithms such as Fano and STACK ALGORITHMs have been proposed to feasible fast sequential decoding of high constraint length CONVOLUTIONAL CODES. In this paper, we introduce different methods of implementing Fano and STACK ALGORITHMs and propose some techniques to improve their speed and required memory. We compare the introduced implementations of the algorithms in terms of error correction capability, decoding time and required memory. Furthermore, we use simulation results to show that if the communication error is low, Fano and STACK ALGORITHMs can provide the same error correction capability as the optimum VITERBI ALGORITHM in very short decoding time.

Cites

No record.

References

No record.

Cite

APA: Copy

HADI, M., & PAKRAVAN, M.R.. (2015). SEQUENTIAL DECODING ALGORITHMS OF CONVOLUTIONAL CODES: IMPLEMENTATION, IMPROVEMENT AND COMPARISON. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 3(2 (10)), 61-73. SID. https://sid.ir/paper/243135/en

Vancouver: Copy

HADI M., PAKRAVAN M.R.. SEQUENTIAL DECODING ALGORITHMS OF CONVOLUTIONAL CODES: IMPLEMENTATION, IMPROVEMENT AND COMPARISON. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2015;3(2 (10)):61-73. Available from: https://sid.ir/paper/243135/en

IEEE: Copy

M. HADI, and M.R. PAKRAVAN, “SEQUENTIAL DECODING ALGORITHMS OF CONVOLUTIONAL CODES: IMPLEMENTATION, IMPROVEMENT AND COMPARISON,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 3, no. 2 (10), pp. 61–73, 2015, [Online]. Available: https://sid.ir/paper/243135/en

Related Journal Papers