Cart (Loading....) | Create Account
Close category search window

A Two-Stage Algorithm to Reduce Encoding Delay of Turbo Source Coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haghighat, J. ; Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC ; Plant, D.V.

Lossless turbo source coding employs an iterative encoding algorithm to search for the smallest codeword length that guarantees zero distortion. Although such encoder achieves promising compression rates, running the iterative algorithm for each individual message block imposes a large delay on the system. To reduce this delay, we propose a two-stage encoding algorithm for turbo source coding. We show that converging to zero distortion after a definite number of iterations, can be predicted from the earlier behavior of the distortion function. This will enable us to produce a quick, and yet sufficiently accurate, estimate of the codeword length in the first encoding stage. In the second stage, we iteratively increase this estimated codeword length until reaching zero distortion. Also, we show that employing an auxiliary distortion measure at the first stage of encoding may allow for better estimates and decrease the delay furthermore. Numerical results show that the proposed algorithm will decrease the encoding delay up to 19%. Although there are previous works in the literature on delay reduction of turbo source coding, those works achieve lower delays by reducing the message block length. However, the proposed algorithm achieves lower delays for the same block length and therefore the actual "per bit" encoding delay is decreased.

Published in:

Vehicular Technology Conference, 2008. VTC 2008-Fall. IEEE 68th

Date of Conference:

21-24 Sept. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.