The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
Andreas Burg, Simon Haene, Wolfgang Fichtner, Mark...
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...