{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910782389603321"]
[null,null,"Autore",null,"Sundararajan D"]
[null,null,"Titolo",null,"The discrete fourier transform [[electronic resource] ] : theory, algorithms and applications / / D. Sundararajan"]
[null,null,"Pubbl/distr/stampa",null,"Singapore ; ; River Edge, NJ, : World Scientific, c2001"]
[null,null,"ISBN",null,"1-281-95180-3"]
[{"$nulls":4},"9786611951801"]
[{"$nulls":4},"981-281-029-3"]
[null,null,"Descrizione fisica",null,"1 online resource (392 p.)"]
[null,null,"Disciplina",null,"530.15/5723"]
[null,null,"Soggetti",null,"Fourier transformations"]
[{"$nulls":4},"Mathematical physics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Preface; Contents; Abbreviations; Chapter 1 Introduction; 1.1 The Transform Method; 1.2 The Organization of this Book; Chapter 2 The Discrete Sinusoid; 2.1 Signal Representation; 2.2 The Discrete Sinusoid; 2.3 Summary and Discussion; Chapter 3 The Discrete Fourier Transform; 3.1 The Fourier Analysis and Synthesis of Waveforms; 3.2 The DFT and the IDFT; 3.3 DFT Representation of Some Signals; 3.4 Direct Computation of the DFT; 3.5 Advantages of Sinusoidal Representation of Signals; 3.6 Summary; Chapter 4 Properties of the DFT; 4.1 Linearity; 4.2 Periodicity"]
[{"$nulls":4},"4.3 Circular Shift of a Time Sequence 4.4 Circular Shift of a Spectrum; 4.5 Time-Reversal Property; 4.6 Symmetry Properties; 4.7 Transform of Complex Conjugates; 4.8 Circular Convolution and Correlation; 4.9 Sum and Difference of Sequences; 4.10 Padding the Data with Zeros; 4.11 Parseval's Theorem; 4.12 Summary; Chapter 5 Fundamentals of the PM DFT Algorithms; 5.1 Vector Format of the DFT; 5.2 Direct Computation of the DFT with Vectors; 5.3 Vector Format of the IDFT; 5.4 The Computation of the IDFT; 5.5 Fundamentals of the PM DIT DFT Algorithms; 5.6 Fundamentals of the PM DIF DFT Algorithms"]
[{"$nulls":4},"5.7 The Classification of the PM DFT Algorithms 5.8 Summary; Chapter 6 The u X 1 PM DFT Algorithms; 6.1 The u x 1 PM DIT DFT Algorithms; 6.2 The 2 x 1 PM DIT DFT Algorithm; 6.3 Reordering of the Input Data; 6.4 Computation of a Single DFT Coefficient; 6.5 The u x 1 PM DIF DFT Algorithms; 6.6 The 2 x 1 PM DIF DFT Algorithm; 6.7 Computational "]
[{"$nulls":4},"Complexity of the 2 x 1 PM DFT Algorithms; 6.8 The 6 x 1 PM DIT DFT Algorithm; 6.9 Flow Chart Description of the 2 x 1 PM DIT DFT Algorithm; 6.10 Summary; Chapter 7 The 2 x 2 PM DFT Algorithms; 7.1 The 2 x 2 PM DIT DFT Algorithm"]
[{"$nulls":4},"7.2 The 2 x 2 PM DIF DFT Algorithm 7.3 Computational Complexity of the 2 x 2 PM DFT Algorithms; 7.4 Summary; Chapter 8 DFT Algorithms for Real Data - I; 8.1 The Direct Use of an Algorithm for Complex Data; 8.2 Computation of the DFTs of Two Real Data Sets at a Time; 8.3 Computation of the DFT of a Single Real Data Set; 8.4 Summary; Chapter 9 DFT Algorithms for Real Data - II; 9.1 The Storage of Data in PM RDFT and RIDFT Algorithms; 9.2 The 2 x 1 PM DIT RDFT Algorithm; 9.3 The 2 x 1 PM DIF RIDFT Algorithm; 9.4 The 2 x 2 PM DIT RDFT Algorithm; 9.5 The 2 x 2 PM DIF RIDFT Algorithm"]
[{"$nulls":4},"9.6 Summary and Discussion Chapter 10 Two-Dimensional Discrete Fourier Transform; 10.1 The 2-D DFT and IDFT; 10.2 DFT Representation of Some 2-D Signals; 10.3 Computation of the 2-D DFT; 10.4 Properties of the 2-D DFT; 10.5 The 2-D PM DFT Algorithms; 10.6 Summary; Chapter 11 Aliasing and Other Effects; 11.1 Aliasing Effect; 11.2 Leakage Effect; 11.3 Picket-Fence Effect; 11.4 Summary and Discussion; Chapter 12 The Continuous-Time Fourier Series; 12.1 The 1-D Continuous-Time Fourier Series; 12.2 The 2-D Continuous-Time Fourier Series; 12.3 Summary"]
[{"$nulls":4},"Chapter 13 The Continuous-Time Fourier Transform"]
[null,null,null,"Sommario/riassunto","This authoritative book provides comprehensive coverage of practical Fourier analysis. It develops the concepts right from the basics and gradually guides the reader to the advanced topics. It presents the latest and practically efficient DFT algorithms, as well as the computation of discrete cosine and Walsh-Hadamard transforms. The large number of visual aids such as figures, flow graphs and flow charts makes the mathematical topic easy to understand. In addition, the numerous examples and the set of C-language programs (a supplement to the book) help greatly in understanding the theory and"]