NDLI: Near Shannon limit decoding for 1% packet error rate

Content Provider	IEEE Xplore Digital Library
Author	Lei Wei
Copyright Year	1998
Description	Author affiliation: Dept. of Eng., Australian Nat. Univ., Canberra, ACT, Australia (Lei Wei)
Abstract	In this paper a hierarchical decoding structure is proposed. With this decoding structure, we can near optimally decode a rate 1/2 convolutional code with memory length of 30 in a short packet format (300 information bits). The simulation results show that on Gaussian channels the packet drop rate of 1% can be achieved at the cost of: (a) the E/sub b//N/sub 0/ requirement is 1 dB away from the Shannon limit (where the rate loss due to the tail bits has not been considered) and (b) average computational complexity is about the same as a few thousand state Viterbi algorithm, but the maximum computational complexity could be high. Compared with the Shannon's sphere packing lower bound, for a packet drop rate of 1% the terminated rate 1/2 convolutional codes with m=14, 19 and 25 are nearly perfect (just under 1 dB of imperfectness, after consideration of the rate loss and the Shannon limit shift due to the tail bits and 3 parity bits), where the peak complexity for the hierarchical decoder is similar to that of the 1024, 4096 and 16384 state Viterbi decoder for m=14, 19 and 25, respectively.
Starting Page	2818
Ending Page	2823
File Size	481836
Page Count	6
File Format	PDF
ISBN	0780349849
DOI	10.1109/GLOCOM.1998.776581
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-11-08
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Error analysis Convolutional codes Tail Computational complexity Viterbi algorithm Error correction Turbo codes Information technology Gaussian channels
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Near optimally decoding long convolutional codes in short packet

Near Shannon Limit for Turbo Code with Short Frames

Turbo codes for binary symmetric and binary erasure channels

On the FER performance and decoding complexity of turbo codes

Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1

Evaluation of SOVA algorithm in turbo code

An efficient decoding algorithm for tailbiting codes on wireless channels

Convolutional codes for channels with deletion errors

A table-based reduced complexity sequential decoding algorithm

Near Shannon limit decoding for 1% packet error rate

Similar Documents

Near optimally decoding long convolutional codes in short packet

Near Shannon Limit for Turbo Code with Short Frames

Turbo codes for binary symmetric and binary erasure channels

On the FER performance and decoding complexity of turbo codes

Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1

Evaluation of SOVA algorithm in turbo code

An efficient decoding algorithm for tailbiting codes on wireless channels

Convolutional codes for channels with deletion errors

A table-based reduced complexity sequential decoding algorithm

Near Shannon limit decoding for 1% packet error rate