DocumentCode :
933348
Title :
Entropy and an optimal random number transformation (Corresp.)
Author :
Horibe, Yasuichi
Volume :
27
Issue :
4
fYear :
1981
fDate :
7/1/1981 12:00:00 AM
Firstpage :
527
Lastpage :
529
Abstract :
A simple proof is given of the optimality of the procedure of D. E. Knuth and A. C. Yao for transforming a random number with distribution 
into one with distribution 
. A direct representation of the cost (average number of input symbols needed to output one symbol) of the optimal transformation is given in terms of entropy, a procedure that leads to a refined entropic upper bound to the cost.
into one with distribution . A direct representation of the cost (average number of input symbols needed to output one symbol) of the optimal transformation is given in terms of entropy, a procedure that leads to a refined entropic upper bound to the cost.Keywords :
Entropy functions; Random number generation; Active filters; Bandwidth; Cost function; Counting circuits; Entropy; Noise generators; Notice of Violation; Radar clutter; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1981.1056363
Filename :
1056363
Link To Document :
