Performance of complex Chebyshev approximation in delay-root-Nyquist filter design

A. Yardim, Lina Karam, J. H. McClellan, G. D. Cain

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Root-Nyquist filters are crucial components in data communications and recently the ability to attach fractional sample delay attributes to them has become very important. Here we explore the application of Chebyshev approximation to design of such filters. Special attention is paid to the use of the Karam-McClellan algorithm, a fully complex extension of the well-established Parks-McClellan algorithm, which delivers peak error performance improvement in the region of one dB or better.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
Pages169-172
Number of pages4
Volume2
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA
Duration: May 12 1996May 15 1996

Other

OtherProceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4)
CityAtlanta, GA, USA
Period5/12/965/15/96

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Fingerprint Dive into the research topics of 'Performance of complex Chebyshev approximation in delay-root-Nyquist filter design'. Together they form a unique fingerprint.

  • Cite this

    Yardim, A., Karam, L., McClellan, J. H., & Cain, G. D. (1996). Performance of complex Chebyshev approximation in delay-root-Nyquist filter design. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 2, pp. 169-172). IEEE.