New cepstrum algorithms

Simple item page
dc.contributor.authorPienaar F.H.
dc.date.accessioned2011-05-15T16:05:55Z
dc.date.available2011-05-15T16:05:55Z
dc.date.issued1994
dc.description.abstractNew algorithms are introduced for computing 2N-1 points of the complex cepstrum and N unique points of the real cepstrum while using only N-point FFT calculations. These methods are compared to existing methods, and some indication is given of their applicability.
dc.description.versionConference Paper
dc.identifier.citation[No source information available]
dc.identifier.urihttp://hdl.handle.net/10019.1/13202
dc.publisherIEEE
dc.subjectApproximation theory
dc.subjectCalculations
dc.subjectFast Fourier transforms
dc.subjectCepstrum algorithms
dc.subjectComplex logarithm approximations
dc.subjectDiscrete Fourier transform
dc.subjectLinear combination
dc.subjectReal cepstrum
dc.subjectAlgorithms
dc.titleNew cepstrum algorithms
dc.typeConference Paper
Files
Collections
Stellenbosch University - Scopus Publications