Research of fast decoding for longer constraint length convolutional codes
To overcome the disadvantage of Viterbi decoding algorithm, in which its complexity exponentially increases with the increasing constraint length of convolutional codes, and the decoding delay was too large to fit the decoding of longer constraint length convolutional codes, a fast decoding of convo...
Saved in:
Main Authors: | HUANG Xiao-ling, YANG Hua-long |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2010-01-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/74649328/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Novel decoding of convolutional codes for OCDMA system
by: ZHOU Hai-xian, et al.
Published: (2009-01-01) -
Polar codes decoding algorithm based on convolutional neural network
by: Rui GUO, et al.
Published: (2020-06-01) -
Convolutional Neural Decoder for Surface Codes
by: Hyunwoo Jung, et al.
Published: (2024-01-01) -
Low Complexity Unquantized Forward Stack Decoding Algorithm for Spinal Codes in Measurement While Drilling Communication
by: Xiaoyang Yu, et al.
Published: (2025-01-01) -
Construction of a new class of (2k, k, 1) convolutional codes
by: Cheng-chang ZHENG, et al.
Published: (2014-06-01)