Logo - springer
Slogan - springer

Birkhäuser - Birkhäuser Engineering | Transforms and Fast Algorithms for Signal Analysis and Representations

Transforms and Fast Algorithms for Signal Analysis and Representations

Bi, Guoan, Zeng, Yonghong

2004, XIX, 422 p.

A product of Birkhäuser Basel
Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$69.99

(net) price for USA

ISBN 978-0-8176-8220-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$89.95

(net) price for USA

ISBN 978-0-8176-4279-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$89.95

(net) price for USA

ISBN 978-1-4612-6499-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

. . . that is what learning is. You suddenly understand something you've un­ derstood all your life, but in a new way. Various transforms have been widely used in diverse applications of science, engineering and technology. New transforms are emerging to solve many problems, which may have been left unsolved in the past, or newly created by modern science or technologies. Various meth­ ods have been continuously reported to improve the implementation of these transforms. Early developments of fast algorithms for discrete transforms have significantly stimulated the advance of digital signal processing technologies. More than 40 years after fast Fourier transform algorithms became known, several discrete transforms, including the discrete Hart­ ley transform and discrete cosine transform, were proposed and widely used for numerous applications. Although they all are related to the discrete Fourier transform, different fast algorithms and their implementations have to be separately developed to minimize compu­ tational complexity and implementation costs. In spite of the tremendous increase in the speed of computers or processors, the demands for higher processing throughout seemingly never ends. Fast algorithms have become more important than ever for modern applications to become a reality. Many new algorithms recently reported in the literature have led to important improvements upon a number of issues, which will be addressed in this book. Some discrete transforms are not suitable for signals that have time-varying frequency components. Although several approaches are available for such applications, various inher­ ent problems still remain unsolved.

Content Level » Professional/practitioner

Keywords » Fourier transform - algorithms - communication - complexity - discrete Fourier transform - electronics - fast Fourier transform - fast Fourier transform (FFT) - information - signal analysis - signal processing

Related subjects » Birkhäuser Computer Science - Birkhäuser Engineering - Birkhäuser Mathematics

Table of contents 

Introduction Polynomial Transforms and Their Fast Algorithms Fast Fourier Transform Algorithms Fast Algorithms for 1D Discrete Hartley Transforms Fast Algorithms for MD Discrete Hartley Transforms Fast Algorithms for 1D Discrete Cosine Transforms Fast Algorithms for MD Discrete Cosine Transform Integer Transforms and Fast Algorithms New Methods of Time-Frequency Analysis Index

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Communications Engineering, Networks.

Additional information