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 Citation (Scopus)

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

Fingerprint

Chebyshev approximation
Communication

ASJC Scopus subject areas

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

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.

Performance of complex Chebyshev approximation in delay-root-Nyquist filter design. / Yardim, A.; Karam, Lina; McClellan, J. H.; Cain, G. D.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 2 IEEE, 1996. p. 169-172.

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

Yardim, A, Karam, L, McClellan, JH & Cain, GD 1996, Performance of complex Chebyshev approximation in delay-root-Nyquist filter design. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 2, IEEE, pp. 169-172, Proceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4), Atlanta, GA, USA, 5/12/96.
Yardim A, Karam L, McClellan JH, Cain GD. Performance of complex Chebyshev approximation in delay-root-Nyquist filter design. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 2. IEEE. 1996. p. 169-172
Yardim, A. ; Karam, Lina ; McClellan, J. H. ; Cain, G. D. / Performance of complex Chebyshev approximation in delay-root-Nyquist filter design. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 2 IEEE, 1996. pp. 169-172
@inproceedings{395d6778efdf4bbb8a5b29141f6f54c0,
title = "Performance of complex Chebyshev approximation in delay-root-Nyquist filter design",
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.",
author = "A. Yardim and Lina Karam and McClellan, {J. H.} and Cain, {G. D.}",
year = "1996",
language = "English (US)",
volume = "2",
pages = "169--172",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "IEEE",

}

TY - GEN

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

AU - Yardim, A.

AU - Karam, Lina

AU - McClellan, J. H.

AU - Cain, G. D.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029695884&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029695884&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 169

EP - 172

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - IEEE

ER -