Soman, Anand K. and Vaidyanathan, P. P. (1993) Coding gain in paraunitary analysis/synthesis systems. IEEE Transactions on Signal Processing, 41 (5). pp. 1824-1835. ISSN 1053-587X. http://resolver.caltech.edu/CaltechAUTHORS:SOMieeetsp93b
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:SOMieeetsp93b
A formal proof that bit allocation results hold for the entire class of paraunitary subband coders is presented. The problem of finding an optimal paraunitary subband coder, so as to maximize the coding gain of the system, is discussed. The bit allocation problem is analyzed for the case of the paraunitary tree-structured filter banks, such as those used for generating orthonormal wavelets. The even more general case of nonuniform filter banks is also considered. In all cases it is shown that under optimal bit allocation, the variances of the errors introduced by each of the quantizers have to be equal. Expressions for coding gains for these systems are derived.
|Additional Information:||© Copyright 1993 IEEE. Reprinted with permission. Manuscript received May 20, 1991; revised July 21. 1992. The associate editor coordinating the review of this paper and approving it for publication was Prof. Faye Boudreaux-Bartels. This work was supported in part by NSF Grant MIP 8919196, Tektronix Inc., and Rockwell International. The authors are grateful to Dr. V. Sathe, General Instrument, for several useful comments on the topic of this paper. They also wish to acknowledge the comments of anonymous reviewers.|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||05 Jan 2007|
|Last Modified:||26 Dec 2012 09:28|
Repository Staff Only: item control page