Title: Algorithmic design of perfectly reconstructing equalisers

Authors: Rouzbeh Touri, Petros G. Voulgaris, Christoforos N. Hadjicostis

Addresses: Digital Signal Processing Engineer, Aware Inc., Bedford, MA 01730, USA. ' Department of Aeronautical and Astronautical Engineering, and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801-2307, USA. ' Department of Electrical and Computer Engineering, The University of Cyprus, 75 Kallipoleos Avenue, P.O. Box 20537, Nicosia 1678, Cyprus; Department of Electrical and Computer Engineering, and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801-2307, USA

Abstract: We consider the transmission of a discrete data sequence via a communication channel that is subject to (additive) noise with a known upper bound on its magnitude but otherwise completely unrestricted behaviour. We provide a general recursive algorithm that can be used at the receiving end to perfectly reconstruct the transmitted sequence (possibly with some delay) when the existing necessary and sufficient conditions for perfect reconstruction hold, or to obtain all valid sequences that are consistent with the received sequence when the perfect reconstruction condition is violated. We also discuss the memory and computational requirements for the proposed algorithm.

Keywords: equalisation; l¹ optimality; worst case; discrete data reconstruction; perfect reconstructability margin; perfectly reconstructing equalisers.

DOI: 10.1504/IJSCC.2010.031165

International Journal of Systems, Control and Communications, 2010 Vol.2 No.1/2/3, pp.238 - 255

Published online: 23 Jan 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article