Skip to content
Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Skip to product information
1 of 1

The Sparse Fourier Transform - Hardcover

$161.93 USD
$161.93 USD
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fastest Delivery Tomorrow With Vip DealOrder within 1 hr 8 mins.

Instant 10% Discount On HDFC Banks Credit/Debit Cards EMI and CreditCard

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
The Sparse Fourier Transform - Hardcover
The Sparse Fourier Transform - Hardcover
The Sparse Fourier Transform - Hardcover
$161.93/ea
$0.00
$161.93/ea $0.00

Product Description

by Haitham Hassanieh (Author)

The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.

This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.

This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.

Author Biography

Haitham Hassanieh is an assistant professor in the Electrical and Computer Engineering and Computer Science departments at the University of Illinois at Urbana Champaign. He received his bachelor's in Computer and Communications Engineering from the American University of Beirut in 2009. He received his M.S. and Ph.D. in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology in 2011 and 2016, respectively. He works on wireless networks, sensing systems, and algorithms. He has won multiple awards including the 2017 MobiSys Best Paper Award, the 2011 SIGCOMM Best Paper Award, the Sprowls award for best thesis in computer science at MIT, the TR10 award for Technology Review Top 10 Breakthrough Technologies, and the ACM Doctoral Dissertation Award.

Number of Pages: 279
Dimensions: 0.69 x 9.25 x 7.5 IN
Publication Date: February 27, 2018
you might like