Performance of complex Chebyshev approximation in delay-root-Nyquist filter design
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.