Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.num-analysis.independent

Topic: Cepstrum computation
Replies: 1   Last Post: Dec 9, 1996 11:15 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Pascal A. Dupuis

Posts: 4
Registered: 12/7/04
Cepstrum computation
Posted: Dec 9, 1996 9:44 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Cepstrum may be computed either by fft (real(ifft(rcunwrap(log(fft(x))))),
or by a recursive approach [Oppenheim & Schaffer, ...)
cep(0) = log(x(0))
cep(n) = f(x(0..n), cep(0..n-1))
With the obvious restriction of the first coefficient <> 0.0. Does someone
know about similar formulations, but which could handle a zero first point
while keeping the minimum-phase property of the input sequence ?
(That is, adding something to the input sequence may break this property)
Thanks in advance
Pascal A. Dupuis

--
Q: How many existentialists does it take to screw in a lightbulb?
A: Two. One to screw it in and one to observe how the lightbulb
itself symbolizes a single incandescent beacon of subjective
reality in a netherworld of endless absurdity reaching out
toward a maudlin cosmos of nothingness.





Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.