Close category search window
 

Joint optimization of scale factors and Huffman code books for MPEG-4 AAC

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)
Bauer, C. ; Dolby Labs., San Francisco, CA, USA ; Vinton, M.

This paper addresses the optimization problem of minimizing the distortion subject to a rate constraint for an MPEG-4 Advanced Audio Coding (AAC) encoder. We first develop a mathematical model of the AAC encoding process. In previous work, the joint optimization problem is modeled as a Viterbi search for a cheapest path through a trellis. This method involves an iteration over a Lagrangian multiplier. We improve on this method by deriving a very accurate guess for the value of the final Lagrangian multiplier of the iteration as a function of the Perceptual Entropy of the signal and the given rate constraint. This reduces the complexity of the Trellis Search significantly. Whereas previous methods including the Trellis Search did not provide optimal solutions to the problem of minimizing the distortion subject to a rate constraint, we establish two methods that for the first time solve this problem optimally. Our first method is based on the formulation and solution of a Mixed Integer Linear Program, whereas our second method uses a Dynamic Programming solution that does not rely on the iteration over a Lagrangian multiplier. Based on our optimal methods, we evaluate the performance of the heuristic Two Loop Search (TLS), which is used in most commercial AAC implementations to solve the problem under consideration, and the performance of the Trellis Search.

Published in:
Signal Processing, IEEE Transactions on  (Volume:54 ,  Issue: 1 )

Date of Publication: Jan. 2006

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.