Round-up of integer bit allocation

Access Full Text

Round-up of integer bit allocation

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

A non-iterative algorithm is presented for the round-up procedure of integer bit allocation. The round-up algorithm will give the optimum result without the disadvantages of the traditional iterative method.

Inspec keywords: source coding; quantisation (signal)

Other keywords: integer bit allocation; source coding; quantization; round-up procedure; communication applications; noniterative algorithm

Subjects: Codes; Information theory

References

    1. 1)
      • P.A. Wintz , A.J. Kurtenbach . Waveform error control in PCM telemetry. IEEE Trans. Inf. Theory , 650 - 661
    2. 2)
      • M.S. Jayant , P. Noll . (1984) Digital coding of waveforms.
    3. 3)
      • Y. Huang , P.M. Schultheiss . Block quantization of correlated gaussing random variables. IEEE Trans. Commun. Syst. , 3 , 289 - 296
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20020329
Loading

Related content

content/journals/10.1049/el_20020329
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading