Search International and National Patent Collections
Some content of this application is unavailable at the moment.
If this situation persists, please contact us atFeedback&Contact
1. (WO2017132670) FIXED-POINT HIGH DYNAMIC RANGE FAST FOURIER TRANSFORMS
Latest bibliographic data on file with the International Bureau

Pub. No.: WO/2017/132670 International Application No.: PCT/US2017/015634
Publication Date: 03.08.2017 International Filing Date: 30.01.2017
IPC:
G06F 17/14 (2006.01) ,G06F 19/00 (2011.01) ,G01R 23/16 (2006.01) ,G06F 17/00 (2006.01) ,H04L 27/00 (2006.01)
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
F
ELECTRIC DIGITAL DATA PROCESSING
17
Digital computing or data processing equipment or methods, specially adapted for specific functions
10
Complex mathematical operations
14
Fourier, Walsh or analogous domain transformations
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
F
ELECTRIC DIGITAL DATA PROCESSING
19
Digital computing or data processing equipment or methods, specially adapted for specific applications
G PHYSICS
01
MEASURING; TESTING
R
MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
23
Arrangements for measuring frequencies; Arrangements for analysing frequency spectra
16
Spectrum analysis; Fourier analysis
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
F
ELECTRIC DIGITAL DATA PROCESSING
17
Digital computing or data processing equipment or methods, specially adapted for specific functions
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
L
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
27
Modulated-carrier systems
Applicants:
ANALOG DEVICES, INC. [US/US]; One Technology Way Norwood, Massachusetts 02062, US
Inventors:
LERNER, Boris; US
Agent:
HARTMANN, Natalya; US
Priority Data:
15/008,98428.01.2016US
Title (EN) FIXED-POINT HIGH DYNAMIC RANGE FAST FOURIER TRANSFORMS
(FR) TRANSFORMÉES DE FOURIER RAPIDES À PLAGE DYNAMIQUE ÉLEVÉE DE POINT FIXE
Abstract:
(EN) A method for generating a Fast Fourier Transform (FFT) is disclosed. The method includes providing an input signal to two or more fixed-point FFT algorithms that apply different scaling to reduce growth of their output, resulting in each of the FFT algorithms yielding an array of FFT output values characterized by a different gain. The method further includes determining, on a per-FFT output value basis, whether an output value of an FFT algorithm with a relatively high gain was clipped due to saturation. If not, then the output value of that FFT algorithm is included in the final FFT. Otherwise, an output value of an FFT algorithm with a lower gain is included in the final FFT. Reconstructing the final FFT by such combination of values from different FFTs allows benefiting from the advantages of both higher- and lower-gain FFTs while avoiding or minimizing their disadvantages.
(FR) L'invention concerne un procédé de génération d'une transformée de Fourier rapide (FFT). Le procédé consiste à émettre un signal d'entrée à au moins deux algorithmes de FFT à point fixe qui appliquent une mise à l'échelle différente pour réduire la croissance de leur sortie, provoquant la génération dans chacun des algorithmes de FFT d'un ensemble de valeurs de sortie de FFT caractérisé par un gain différent. Le procédé consiste en outre à déterminer, en fonction d'une valeur de sortie par FFT, si une valeur de sortie d'un algorithme de FFT avec un gain relativement élevé a été limitée en raison d'une saturation. Dans la négative, la valeur de sortie de l'algorithme de FFT concerné est comprise dans la FFT finale. Dans le cas contraire, une valeur de sortie d'un algorithme de FFT avec un gain inférieur est comprise dans la FFT finale. La reconstruction de la FFT finale par ladite combinaison de valeurs à partir de différentes FFT permet de bénéficier des avantages de la FFT de gain supérieur et de la FFT de gain inférieur tout en évitant ou en minimisant leurs inconvénients.
front page image
Designated States: AE, AG, AL, AM, AO, AT, AU, AZ, BA, BB, BG, BH, BN, BR, BW, BY, BZ, CA, CH, CL, CN, CO, CR, CU, CZ, DE, DJ, DK, DM, DO, DZ, EC, EE, EG, ES, FI, GB, GD, GE, GH, GM, GT, HN, HR, HU, ID, IL, IN, IR, IS, JP, KE, KG, KH, KN, KP, KR, KW, KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, MG, MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, OM, PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, SC, SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW
African Regional Intellectual Property Organization (ARIPO) (BW, GH, GM, KE, LR, LS, MW, MZ, NA, RW, SD, SL, ST, SZ, TZ, UG, ZM, ZW)
Eurasian Patent Organization (AM, AZ, BY, KG, KZ, RU, TJ, TM)
European Patent Office (AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LT, LU, LV, MC, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, TR)
African Intellectual Property Organization (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW, KM, ML, MR, NE, SN, TD, TG)
Publication Language: English (EN)
Filing Language: English (EN)
Also published as:
DE112017000555CN108701119