NDLI: Fast algorithms for PTFTs

Content Provider	IEEE Xplore Digital Library
Author	Guoan Bi Gang Li
Copyright Year	2011
Description	Author affiliation: School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore (Guoan Bi) \|\| College of Information Engineering, Zhe Jiang University of Technology, China (Gang Li)
Abstract	The polynomial time frequency transforms have become a useful tool to analyze polynomial-phase signals for their time-varying characteristics. To minimize the required computational complexity to deal with high order polynomial-phase signals, efficient fast algorithms are extremely important for any practical applications. Based on radix-3 decomposition techniques, this paper presents fast algorithms for any order of the polynomial-phase signals. It shows that the proposed algorithms are simple in concept and achieve significant savings on computational complexity compared to other reported algorithms.
Starting Page	2534
Ending Page	2537
File Size	234073
Page Count	4
File Format	PDF
ISBN	9781424487547
e-ISBN	9781424487561
e-ISBN	9781424487554
DOI	10.1109/ICIEA.2011.5976019
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-06-21
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Transforms Bismuth Computational complexity Signal processing algorithms Time frequency analysis Polynomials Signal processing decimation-in-frequency Polynomial-phase signals polynomial time frequency transform
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Generalized Fast Algorithms for the Polynomial Time-Frequency Transform

Split-Radix Algorithms for Arbitrary Order of Polynomial Time Frequency Transforms

Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences

Real-valued decimation-in-time and decimation-in-frequency algorithms

Efficient Algorithm for Modified Local Polynomial Time Frequency Transform

Fast algorithms for generalized discrete Hartley transform of composite sequence lengths

Need for speed: Fast Stockwell transform (FST) with O(N) complexity

Combined polynomial transform and radix-q algorithm for MD discrete W transform

New polynomial transform algorithms for multidimensional DFT's and convolutions

Fast algorithms for PTFTs

Similar Documents

Generalized Fast Algorithms for the Polynomial Time-Frequency Transform

Split-Radix Algorithms for Arbitrary Order of Polynomial Time Frequency Transforms

Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences

Real-valued decimation-in-time and decimation-in-frequency algorithms

Efficient Algorithm for Modified Local Polynomial Time Frequency Transform

Fast algorithms for generalized discrete Hartley transform of composite sequence lengths

Need for speed: Fast Stockwell transform (FST) with O(N) complexity

Combined polynomial transform and radix-q algorithm for MD discrete W transform

New polynomial transform algorithms for multidimensional DFT's and convolutions

Fast algorithms for PTFTs