Discrete density of states

J. Wosiek

Jan Lewandowsky, Maximilian Stark, Gerhard Bauch

Recent works describe the design of discrete decoders for low-density parity-check codes by application of mutual information maximizing clustering algorithms in discrete density evolution. In the resulting discrete message passing decoders only integers are exchanged and node operations become simple lookup operations. Earlier works only describe discrete decoders for binary modulation schemes. This paper presents a new technique called message alignment which enables to design discrete decoders for higher-order modulation schemes. First, we design a channel output quantizer for quadrature amplitude modulation with the Information Bottleneck method. The quantizer attempts to preserve the relevant information on the modulation symbols. Afterwards, we illustrate that the assignment of several bits to one modulation symbol does not allow straightforward decoder design with the available discrete density evolution technique. The proposed message alignment solves this problem. The resulting discrete decoder is compared with state-of-the-art decoders using bit error rate simulations.

Rainer Dick

Rainer Dick

Tomáš Opatrný, Vladimír Bužek, J. Bajer +1 more

We present a Q function of a state of a quantum-mechanical system in a finite-dimensional Hilbert space. This discrete Q function is defined with the help of the W\'odkiewicz concept of propensities, i.e., we define the Q function as a discrete convolution of two Wigner functions based on Wootter's formalism, one of the state itself and one of the filter state. The discrete Q function takes nonnegative values in all ``points'' of the discrete phase space and is normalized and it is possible to reconstruct from it the density operator of the state under consideration. We analyze Q-function graphs for several states of interest.

Rainer Dick