An efficient algorithm to compute the Euclidean distance spectrum of a general intersymbol interference channel and its applications Academic Article uri icon

abstract

  • We present an efficient algorithm to compute the distance spectrum of a general finite intersymbol interference (ISI) channel, whose complexity is lower than those of existing methods. Closed-form expressions are derived for both input-output Euclidean distance enumerators and asymptotic distance spectrum shapes for 2-tap and 3-tap ISI channels. Coded and/or precoded ISI channels are also discussed. © 2004 IEEE.

author list (cited authors)

  • Li, J., Narayanan, K. R., & Georghiades, C. N.

citation count

  • 3

publication date

  • December 2004