195:
246:
55:(DFT) as "a set of samples of the finite Fourier transform". In actual implementation, that is not two separate steps; the DFT replaces the DTFT. So
118:
40:
378:
84:
52:
400:
115:
Harris' motivation for the distinction is to distinguish between an odd-length data sequence with the indices
405:
312:
204:
17:
317:
395:
330:
374:
97:
351:
322:
72:
389:
334:
298:"On the use of Windows for Harmonic Analysis with the Discrete Fourier Transform"
297:
281:
28:
190:{\displaystyle \left\{-{\tfrac {N-1}{2}}\leq n\leq {\tfrac {N-1}{2}}\right\},}
355:
326:
282:
High accuracy evaluation of the finite
Fourier transform using sampled data
342:
Cooley, J.; Lewis, P.; Welch, P. (1969). "The finite
Fourier transform".
267:
George
Bachman, Lawrence Narici, and Edward Beckenstein,
160:
131:
207:
121:
373:. Englewood Cliffs, N.J.: Prentice-Hall. pp 65–67.
371:
Theory and application of digital signal processing
240:
189:
43:(DTFT) of a finite-length series. E.g.,
59:(pp. 77–78) describes the implementation as
8:
369:Rabiner, Lawrence R.; Gold, Bernard (1975).
232:
208:
51:as a "continuous periodic function" and the
284:," NASA technical report TME110340 (1997).
316:
206:
159:
130:
120:
18:Finite Fourier transform (disambiguation)
260:
108:
7:
241:{\displaystyle \{0\leq n\leq N-1\},}
199:finite Fourier transform data window
83:another name for one snapshot of a
344:IEEE Trans. Audio Electroacoustics
25:
61:discrete finite Fourier transform
296:Harris, Fredric J. (Jan 1978).
41:discrete-time Fourier transform
1:
248:which is the DFT data window.
269:Fourier and Wavelet Analysis
85:short-time Fourier transform
56:
44:
422:
53:discrete Fourier transform
47:(pp. 52–53) describes the
356:10.1109/TAU.1969.1162036
271:(Springer, 2004), p. 264
49:finite Fourier transform
33:finite Fourier transform
327:10.1109/PROC.1978.10837
305:Proceedings of the IEEE
294:
242:
191:
243:
192:
71:another name for the
205:
201:, and a sequence on
119:
35:may refer to either
197:which he calls the
238:
187:
177:
148:
176:
147:
98:Fourier transform
39:another name for
16:(Redirected from
413:
401:Fourier analysis
359:
338:
320:
302:
285:
278:
272:
265:
249:
247:
245:
244:
239:
196:
194:
193:
188:
183:
179:
178:
172:
161:
149:
143:
132:
113:
21:
421:
420:
416:
415:
414:
412:
411:
410:
386:
385:
384:
366:
364:Further reading
341:
318:10.1.1.649.9880
300:
295:
289:
288:
279:
275:
266:
262:
257:
252:
203:
202:
162:
133:
126:
122:
117:
116:
114:
110:
106:
94:
23:
22:
15:
12:
11:
5:
419:
417:
409:
408:
406:Fourier series
403:
398:
388:
387:
383:
382:
365:
362:
361:
360:
339:
293:
290:
287:
286:
280:Morelli, E., "
273:
259:
258:
256:
253:
251:
250:
237:
234:
231:
228:
225:
222:
219:
216:
213:
210:
186:
182:
175:
171:
168:
165:
158:
155:
152:
146:
142:
139:
136:
129:
125:
107:
105:
102:
101:
100:
93:
90:
89:
88:
77:
76:
73:Fourier series
65:
64:
24:
14:
13:
10:
9:
6:
4:
3:
2:
418:
407:
404:
402:
399:
397:
394:
393:
391:
380:
376:
372:
368:
367:
363:
357:
353:
349:
345:
340:
336:
332:
328:
324:
319:
314:
310:
306:
299:
292:
291:
283:
277:
274:
270:
264:
261:
254:
235:
229:
226:
223:
220:
217:
214:
211:
200:
184:
180:
173:
169:
166:
163:
156:
153:
150:
144:
140:
137:
134:
127:
123:
112:
109:
103:
99:
96:
95:
91:
86:
82:
81:
80:
75:coefficients.
74:
70:
69:
68:
62:
58:
54:
50:
46:
42:
38:
37:
36:
34:
30:
19:
370:
350:(2): 77–85.
347:
343:
311:(1): 51–83.
308:
304:
276:
268:
263:
198:
111:
78:
66:
60:
48:
32:
26:
29:mathematics
396:Transforms
390:Categories
379:0139141014
255:References
45:F.J.Harris
313:CiteSeerX
227:−
221:≤
215:≤
167:−
157:≤
151:≤
138:−
128:−
92:See also
57:J.Cooley
377:
335:426548
333:
315:
331:S2CID
301:(PDF)
104:Notes
375:ISBN
31:the
352:doi
323:doi
79:or
67:or
27:In
392::
348:17
346:.
329:.
321:.
309:66
307:.
303:.
381:.
358:.
354::
337:.
325::
236:,
233:}
230:1
224:N
218:n
212:0
209:{
185:,
181:}
174:2
170:1
164:N
154:n
145:2
141:1
135:N
124:{
87:.
63:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.