IEEE Transactions on Information Theory · 1969 · 22 citations · 4 references
EngineeringComputer ScienceMathematicsDigital CommunicationInformation TheoryTheory Of ComputationChannel CodingCoding TheoryError Control CodingError-correcting CodesRate-distortion TheorySource CodingLower BoundsRate-distortion BoundsRate-distortion CodingRate-distortion FunctionRate-distortion TradeoffShannon Source Coding Theorem
Methods are given for the numerical computation of Shannon's rate-distortion function <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R(D)</tex> for certain memoryless message sources. It is first assumed that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">U</tex> , the set of possible message-source outputs, and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</tex> , the set of possible destination symbols, are countable. The computation of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R(D)</tex> for this case is reduced to a minimization problem in which the variables are the destination-symbol probabilities. For arbitrary <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">U</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</tex> , upper and lower bounds on <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R(D)</tex> are derived by partitioning <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">U</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</tex> each into a countable collection of disjoint subsets and employing the results derived previously for the case of countable <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">U</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</tex> . Conditions are then discussed under which these bounds can be made arbitrarily close to each other by choosing sufficiently fine partitions of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">U</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</tex> . Two examples are included to illustrate the results in detail.
4
Information Theory and Reliable Communication
David A. Bell · Electronics and Power · 1969 · 4K citations
Mathematical Theory of Communication
Marc D. Binder, Nobutaka Hirokawa, Uwe Windhorst · 2008 · 2.3K citations