An overcomplete stitching algorithm for time decoding machines

Aurel A. Lazar, Ernö K. Simonyi, László T. Tóth

Research output: Contribution to journalArticle

19 Citations (Scopus)


We investigate a class of finite-dimensional time decoding algorithms that: 1) is insensitive with respect to the time-encoding parameters; 2) is highly efficient and stable; and 3) can be implemented in real time. These algorithms are based on the observation that the recovery of time encoded signals given a finite number of observations has the property that the quality of signal recovery is very high in a reduced time range. We show how to obtain a local representation of the time encoded signal in an efficient and stable manner using a Vandermonde formulation of the recovery algorithm. Once the signal values are obtained from a finite number of possibly overlapping observations, the reduced-range segments are stitched together. The signal obtained by segment stitching is subsequently filtered for improved performance in recovery. Finally, we evaluate the complexity of the algorithms and their computational requirements for real-time implementation.

Original languageEnglish
Pages (from-to)2619-2630
Number of pages12
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Issue number9
Publication statusPublished - Nov 25 2008


  • Asynchronous communications
  • Frames
  • Irregular sampling
  • Real-time stitching algorithms
  • Time decoding machines (TDMs)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'An overcomplete stitching algorithm for time decoding machines'. Together they form a unique fingerprint.

  • Cite this