Algorithmic design of perfectly reconstructing equalisers

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

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)238-255
Number of pages18
JournalInternational Journal of Systems, Control and Communications
Volume2
Issue number1-3
DOIs
StatePublished - Jan 1 2010

    Fingerprint

Keywords

  • discrete data reconstruction
  • equalisation
  • l optimality
  • perfect reconstructability margin
  • worst case

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this