Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Construction and MAP Decoding of Optimal Variable-Length Error-Correcting Codes
 

Summary: On the Construction and MAP Decoding
of Optimal Variable-Length Error-Correcting Codes
Ting-Yi Wu, Po-Ning Chen, Fady Alajaji and Yunghsiang S. Han
Dept. of Elec. Eng., Nat'l Chiao-Tung Univ., Taiwan (Email: mavericktywu@gmail.com, poning@faculty.nctu.edu.tw)
Dept. of Mathematics and Statistics, Queen's Univ., Canada (Email: fady@mast.queensu.ca)
Dept. of Elec. Eng., Nat'l Taiwan Univ. of Science and Technology, Taiwan (Email: yshan@mail.ntust.edu.tw)
Abstract--In this paper, we present a novel algorithm that
guarantees of finding a variable-length error-correcting code
(VLEC) with minimal average codeword length for a fixed free
distance dfree. We also propose a low complexity maximum a
posterior (MAP) decoding algorithm for our codes under the
premise that the receiver knows the number of codewords being
transmitted. The resulting VLEC provides significant gains over
other codes from the literature. When compared with separate
source-channel tandem codes with identical dfree, such as a
tandem code consisting of a Huffman source code concatenated
with a (2, 1, 4) tail-biting convolutional channel code, our system
has only a 0.3 dB performance loss at a bit error rate of 10-5
while requiring significantly less decoding complexity.
I. INTRODUCTION

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering