This paper deals with the problem of simulating a discrete memoryless channel and proposes two algorithms for channel simulation by using the interval algorithm. The rst algorithm provides exact channel simulation and the number of fair random bits per input sample approaches the conditional resolvability of the channel with probability one. The second algorithm provides approximate channel sim...

A system equation with certain properties describes implicitly function sets as the basis for an optimal design of a digital circuit. A necessary condition for the realization of a digital circuit is that the associated system equation is resolvable [2], [4]. This paper shows how the resolvability of the system equation can be checked and how the explicit description of the circuit functions ca...

The conventional channel resolvability problem refers to the determination of the minimum rate needed for an input process to approximate the output distribution of a channel in either the total variation distance or the relative entropy. In contrast to previous works, in this paper, we use the (normalized or unnormalized) Rényi divergence (with the Rényi parameter in [0,2]) to measure the leve...