Digital Signal Processing Algorithms: Number Theory, Convolution, Fast Fourier Transforms and Applications / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $49.46
Usually ships in 1-2 business days
(Save 79%)
Other sellers (Hardcover)
  • All (6) from $49.46   
  • New (3) from $115.82   
  • Used (3) from $49.46   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$115.82
Seller since 2008

Feedback rating:

(210)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New

Ships from: Chicago, IL

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$189.85
Seller since 2008

Feedback rating:

(4662)

Condition: New
New Book. Shipped from UK within 10 to 14 business days. Established seller since 2000.

Ships from: Horcott Rd, Fairford, United Kingdom

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$300.07
Seller since 2014

Feedback rating:

(7)

Condition: New
2015 Hardback NEW 9780849371783 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Print on Demand title, ... produced to the highest standard, and there would be a delay in dispatch of around 15 working days. *****PLEASE NOTE: This item is shipping from an authorized seller in Europe. In the event that a return is necessary, you will be able to return your item within the US. To learn more about our European sellers and policies see the BookQuest FAQ section***** Read more Show Less

Ships from: Stroud, Glos, United Kingdom

Usually ships in 1-2 business days

  • Canadian
  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

Digital Signal Processing Algorithms describes computational number theory and its applications to deriving fast algorithms for digital signal processing. It demonstrates the importance of computational number theory in the design of digital signal processing algorithms and clearly describes the nature and structure of the algorithms themselves. The book has two primary focuses: first, it establishes the properties of discrete-time sequence indices and their corresponding fast algorithms; and second, it investigates the properties of the discrete-time sequences and the corresponding fast algorithms for processing these sequences.
Digital Signal Processing Algorithms examines three of the most common computational tasks that occur in digital signal processing; namely, cyclic convolution, acyclic convolution, and discrete Fourier transformation. The application of number theory to deriving fast and efficient algorithms for these three and related computationally intensive tasks is clearly discussed and illustrated with examples.
Its comprehensive coverage of digital signal processing, computer arithmetic, and coding theory makes Digital Signal Processing Algorithms an excellent reference for practicing engineers. The authors' intent to demystify the abstract nature of number theory and the related algebra is evident throughout the text, providing clear and precise coverage of the quickly evolving field of digital signal processing.

Read More Show Less

Editorial Reviews

Booknews
A text covering all aspects of polynomial algebra as it pertains to the design of fast algorithms. Describes computational number theory and its applications to deriving fast algorithms for digital signal processing, demonstrates the importance of computational number theory in the design of digital signal processing algorithms, and explains the nature and structure of the algorithms themselves. Focuses on properties of discrete-time sequence indices and the corresponding fast algorithms for processing these sequences. Includes many chapter problems. Later chapters assume familiarity with basics of error control coding. Annotation c. by Book News, Inc., Portland, Or.
Read More Show Less

Product Details

  • ISBN-13: 9780849371783
  • Publisher: Taylor & Francis
  • Publication date: 3/25/1998
  • Series: Computer Science & Engineering Series, #9
  • Edition number: 1
  • Pages: 672
  • Product dimensions: 6.50 (w) x 9.50 (h) x 1.63 (d)

Table of Contents

