NDLI: Near-optimal limited-search detection on ISI/CDMA channels and decoding of long convolutional codes

Content Provider	IEEE Xplore Digital Library
Author	Lei Wei Honghui Qi
Copyright Year	1963
Abstract	We derive an upper bound on the bit-error probability (BEP) in limited-search detection over a finite interference channel. A unified channel model is presented; this includes finite-length intersymbol interference channels and multiuser CDMA channels as two special cases. We show that the BEP of the M-algorithm (MA) is bounded from above by the sum of three terms: an upper bound on the error probability of the Viterbi (1967) algorithm (VA) detection given by Forney Jr. (1972), and upper bounds on the error probabilities of two types of erroneous decision caused by the correct path loss event. We prove that error propagation (in terms of the mean recovery step number) is finite for all finite interference channels. The convergence and asymptotic behavior of the upper bounds are studied. The results show that, if a channel satisfies certain mild conditions, all series in the bounds are convergent. One of the key results is that, for any finite interference channel satisfying certain mild conditions. the asymptotic BEP of the MA is bounded by the same upper and lower bounds (which have the same asymptotical behavior) as those for the VA if the correct path loss probability is smaller than that of the VA. Furthermore, we extend the above results to near optimally decode long convolutional codes in a short packet format (about 200-300 bits). We present a nonsorting combined M/T algorithm and showed that the M/T algorithm with M>2(/sup d/free//sup n/) and T>(d/sub free/E/sub b/)/n can near-optimally decode the code. We also propose a hierarchical decoding algorithm (HDA) to further cut down the average decoding complexity. Numerical results show that the bounds are reasonably tight. The HDA can achieve a performance within about 0.8 dB of the sphere-packing lower bound for a packet error rate of 10/sup -4/ and a packet length below 200 bits, which is the best reported decoding performance so far for block sizes from 100 to 200 bits.
Sponsorship	IEEE Information Theory Society
Starting Page	1459
Ending Page	1482
Page Count	24
File Size	671721
File Format	PDF
ISSN	00189448
Volume Number	46
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intersymbol interference
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

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

On the performance evaluation of ISI channels

Comments on Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference

Coding for intersymbol interference channels-combined coding and precoding

Modulation and coding for linear Gaussian channels

Limited search trellis decoding of convolutional codes

Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

Graph-Based Decoding in the Presence of ISI

A general error-correcting code construction for run-length limited binary channels

Some extended results on the search for good convolutional codes

Near-optimal limited-search detection on ISI/CDMA channels and decoding of long convolutional codes

Similar Documents

On the performance evaluation of ISI channels

Comments on Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference

Coding for intersymbol interference channels-combined coding and precoding

Modulation and coding for linear Gaussian channels

Limited search trellis decoding of convolutional codes

Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

Graph-Based Decoding in the Presence of ISI

A general error-correcting code construction for run-length limited binary channels

Some extended results on the search for good convolutional codes

Near-optimal limited-search detection on ISI/CDMA channels and decoding of long convolutional codes