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

Low power VLSI implementation of the map decoder for turbo codes through forward recursive calculation of reverse state metrics

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)
Atluri, I. ; Sch. of Eng. & Electron., Univ. of Edinburgh, UK ; Arslan, T.

Memory utilization is a vital issue in the implementation of the MAP algorithm. The MAP decoder operating in the log domain requires either the forward or the backward path metrics to be stored before finally calculating the log-likelihood decisions. This process consumes large amount of memory. In this paper, we present a reduced complexity version of a technique which computes the reverse state metrics in the forward direction and hence reduces the required memory size. A low power VLSI architecture of a log-MAP decoder employing this technique is presented. We provide results which demonstrate that the proposed design reduces the memory size and hence reduces the power consumption by 35%.

Published in:

SOC Conference, 2003. Proceedings. IEEE International [Systems-on-Chip]

Date of Conference:

17-20 Sept. 2003

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.