Introduction
Outline
The Organization
PART I: Computational Number Theory
Computational Number Theory
Groups, Rings, and Fields
Elements of Number Theory
Integer Rings and Fields
Chinese Remainder Theorem for Integers
Number Theory for Finite Integer Rings
Polynomial Algebra
Algebra of Polynomials over a Field
Roots of a Polynomial
Polynomial Fields and Rings
The Chinese Remainder Theorem for Polynomials
CRT-P in Matrix Form
Lagrange Interpolation
Polynomial Algebra over GF(p)
Order of an Element
Theoretical Aspects of Discrete Fourier Transform and Convolution
The Discrete Fourier Transform
Basic Formulation of Convolution
Bounds on the Multiplicative Complexity
Basic Formulation of Convolution Algorithms
Matrix Exchange Property
Cyclotomic Polynomial Factorization and Associated Fields
Cyclotomic Polynomial Factorization over Complex and Real Numbers
Cyclotomic Polynomial Factorization over Rational Numbers
Cyclotomic Fields and Cyclotomic Polynomial Factorizations
Extension Fields of Cyclotomic Fields and Cyclotomic Polynomial Factorization
A Preview of Applications to Digital Signal Processing
Cyclotomic Polynomial Factorization in Finite Fields
Cyclotomic Polynomial Factorization
Factorization of (un - 1) over GF (p)
Primitive Polynomials over GF (p)
Complex Finite Fields and Cyclotomic Polynomial Factorization
Finite Integer Rings: Polynomial Algebra and Cyclotomic Factorization
Polynomial Algebra over a Ring
Lagrange Interpolation
Number Theoretic Transforms
Monic Polynomial Factorization
Extension of CRT-P over Finite Integer Rings
Polynomial Algebra and CRT-PR: The Complex Case
Number Theoretic Transforms: The Complex Case
Pseudo Number Theoretic Transforms
Polynomial Algebra and Direct Sum Properties in Integer Polynomial Rings
PART II: Convolution Algorithms
Thoughts on Part II
Fast Algorithms for Acyclic Convolution
CRT-P Based Fast Algorithms for One-Dimensional Acyclic Convolution
Casting the Algorithm in Bilinear Formulation
Multidimensional Approaches to One-Dimensional Acyclic Convolution
Multidimensional Acyclic Convolution Algorithms
Nesting and Split Nesting Algorithms for Multidimensional Convolution
Acyclic Convolution Algorithms over Finite Fields and Rings
Fast One-Dimensional Cyclic Convolution Algorithms
Bilinear Forms and Cyclic Convolution
Cyclotomic Polynomials and Related Algorithms over Re and C
Cyclotomic Polynomials and Related Algorithms over Z
Other Considerations
Complex Cyclotomic Polynomials and Related Algorithms over CZ
The Agarwal-Cooley Algorithm
Cyclic Convolution Algorithms over Finite Fields and Rings
Two- and Higher Dimensional Cyclic Convolution Algorithms
Polynomial Formulation and an Algorithm
Improvements and Related Algorithms
Discrete Fourier Transform Based Algorithms
Algorithms Based on Extension Fields
Algorithms for Multidimensional Cyclic Convolution
Algorithms for Two-Dimensional Cyclic Convolution in Finite Integer Rings
Validity of Fast Algorithms over Different Number Systems
Introduction
Mathematical Preliminaries
Chinese Remainder Theorem over Finite Integer Rings
Interrelationships among Algorithms over Different Number Systems
Analysis of Two-Dimensional Cyclic Convolution Algorithms
Fault Tolerance for Integer Sequences
A Framework for Fault Tolerance
Mathematical Structure of C over Z(M)
Coding Techniques over Z(q)
Examples and SFC-DFD Codes
PART III: Fast Fourier Transform (FFT)
Algorithms
Thoughts on Part III
Fast Fourier Transform: One-Dimensional Data Sequences
The DFT: Definitions and Properties
Rader's FFT Algorithm, n=p, p an Odd Prime
Rader's FFT Algorithm, n=pc, p an Odd Prime
Cooley-Tukey FFT Algorithm, n=a . b
FFT Algorithms for n a Power of 2
The Prime Factor FFT n=a . b, (a,b) =1
The Winograd FFT Algorithm
Fast Fourier Transform: Multidimensional Data Sequences
The Multidimensional DFT: Definition and Properties
FFT for n=p, p an Odd Prime
Multidimensional FFT Algorithms for n a Power of 2
Matrix Formulation of Multidimensional DFT and Related Algorithms
Polynomial Version of Rader's Algorithm
Polynomial Transform Based FFT Algorithms
PART IV: Recent Results on Algorithms in Finite Integer Rings
Thoughts on Part IV
Paper One: A Number Theoretic Approach to Fast Algorithms for Two-Dimensional Digital Signal Processing in Finite Integer Rings
Paper Two: On Fast Algorithms for One-Dimensional Digital Signal Processing in Finite Integer and Complex Integer Rings
Paper Three: Cyclotomic Polynomial Factorization in Finite Integer Rings with Applications to Digital Signal Processing
Paper Four: Error Control Techniques for Data Sequences Defined in Finite Integer Rings
A. Small Length Acyclic Convolution Algorithms
B. Classification of Cyclotomic Polynomials
Index

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)