BlahutAlgorithm: Implementation of the Blahut algorithm described in (Blahut,...

In RateDistortion: Routines for Solving Rate-Distortion Problems

Description

This function takes an information source, destination alphabet, and cost function, and computes an optimal channel for this source at a given point along the corresponding rate–distortion curve.

Usage

BlahutAlgorithm(x, px, y, rho.fn, s,
    eps = 0.001, max.iters = Inf, rho.scale = 1, ...)

Arguments

x	The input or source alphabet for the channel. Either a vector or a matrix. For a vector, each element corresponds to one symbol in the input alphabet. For a matrix, each row corresponds to one symbol.
px	A vector of probabilities over the source alphabet. This vector should sum to 1. The length of the vector should equal the number of rows in x in the case that x is a matrix.
y	The output alphabet for the channel. This can either be a vector or a matrix.
rho.fn	The cost function for the channel, defining rho.fn(x, y) over the domain of x and y. This function should accept vectorized arguments.
s	A point along the rate-distortion curve for the channel, equal to the slope of the curve at which to compute the rate and distortion (see Blahut, 1972 for complete details).
eps	Convergence parameter for the Blahut algorithm.
max.iters	Maximum number of iterations for the Blahut algorithm.
rho.scale	An optional scaling parameter for the cost function. If set, the cost used in the algorithm is rho.scale * rho.fn(x, y). This can be useful for avoiding numerical overflow or underflow for badly scaled cost functions.
...	Optional arguments that are passed to the cost function.

Value

This function returns an object of the class channel. This object contains the elements:

R	The information rate (in bits) for the channel at the point s along the rate–distortion curve.
D	The distortion for the channel at the point s, based on the cost function given by rho.fn.

The remaining elements of the class summarize and record the input arguments to the function BlahutAlgorithm.

Author(s)

Chris R. Sims

References

Blahut, R. E. (1972). Computation of channel capacity and rate-distortion functions. IEEE Transactions on Information Theory, 18(4):460–473.

See Also

FindOptimalChannel, FindRate

Examples

# Define a discretized Gaussian information source
x <- seq(from = -10, to = 10, length.out = 100)
Px <- dnorm(x, mean = 0, sd = 3)
Px <- Px / sum(Px) # Ensure that probability sums to 1
y <- x # The destination alphabet is the same as the source

# Define a quadratic cost function
cost.function <- function(x, y) {
    (y - x)^2
}

# A different cost function with additional named input arguments
cost.function.2 <- function(x, y, alpha = 1.0) {
    abs(y - x) ^ alpha
}

# Slope of the rate-distortion curve
s <- -1

# Compute the rate-distortion value at the given point s
channel <- BlahutAlgorithm(x, Px, y, cost.function, s)

# Not run:
# channel.2 <- BlahutAlgorithm(x, Px, y, cost.function.2, s, alpha = 1.5)

print(channel)

RateDistortion documentation built on May 1, 2019, 9:52 p.m.