Fast Fourier Transform algorithm design and tradeoffs
Kamin, Ray A., III; Adams, George B., III
1988-01-01
The Fast Fourier Transform (FFT) is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional Single Instruction Stream/Multiple Data (SIMD) parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Fast Fourier Transform programs are compared to the currently best Cray-2 FFT program.
A VLSI architecture for simplified arithmetic Fourier transform algorithm
Reed, Irving S.; Shih, Ming-Tang; Truong, T. K.; Hendon, E.; Tufts, D. W.
1992-01-01
The arithmetic Fourier transform (AFT) is a number-theoretic approach to Fourier analysis which has been shown to perform competitively with the classical FFT in terms of accuracy, complexity, and speed. Theorems developed in a previous paper for the AFT algorithm are used here to derive the original AFT algorithm which Bruns found in 1903. This is shown to yield an algorithm of less complexity and of improved performance over certain recent AFT algorithms. A VLSI architecture is suggested for this simplified AFT algorithm. This architecture uses a butterfly structure which reduces the number of additions by 25 percent of that used in the direct method.
A Matrix Formulation of Discrete Chirp Fourier Transform Algorithms
Institute of Scientific and Technical Information of China (English)
Juan Pablo Soto Quiros; Domingo Rodriguez
2014-01-01
This work presents a computational matrix framework in terms of tensor signal algebra for the formulation of discrete chirp Fourier transform algorithms. These algorithms are used in this work to estimate the point target functions (impulse response functions) of multiple-input multiple-output (MIMO) synthetic aperture radar (SAR) systems. This estimation technique is being studied as an alternative to the estimation of point target functions using the discrete cross-ambiguity function for certain types of environmental surveillance applications. The tensor signal algebra is presented as a mathematics environment composed of signal spaces, finite dimensional linear operators, and special matrices where algebraic methods are used to generate these signal transforms as computational estimators. Also, the tensor signal algebra contributes to analysis, design, and implementation of parallel algorithms. An instantiation of the framework was performed by using the MATLAB Parallel Computing Toolbox, where all the algorithms presented in this paper were implemented.
Radix-3 Algorithm for Realization of Discrete Fourier Transform
Directory of Open Access Journals (Sweden)
M.Narayan Murty
2016-07-01
Full Text Available In this paper, a new radix-3 algorithm for realization of discrete Fourier transform (DFT of length N = 3m (m = 1, 2, 3,... is presented. The DFT of length N can be realized from three DFT sequences, each of length N/3. If the input signal has length N, direct calculation of DFT requires O (N 2 complex multiplications (4N 2 real multiplications and some additions. This radix-3 algorithm reduces the number of multiplications required for realizing DFT. For example, the number of complex multiplications required for realizing 9-point DFT using the proposed radix-3 algorithm is 60. Thus, saving in time can be achieved in the realization of proposed algorithm.
The discrete Fourier transform theory, algorithms and applications
Sundaraajan, D
2001-01-01
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
Far-field radiation patterns of aperture antennas by the Winograd Fourier transform algorithm
Heisler, R.
1978-01-01
A more time-efficient algorithm for computing the discrete Fourier transform, the Winograd Fourier transform (WFT), is described. The WFT algorithm is compared with other transform algorithms. Results indicate that the WFT algorithm in antenna analysis appears to be a very successful application. Significant savings in cpu time will improve the computer turn around time and circumvent the need to resort to weekend runs.
Ogawa, Takahiro; Haseyama, Miki
2013-03-01
A missing texture reconstruction method based on an error reduction (ER) algorithm, including a novel estimation scheme of Fourier transform magnitudes is presented in this brief. In our method, Fourier transform magnitude is estimated for a target patch including missing areas, and the missing intensities are estimated by retrieving its phase based on the ER algorithm. Specifically, by monitoring errors converged in the ER algorithm, known patches whose Fourier transform magnitudes are similar to that of the target patch are selected from the target image. In the second approach, the Fourier transform magnitude of the target patch is estimated from those of the selected known patches and their corresponding errors. Consequently, by using the ER algorithm, we can estimate both the Fourier transform magnitudes and phases to reconstruct the missing areas.
Implementation of Period-Finding Algorithm by Means of Simulating Quantum Fourier Transform
Directory of Open Access Journals (Sweden)
Zohreh Moghareh Abed
2010-01-01
Full Text Available In this paper, we introduce quantum fourier transform as a key ingredient for many useful algorithms. These algorithms make a solution for problems which is considered to be intractable problems on a classical computer. Quantum Fourier transform is propounded as a key for quantum phase estimation algorithm. In this paper our aim is the implementation of period-finding algorithm.Quantum computer solves this problem, exponentially faster than classical one. Quantum phase estimation algorithm is the key for the period-finding problem .Therefore, by means of simulating quantum Fourier transform, we are able to implement the period-finding algorithm. In this paper, the simulation of quantum Fourier transform is carried out by Matlab software.
Fast Fourier transform for Voigt profile: Comparison with some other algorithms
Abousahl, S.; Gourma, M.; Bickel, M.
1997-02-01
There are different algorithms describing the Voigt profile. This profile is encountered in many areas of physics which could be limited by the resolution of the instrumentation used to measure it and by other phenomena like the interaction between the emitted waves and matter. In nuclear measurement field, the codes used to characterise radionucleides rely on algorithms resolving the Voigt profile equation. The Fast Fourier Transform (FFT) algorithm allows the validation of some algorithms.
Specification of the Fast Fourier Transform algorithm as a term rewriting system
Rodenburg, P.H.; Hoekzema, D.J.
2008-01-01
We specify an algorithm for multiplying polynomials with complex coefficients incorporating, the Fast Fourier Transform algorithm of Cooley and Tukey [CT]. The specification formalism we use is a variant of the formalism ASF described in. [BHK]. The difference with ASF is essentially a matter of sem
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
The mismatch between echo and replica caused by underwater moving target(UMT)'s radial velocity degrades the detection performance of the matched filter(MF) for the linear frequency modulation(LFM) signal. By using the focusing property of fractional Fourier transform(FRFT) to that signal, a detection algorithm for UMT's LFM echo based on the discrete fractional Fourier transform(DFRFT) is proposed. This algorithm is less affected by the target's radial velocity compared with the other MF detection algorithm utilizing zero radial velocity replica(ZRVR), and the mathematical relation between the output peak positions of these two algorithms exists in the case of existence of target echo. The algorithm can also estimate the target distance by using this relation. The simulation and experiment show that this algorithm's detection performance is better than or equivalent to that of the other MF algorithm utilizing ZRVR for the LFM echo of UMT with unknown radial velocity under reverberation noise background.
Faster fourier transformation: The algorithm of S. Winograd
Zohar, S.
1979-01-01
The new DFT algorithm of S. Winograd is developed and presented in detail. This is an algorithm which uses about 1/5 of the number of multiplications used by the Cooley-Tukey algorithm and is applicable to any order which is a product of relatively prime factors from the following list: 2,3,4,5,7,8,9,16. The algorithm is presented in terms of a series of tableaus which are convenient, compact, graphical representations of the sequence of arithmetic operations in the corresponding parts of the algorithm. Using these in conjunction with included Tables makes it relatively easy to apply the algorithm and evaluate its performance.
Zhang, Leihong; Liang, Dong; Li, Bei; Kang, Yi; Pan, Zilan; Zhang, Dawei; Gao, Xiumin; Ma, Xiuhua
2016-07-01
On the basis of analyzing the cosine light field with determined analytic expression and the pseudo-inverse method, the object is illuminated by a presetting light field with a determined discrete Fourier transform measurement matrix, and the object image is reconstructed by the pseudo-inverse method. The analytic expression of the algorithm of computational ghost imaging based on discrete Fourier transform measurement matrix is deduced theoretically, and compared with the algorithm of compressive computational ghost imaging based on random measurement matrix. The reconstruction process and the reconstruction error are analyzed. On this basis, the simulation is done to verify the theoretical analysis. When the sampling measurement number is similar to the number of object pixel, the rank of discrete Fourier transform matrix is the same as the one of the random measurement matrix, the PSNR of the reconstruction image of FGI algorithm and PGI algorithm are similar, the reconstruction error of the traditional CGI algorithm is lower than that of reconstruction image based on FGI algorithm and PGI algorithm. As the decreasing of the number of sampling measurement, the PSNR of reconstruction image based on FGI algorithm decreases slowly, and the PSNR of reconstruction image based on PGI algorithm and CGI algorithm decreases sharply. The reconstruction time of FGI algorithm is lower than that of other algorithms and is not affected by the number of sampling measurement. The FGI algorithm can effectively filter out the random white noise through a low-pass filter and realize the reconstruction denoising which has a higher denoising capability than that of the CGI algorithm. The FGI algorithm can improve the reconstruction accuracy and the reconstruction speed of computational ghost imaging.
Local structure information by EXAFS analysis using two algorithms for Fourier transform calculation
Energy Technology Data Exchange (ETDEWEB)
Aldea, N; Pintea, S; Rednic, V [National Institute for Research and Development of Isotopic and Molecular Technologies, 65-103 Donath, 400293 Cluj-Napoca (Romania); Matei, F [University of Agricultural Sciences and Veterinary Medicine, 3-5 Calea Manastur, 400372 Cluj-Napoca (Romania); Hu Tiandou; Xie Yaning, E-mail: nicolae.aldea@itim-cj.r [Beijing Synchrotron Radiation Facilities of Beijing Electron Positron Collider National Laboratory (China)
2009-08-01
The present work is a comparison study between different algorithms of Fourier transform for obtaining very accurate local structure results using Extended X-ray Absorption Fine Structure technique. In this paper we focus on the local structural characteristics of supported nickel catalysts and Fe{sub 3}O{sub 4} core-shell nanocomposites. The radial distribution function could be efficiently calculated by the fast Fourier transform when the coordination shells are well separated while the Filon quadrature gave remarkable results for close-shell coordination.
Amirfattahi, Rassoul
2013-10-01
Owing to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. Radix-2(p) algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2. By defining a new concept, twiddle factor template, in this paper, we propose a method for exact calculation of multiplicative complexity for radix-2(p) algorithms. The methodology is described for radix-2, radix-2 (2) and radix-2 (3) algorithms. Results show that radix-2 (2) and radix-2 (3) have significantly less computational complexity compared with radix-2. Another interesting result is that while the number of complex multiplications in radix-2 (3) algorithm is slightly more than radix-2 (2), the number of real multiplications for radix-2 (3) is less than radix-2 (2). This is because of the twiddle factors in the form of which need less number of real multiplications and are more frequent in radix-2 (3) algorithm.
Program for the analysis of time series. [by means of fast Fourier transform algorithm
Brown, T. J.; Brown, C. G.; Hardin, J. C.
1974-01-01
A digital computer program for the Fourier analysis of discrete time data is described. The program was designed to handle multiple channels of digitized data on general purpose computer systems. It is written, primarily, in a version of FORTRAN 2 currently in use on CDC 6000 series computers. Some small portions are written in CDC COMPASS, an assembler level code. However, functional descriptions of these portions are provided so that the program may be adapted for use on any facility possessing a FORTRAN compiler and random-access capability. Properly formatted digital data are windowed and analyzed by means of a fast Fourier transform algorithm to generate the following functions: (1) auto and/or cross power spectra, (2) autocorrelations and/or cross correlations, (3) Fourier coefficients, (4) coherence functions, (5) transfer functions, and (6) histograms.
Institute of Scientific and Technical Information of China (English)
Shuang-qing WU; Yin ZHANG; San-yuan ZHANG; Xiu-zi YE
2009-01-01
An integrated and reliable phase unwrapping algorithm is proposed based on residues and blocking-lines detection,closed contour extraction and quality map ordering for the measurement of 3D shapes by Fourier-transform profilometry (FTP).The proposed algorithm first detects the residues on the wrapped phase image, applies wavelet analysis to generate the blockinglines that can just connect the residues of opposite polarity, then carries out the morphology operation to extract the closed contour of the shape, and finally uses the modulation intensity information and the Laplacian of Gaussian operation of the wrapped phase image as the quality map. The unwrapping process is completed from a region of high reliability to that of low reliability and the blocking-lines can prevent the phase error propagation effectively. Furthermore, by using the extracted closed contour to exclude the invalid areas from the phase unwrapping process, the algorithm becomes more efficient. The experiment shows the effectiveness of the new algorithm.
Generic Quantum Fourier Transforms
Moore, Cristopher; Russell, A; Moore, Cristopher; Rockmore, Daniel; Russell, Alexander
2003-01-01
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the separation of variables technique that has been so successful in the study of classical Fourier transform computations. Specifically, this framework applies the existence of computable Bratteli diagrams, adapted factorizations, and Gel'fand-Tsetlin bases to offer efficient quantum circuits for the QFT over a wide variety a finite Abelian and non-Abelian groups, including all group families for which efficient QFTs are currently known and many new group families. Moreover, the method gives rise to the first subexponential-size quantum circuits for the QFT over the linear groups GL_k(q), SL_k(q), and the finite groups of Lie type, for any fixed prime power q.
Tan, Ru-Chao; Lei, Tong; Zhao, Qing-Min; Gong, Li-Hua; Zhou, Zhi-Hong
2016-12-01
To improve the slow processing speed of the classical image encryption algorithms and enhance the security of the private color images, a new quantum color image encryption algorithm based on a hyper-chaotic system is proposed, in which the sequences generated by the Chen's hyper-chaotic system are scrambled and diffused with three components of the original color image. Sequentially, the quantum Fourier transform is exploited to fulfill the encryption. Numerical simulations show that the presented quantum color image encryption algorithm possesses large key space to resist illegal attacks, sensitive dependence on initial keys, uniform distribution of gray values for the encrypted image and weak correlation between two adjacent pixels in the cipher-image.
Natural majorization of the Quantum Fourier Transformation in phase-estimation algorithms
Orus, R; Martín-Delgado, M A; Orus, Roman; Latorre, Jose I.; Martin-Delgado, Miguel A.
2002-01-01
We prove that majorization relations hold step by step in the Quantum Fourier Transformation (QFT) for phase-estimation algorithms considered in the canonical decomposition. Our result relies on the fact that states which are mixed by Hadamard operators at any stage of the computation only differ by a phase. This property is a consequence of the structure of the initial state and of the QFT, based on controlled-phase operators and a single action of a Hadamard gate per qubit. As a consequence, Hadamard gates order the probability distribution associated to the quantum state, whereas controlled-phase operators carry all the entanglement but are immaterial to majorization. We also prove that majorization in phase-estimation algorithms follows in a most natural way from unitary evolution, unlike its counterpart in Grover's algorithm.
Iterative Fourier transform algorithm: different approaches to diffractive optical element design
Skeren, Marek; Richter, Ivan; Fiala, Pavel
2002-10-01
This contribution focuses on the study and comparison of different design approaches for designing phase-only diffractive optical elements (PDOEs) for different possible applications in laser beam shaping. Especially, new results and approaches, concerning the iterative Fourier transform algorithm, are analyzed, implemented, and compared. Namely, various approaches within the iterative Fourier transform algorithm (IFTA) are analyzed for the case of phase-only diffractive optical elements with quantizied phase levels (either binary or multilevel structures). First, the general scheme of the IFTA iterative approach with partial quantization is briefly presented and discussed. Then, the special assortment of the general IFTA scheme is given with respect to quantization constraint strategies. Based on such a special classification, the three practically interesting approaches are chosen, further-analyzed, and compared to eachother. The performance of these algorithms is compared in detail in terms of the signal-to-noise ratio characteristic developments with respect to the numberof iterations, for various input diffusive-type objects chose. Also, the performance is documented on the complex spectra developments for typical computer reconstruction results. The advantages and drawbacks of all approaches are discussed, and a brief guide on the choice of a particular approach for typical design tasks is given. Finally, the two ways of amplitude elimination within the design procedure are considered, namely the direct elimination and partial elimination of the amplitude of the complex hologram function.
A hybrid algorithm for the rapid Fourier transform of extensive series of data
Directory of Open Access Journals (Sweden)
A. S Franco
1971-12-01
Full Text Available A technique is described for the rapid Fourier transform of large series of numbers. The technique takes advantage of the fact that most digital series are highly factorizable by the number 2, which permits the use of the F.F.T. algorithm. Using two magnetic tape units, or alternatively magnetic disk facilities, very large series can be transformed efficiently with only modest computer facilities. For the transformation of odd-valued series the Thomas Prime-Factor and Gentleman and Sande algorithms are treated in detail.Apresenta-se neste trabalho uma técnica de transformação rápida de Fourier aplicada a uma longa série de valores numéricos. A técnica tira partido do fato de que a grande maioria das séries digitalizadas é, em geral, suscetível de fatoração onde aparece frequentemente o fator 2, o que permite o emprego do algorítmo da transformação rápida de Fourier (F.F.T.. Com o emprego de duas fitas magnéticas ou discos, pode ser efetuada eficientemente a transformação de longas séries em computadores de modesta memória. O algorítmo de fatores primos de Thomas e o de Gentleman e Sande são, respectivamente, tratados em detalhe, na transformação de séries com numero ímpar de valores.
Institute of Scientific and Technical Information of China (English)
Ding Lu; Weimin Jin
2011-01-01
A novel fully phase color image encryption/decryption scheme based on joint fractional Fourier transform correlator (JFRTC) and phase retrieval algorithm (PRA) is proposed. The security of the system is enhanced by the fractional order as a new added key. This method takes full advantage of the parallel processing features of the optical system and could optically realize single-channel color image encryption.The system and operation procedures are simplified. The simulation results of a color image indicate that the new method provides efficient solutions with a strong sense of security.%@@ A novel fully phase color image encryption/decryption scheme based on joint fractional Fourier transform correlator (JFRTC) and phase retrieval algorithm (PRA) is proposed. The security of the system is enhanced by the fractional order as a new added key. This method takes full advantage of the parallel processing features of the optical system and could optically realize single-channel color image encryption. The system and operation procedures are simplified. The simulation results of a color image indicate that the new method provides efficient solutions with a strong sense of security.
Generalized Fourier transforms classes
DEFF Research Database (Denmark)
Berntsen, Svend; Møller, Steen
2002-01-01
The Fourier class of integral transforms with kernels $B(\\omega r)$ has by definition inverse transforms with kernel $B(-\\omega r)$. The space of such transforms is explicitly constructed. A slightly more general class of generalized Fourier transforms are introduced. From the general theory...
Algorithm, applications and evaluation for protein comparison by Ramanujan Fourier transform.
Zhao, Jian; Wang, Jiasong; Hua, Wei; Ouyang, Pingkai
2015-12-01
The amino acid sequence of a protein determines its chemical properties, chain conformation and biological functions. Protein sequence comparison is of great importance to identify similarities of protein structures and infer their functions. Many properties of a protein correspond to the low-frequency signals within the sequence. Low frequency modes in protein sequences are linked to the secondary structures, membrane protein types, and sub-cellular localizations of the proteins. In this paper, we present Ramanujan Fourier transform (RFT) with a fast algorithm to analyze the low-frequency signals of protein sequences. The RFT method is applied to similarity analysis of protein sequences with the Resonant Recognition Model (RRM). The results show that the proposed fast RFT method on protein comparison is more efficient than commonly used discrete Fourier transform (DFT). RFT can detect common frequencies as significant feature for specific protein families, and the RFT spectrum heat-map of protein sequences demonstrates the information conservation in the sequence comparison. The proposed method offers a new tool for pattern recognition, feature extraction and structural analysis on protein sequences.
A Novel Short-Time Fourier Transform-Based Fall Detection Algorithm Using 3-Axis Accelerations
Directory of Open Access Journals (Sweden)
Isu Shin
2015-01-01
Full Text Available The short-time Fourier transform- (STFT- based algorithm was suggested to distinguish falls from various activities of daily living (ADLs. Forty male subjects volunteered in the experiments including three types of falls and four types of ADLs. An inertia sensor unit attached to the middle of two anterior superior iliac spines was used to measure the 3-axis accelerations at 100 Hz. The measured accelerations were transformed to signal vector magnitude values to be analyzed using STFT. The powers of low frequency components were extracted, and the fall detection was defined as whether the normalized power was less than the threshold (50% of the normal power. Most power was observed at the frequency band lower than 5 Hz in all activities, but the dramatic changes in the power were found only in falls. The specificity of 1–3 Hz frequency components was the best (100%, but the sensitivity was much smaller compared with 4 Hz component. The 4 Hz component showed the best fall detection with 96.9% sensitivity and 97.1% specificity. We believe that the suggested algorithm based on STFT would be useful in the fall detection and the classification from ADLs as well.
Fourier transformation for pedestrians
Butz, Tilman
2006-01-01
Meant to serve an "entertaining textbook," this book belongs to a rare genre. It is written for all students and practitioners who deal with Fourier transformation. Fourier series as well as continuous and discrete Fourier transformation are covered, and particular emphasis is placed on window functions. Many illustrations and easy-to-solve exercises make the book especially accessible, and its humorous style will add to the pleasure of learning from it.
Fourier and Laplace Transforms
Beerends, R.J.; Morsche, ter H.G.; Berg, van den J.C.
2003-01-01
This textbook presents in a unified manner the fundamentals of both continuous and discrete versions of the Fourier and Laplace transforms. These transforms play an important role in the analysis of all kinds of physical phenomena. As a link between the various applications of these transforms the a
Institute of Scientific and Technical Information of China (English)
Liu Zhi-Ming; Liu Wen-qing; Gao Ming-Guang; Tong Jing-Jing; Zhang Wian-Shu; Xu Liang; Wei Xiuai
2008-01-01
Passive Fourier transform infrared (FTIR) remote sensing measurement of chemical gas cloud is a vital technology.It takes an important part in many fields for the detection of released gases.The principle of concentration measurement is based on the Beer-Lambert law.Unlike the active measurement,for the passive remote sensing,in most cases,the difference between the temperature of the gas cloud and the brightness temperature of the background is usually a few kelvins.The gas cloud emission is almost equal to the background emission,thereby the emission of the gas cloud cannot be ignored.The concentration retrieval algorithm is quite different from the active measurement.In this paper,the concentration retrieval algorithm for the passive FTIR remote measurement of gas cloud is presented in detail,which involves radiative transfer model,radiometric calibration,absorption coefficient calculation,et al.The background spectrum has a broad feature,which is a slowly varying function of frequency.In this paper,the background spectrum is fitted with a polynomial by using the Levenberg-Marquardt method which is a kind of nonlinear least squares fitting algorithm.No background spectra are required.Thus,this method allows mobile,real-time and fast measurements of gas clouds.
Fourier transform mass spectrometry.
Scigelova, Michaela; Hornshaw, Martin; Giannakopulos, Anastassios; Makarov, Alexander
2011-07-01
This article provides an introduction to Fourier transform-based mass spectrometry. The key performance characteristics of Fourier transform-based mass spectrometry, mass accuracy and resolution, are presented in the view of how they impact the interpretation of measurements in proteomic applications. The theory and principles of operation of two types of mass analyzer, Fourier transform ion cyclotron resonance and Orbitrap, are described. Major benefits as well as limitations of Fourier transform-based mass spectrometry technology are discussed in the context of practical sample analysis, and illustrated with examples included as figures in this text and in the accompanying slide set. Comparisons highlighting the performance differences between the two mass analyzers are made where deemed useful in assisting the user with choosing the most appropriate technology for an application. Recent developments of these high-performing mass spectrometers are mentioned to provide a future outlook.
A Fast Algorithm of Generalized Radon-Fourier Transform for Weak Maneuvering Target Detection
Directory of Open Access Journals (Sweden)
Weijie Xia
2016-01-01
Full Text Available The generalized Radon-Fourier transform (GRFT has been proposed to detect radar weak maneuvering targets by realizing coherent integration via jointly searching in motion parameter space. Two main drawbacks of GRFT are the heavy computational burden and the blind speed side lobes (BSSL which will cause serious false alarms. The BSSL learning-based particle swarm optimization (BPSO has been proposed before to reduce the computational burden of GRFT and solve the BSSL problem simultaneously. However, the BPSO suffers from an apparent loss in detection performance compared with GRFT. In this paper, a fast implementation algorithm of GRFT using the BSSL learning-based modified wind-driven optimization (BMWDO is proposed. In the BMWDO, the BSSL learning procedure is also used to deal with the BSSL phenomenon. Besides, the MWDO adjusts the coefficients in WDO with Levy distribution and uniform distribution, and it outperforms PSO in a noisy environment. Compared with BPSO, the proposed method can achieve better detection performance with a similar computational cost. Several numerical experiments are also provided to demonstrate the effectiveness of the proposed method.
Feng, Yanqiu; Song, Yanli; Wang, Cong; Xin, Xuegang; Feng, Qianjin; Chen, Wufan
2013-10-01
To develop and test a new algorithm for fast direct Fourier transform (DrFT) reconstruction of MR data on non-Cartesian trajectories composed of lines with equally spaced points. The DrFT, which is normally used as a reference in evaluating the accuracy of other reconstruction methods, can reconstruct images directly from non-Cartesian MR data without interpolation. However, DrFT reconstruction involves substantially intensive computation, which makes the DrFT impractical for clinical routine applications. In this article, the Chirp transform algorithm was introduced to accelerate the DrFT reconstruction of radial and Periodically Rotated Overlapping ParallEL Lines with Enhanced Reconstruction (PROPELLER) MRI data located on the trajectories that are composed of lines with equally spaced points. The performance of the proposed Chirp transform algorithm-DrFT algorithm was evaluated by using simulation and in vivo MRI data. After implementing the algorithm on a graphics processing unit, the proposed Chirp transform algorithm-DrFT algorithm achieved an acceleration of approximately one order of magnitude, and the speed-up factor was further increased to approximately three orders of magnitude compared with the traditional single-thread DrFT reconstruction. Implementation the Chirp transform algorithm-DrFT algorithm on the graphics processing unit can efficiently calculate the DrFT reconstruction of the radial and PROPELLER MRI data. Copyright © 2012 Wiley Periodicals, Inc.
Fourier transformation for pedestrians
Butz, Tilman
2015-01-01
This book is an introduction to Fourier Transformation with a focus on signal analysis, based on the first edition. It is well suited for undergraduate students in physics, mathematics, electronic engineering as well as for scientists in research and development. It gives illustrations and recommendations when using existing Fourier programs and thus helps to avoid frustrations. Moreover, it is entertaining and you will learn a lot unconsciously. Fourier series as well as continuous and discrete Fourier transformation are discussed with particular emphasis on window functions. Filter effects of digital data processing are illustrated. Two new chapters are devoted to modern applications. The first deals with data streams and fractional delays and the second with the back-projection of filtered projections in tomography. There are many figures and mostly easy to solve exercises with solutions.
Directory of Open Access Journals (Sweden)
bahram noshad
2012-11-01
Full Text Available One of mal-operations of the transformer differential protection during the unload transformer energizing with additional line/load from the supplying side is ultra-saturation phenomenon. In this paper, first a new model according to Discrete Fourier Transform (DFT algorithm for investigating the ultra-saturation phenomenon during the unload transformer energizing with additional line/load from the supplying side is presented and its effect on the differential protection of the transformer is considered. In this model, the nonlinear characteristic of the transformer core and the effect of current transformer are taken into account. It is assumed that the additional line/load from the supplying side of the power transformer is a resistive-inductive load. Also, the effect of the residual flux, inception angle and additional line/load from the supplying side on the ultra-saturation phenomenon is investigated. Then, the mal-operation of differential protection by using DFT algorithm is described.
Intel Cilk Plus for Complex Parallel Algorithms: "Enormous Fast Fourier Transform" (EFFT) Library
Asai, Ryo; Vladimirov, Andrey
2014-01-01
In this paper we demonstrate the methodology for parallelizing the computation of large one-dimensional discrete fast Fourier transforms (DFFTs) on multi-core Intel Xeon processors. DFFTs based on the recursive Cooley-Tukey method have to control cache utilization, memory bandwidth and vector hardware usage, and at the same time scale across multiple threads or compute nodes. Our method builds on single-threaded Intel Math Kernel Library (MKL) implementation of DFFT, and uses the Intel Cilk P...
Yang, Xue; Li, Xue-You; Li, Jia-Guo; Ma, Jun; Zhang, Li; Yang, Jan; Du, Quan-Ye
2014-02-01
Fast Fourier transforms (FFT) is a basic approach to remote sensing image processing. With the improvement of capacity of remote sensing image capture with the features of hyperspectrum, high spatial resolution and high temporal resolution, how to use FFT technology to efficiently process huge remote sensing image becomes the critical step and research hot spot of current image processing technology. FFT algorithm, one of the basic algorithms of image processing, can be used for stripe noise removal, image compression, image registration, etc. in processing remote sensing image. CUFFT function library is the FFT algorithm library based on CPU and FFTW. FFTW is a FFT algorithm developed based on CPU in PC platform, and is currently the fastest CPU based FFT algorithm function library. However there is a common problem that once the available memory or memory is less than the capacity of image, there will be out of memory or memory overflow when using the above two methods to realize image FFT arithmetic. To address this problem, a CPU and partitioning technology based Huge Remote Fast Fourier Transform (HRFFT) algorithm is proposed in this paper. By improving the FFT algorithm in CUFFT function library, the problem of out of memory and memory overflow is solved. Moreover, this method is proved rational by experiment combined with the CCD image of HJ-1A satellite. When applied to practical image processing, it improves effect of the image processing, speeds up the processing, which saves the time of computation and achieves sound result.
Walde, Marie; Jost, Aurélie; Wicker, Kai; Heintzmann, Rainer
2017-01-01
Bessel illumination is an established method in optical imaging and manipulation to achieve an extended depth of field without compromising the lateral resolution. When broadband or multicolour imaging is required, wavelength-dependent changes in the radial profile of the Bessel illumination can complicate further image processing and analysis. We present a solution for engineering a multicolour Bessel beam that is easy to implement and promises to be particularly useful for broadband imaging applications. A phase-only spatial light modulator (SLM) in the image plane and an iterative Fourier Transformation algorithm (IFTA) are used to create an annular light distribution in the back focal plane of a lens. The 2D Fourier transformation of such a light ring yields a Bessel beam with a constant radial profile for different wavelength.
Fourier transforms principles and applications
Hansen, Eric W
2014-01-01
Fourier Transforms: Principles and Applications explains transform methods and their applications to electrical systems from circuits, antennas, and signal processors-ably guiding readers from vector space concepts through the Discrete Fourier Transform (DFT), Fourier series, and Fourier transform to other related transform methods. Featuring chapter end summaries of key results, over two hundred examples and four hundred homework problems, and a Solutions Manual this book is perfect for graduate students in signal processing and communications as well as practicing engineers.
Fourier Lucas-Kanade algorithm.
Lucey, Simon; Navarathna, Rajitha; Ashraf, Ahmed Bilal; Sridharan, Sridha
2013-06-01
In this paper, we propose a framework for both gradient descent image and object alignment in the Fourier domain. Our method centers upon the classical Lucas & Kanade (LK) algorithm where we represent the source and template/model in the complex 2D Fourier domain rather than in the spatial 2D domain. We refer to our approach as the Fourier LK (FLK) algorithm. The FLK formulation is advantageous when one preprocesses the source image and template/model with a bank of filters (e.g., oriented edges, Gabor, etc.) as 1) it can handle substantial illumination variations, 2) the inefficient preprocessing filter bank step can be subsumed within the FLK algorithm as a sparse diagonal weighting matrix, 3) unlike traditional LK, the computational cost is invariant to the number of filters and as a result is far more efficient, and 4) this approach can be extended to the Inverse Compositional (IC) form of the LK algorithm where nearly all steps (including Fourier transform and filter bank preprocessing) can be precomputed, leading to an extremely efficient and robust approach to gradient descent image matching. Further, these computational savings translate to nonrigid object alignment tasks that are considered extensions of the LK algorithm, such as those found in Active Appearance Models (AAMs).
Real Clifford Windowed Fourier Transform
Institute of Scientific and Technical Information of China (English)
Mawardi BAHRI; Sriwulan ADJI; Ji Man ZHAO
2011-01-01
We study the windowed Fourier transform in the framework of Clifford analysis, which we call the Clifford windowed Fourier transform (CWFT). Based on the spectral representation of the Clifford Fourier transform (CFT), we derive several important properties such as shift, modulation,reconstruction formula, orthogonality relation, isometry, and reproducing kernel. We also present an example to show the differences between the classical windowed Fourier transform (WFT) and the CWFT. Finally, as an application we establish a Heisenberg type uncertainty principle for the CWFT.
Institute of Scientific and Technical Information of China (English)
Pang Chao-Yang; Hu Ben-Qiong
2008-01-01
The discrete Fourier transform(DFT)is the base of modern signal processing.1-dimensional fast Fourier transform (1D FFT)and 2D FFT have time complexity O(N log N)and O(N2 log N)respectively.Since 1965,there has been no more essential breakthrough for the design of fast DFT algorithm.DFT has two properties.One property is that DFT is energy conservation transform.The other property is that many DFT coefficients are close to zero.The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy.One-dimensional quantum DFT(1D QDFT)and two-dimensional quantum DFT(2D QDFT)are presented in this paper.The quantum algorithm for convolution estimation is also presented in this paper.Compared with FFT,1D and 2D QDFT have time complexity O(√N)and O(N)respectively.QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible.
Shift sampling theory of Fourier transform computation
Institute of Scientific and Technical Information of China (English)
柴玉璞
1997-01-01
The DFT transform us extended to DFTξη transform and the relationship between FT and DFTξη is given by the Fourier transform discretization theorem. Based on the theorem, the DFTξη algorithm-error equation (DFTξη A-E equation) is established, and the minimization property of discrete effect and the oscillation property of truncation effect are demonstrated. All these construct the shift sampling theory——a new theory about Fourier transform computation.
Alexandrov, Mikhail D.; Cairns, Brian; Mishchenko, Michael I.
2012-01-01
We present a novel technique for remote sensing of cloud droplet size distributions. Polarized reflectances in the scattering angle range between 135deg and 165deg exhibit a sharply defined rainbow structure, the shape of which is determined mostly by single scattering properties of cloud particles, and therefore, can be modeled using the Mie theory. Fitting the observed rainbow with such a model (computed for a parameterized family of particle size distributions) has been used for cloud droplet size retrievals. We discovered that the relationship between the rainbow structures and the corresponding particle size distributions is deeper than it had been commonly understood. In fact, the Mie theory-derived polarized reflectance as a function of reduced scattering angle (in the rainbow angular range) and the (monodisperse) particle radius appears to be a proxy to a kernel of an integral transform (similar to the sine Fourier transform on the positive semi-axis). This approach, called the rainbow Fourier transform (RFT), allows us to accurately retrieve the shape of the droplet size distribution by the application of the corresponding inverse transform to the observed polarized rainbow. While the basis functions of the proxy-transform are not exactly orthogonal in the finite angular range, this procedure needs to be complemented by a simple regression technique, which removes the retrieval artifacts. This non-parametric approach does not require any a priori knowledge of the droplet size distribution functional shape and is computationally fast (no look-up tables, no fitting, computations are the same as for the forward modeling).
Fourier transforms in spectroscopy
Kauppinen, Jyrki
2000-01-01
This modern approach to the subject is clearly and logically structured, and gives readers an understanding of the essence of Fourier transforms and their applications. All important aspects are included with respect to their use with optical spectroscopic data. Based on popular lectures, the authors provide the mathematical fundamentals and numerical applications which are essential in practical use. The main part of the book is dedicated to applications of FT in signal processing and spectroscopy, with IR and NIR, NMR and mass spectrometry dealt with both from a theoretical and practical poi
Fast Fourier transform telescope
Tegmark, Max; Zaldarriaga, Matias
2009-04-01
We propose an all-digital telescope for 21 cm tomography, which combines key advantages of both single dishes and interferometers. The electric field is digitized by antennas on a rectangular grid, after which a series of fast Fourier transforms recovers simultaneous multifrequency images of up to half the sky. Thanks to Moore’s law, the bandwidth up to which this is feasible has now reached about 1 GHz, and will likely continue doubling every couple of years. The main advantages over a single dish telescope are cost and orders of magnitude larger field-of-view, translating into dramatically better sensitivity for large-area surveys. The key advantages over traditional interferometers are cost (the correlator computational cost for an N-element array scales as Nlog2N rather than N2) and a compact synthesized beam. We argue that 21 cm tomography could be an ideal first application of a very large fast Fourier transform telescope, which would provide both massive sensitivity improvements per dollar and mitigate the off-beam point source foreground problem with its clean beam. Another potentially interesting application is cosmic microwave background polarization.
Fourier Transform Spectrometer System
Campbell, Joel F. (Inventor)
2014-01-01
A Fourier transform spectrometer (FTS) data acquisition system includes an FTS spectrometer that receives a spectral signal and a laser signal. The system further includes a wideband detector, which is in communication with the FTS spectrometer and receives the spectral signal and laser signal from the FTS spectrometer. The wideband detector produces a composite signal comprising the laser signal and the spectral signal. The system further comprises a converter in communication with the wideband detector to receive and digitize the composite signal. The system further includes a signal processing unit that receives the composite signal from the converter. The signal processing unit further filters the laser signal and the spectral signal from the composite signal and demodulates the laser signal, to produce velocity corrected spectral data.
Quantum Fourier transform in computational basis
Zhou, S. S.; Loke, T.; Izaac, J. A.; Wang, J. B.
2017-03-01
The quantum Fourier transform, with exponential speed-up compared to the classical fast Fourier transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, Shor's factoring algorithm). However, situations arise where it is not sufficient to encode the Fourier coefficients within the quantum amplitudes, for example in the implementation of control operations that depend on Fourier coefficients. In this paper, we detail a new quantum scheme to encode Fourier coefficients in the computational basis, with fidelity 1 - δ and digit accuracy ɛ for each Fourier coefficient. Its time complexity depends polynomially on log (N), where N is the problem size, and linearly on 1/δ and 1/ɛ . We also discuss an application of potential practical importance, namely the simulation of circulant Hamiltonians.
Scarfone, A. M.
2017-08-01
We present a new formulation of Fourier transform in the picture of the κ-algebra derived in the framework of the κ-generalized statistical mechanics. The κ-Fourier transform is obtained from a κ-Fourier series recently introduced by Scarfone (2013). The kernel of this transform, that reduces to the usual exponential phase in the κ → 0 limit, is composed by a κ-deformed phase and a damping factor that gives a wavelet-like behaviour. We show that the κ-Fourier transform is isomorph to the standard Fourier transform through a changing of time and frequency variables. Nevertheless, the new formalism is useful to study, according to Fourier analysis, those functions defined in the realm of the κ-algebra. As a relevant application, we discuss the central limit theorem for the κ-sum of n-iterate statistically independent random variables.
Energy Technology Data Exchange (ETDEWEB)
Tan, Cheng-Yang; /Fermilab
2011-02-01
A bootstrap algorithm for reconstructing the temporal signal from four of its fractional Fourier intensity spectra in the presence of noise is described. An optical arrangement is proposed which realises the bootstrap method for the measurement of ultrashort laser pulses. The measurement of short laser pulses which are less than 1 ps is an ongoing challenge in optical physics. One reason is that no oscilloscope exists today which can directly measure the time structure of these pulses and so it becomes necessary to invent other techniques which indirectly provide the necessary information for temporal pulse reconstruction. One method called FROG (frequency resolved optical gating) has been in use since 19911 and is one of the popular methods for recovering these types of short pulses. The idea behind FROG is the use of multiple time-correlated pulse measurements in the frequency domain for the reconstruction. Multiple data sets are required because only intensity information is recorded and not phase, and thus by collecting multiple data sets, there is enough redundant measurements to yield the original time structure, but not necessarily uniquely (or even up to an arbitrary constant phase offset). The objective of this paper is to describe another method which is simpler than FROG. Instead of collecting many auto-correlated data sets, only two spectral intensity measurements of the temporal signal are needed in the absence of noise. The first can be from the intensity components of its usual Fourier transform and the second from its FrFT (fractional Fourier transform). In the presence of noise, a minimum of four measurements are required with the same FrFT order but with two different apertures. Armed with these two or four measurements, a unique solution up to a constant phase offset can be constructed.
Composite Cyclotomic Fourier Transforms with Reduced Complexities
Wu, Xuebin; Chen, Ning; Yan, Zhiyuan; Wang, Ying
2010-01-01
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic fast Fourier transforms (CFFTs) are promising due to their low multiplicative complexities. Unfortunately, there are two issues with CFFTs: (1) they rely on efficient short cyclic convolution algorithms, which has not been investigated thoroughly yet, and (2) they have very high additive complexities when directly implemented. In this paper, we address both issues. One of the main contributions of this paper is efficient bilinear 11-point cyclic convolution algorithms, which allow us to construct CFFTs over GF$(2^{11})$. The other main contribution of this paper is that we propose composite cyclotomic Fourier transforms (CCFTs). In comparison to previously proposed fast Fourier transforms, our CCFTs achieve lower overall complexities for moderate to long lengths, and the imp...
Wavelet-fractional Fourier transforms
Institute of Scientific and Technical Information of China (English)
Yuan Lin
2008-01-01
This paper extends the definition of fractional Fourier transform (FRFT) proposed by Namias V by using other orthonormal bases for L2 (R) instead of Hermite-Ganssian functions.The new orthonormal basis is gained indirectly from multiresolution analysis and orthonormal wavelets. The so defined FRFT is called wavelets-fractional Fourier transform.
Wang, Kun; Li, Jinyang; Lu, Dan-Feng; Qi, Zhi-Mei
2016-07-08
In a recent report we demonstrated a miniature static Fourier transform spectrometer (FTS) that was implemented with a LiNbO3 (LN) waveguide electro-optic modulator (EOM) combined with the dispersion relation between its half-wave voltage and wavelength. The FTS was verified to be able to measure laser wavelength and for low-resolution spectroscopy. In this report, we successfully applied the resolution enhancement algorithm to the FTS, resulting in at least a three-fold increase in its spectral resolution without causing obvious distortion of the measured spectra. The algorithm method used is based on an autoregressive (AR) model, singular value decomposition (SVD), and forward-backward linear prediction (FBLP). The combination of these methods allows the FTS to remain a small size but to possess good spectral resolution, effectively mitigating the conflict between the small size and high resolution of the device. This study opens the way to development of high-resolution miniature FTS. © The Author(s) 2016.
1984-04-01
CIR (3.2) *. where B(v) is a finite or infinite product of Blaschke factors, i.e. V-v* B(v) = TI B (v) where B lV ) = ( 3.3) i=l k Zk v~vk Furthermore...language, it is: f-t Given the sets {Ti1 with associated projections Pi =P1 i=l 1 T.iM4 1 find G such that GE n T.i=l I_ Gubin, Polyak and Raik 137] have...36. J.R. Fienup, "Phase retrieval algorithms: a comparison." Appl. Opt., 21, 2758-2769 (1982). 37. L. Gubin, B. Polyak , and E. Raik, "The method of
Fast Numerical Nonlinear Fourier Transforms
Wahls, Sander
2014-01-01
The nonlinear Fourier transform, which is also known as the forward scattering transform, decomposes a periodic signal into nonlinearly interacting waves. In contrast to the common Fourier transform, these waves no longer have to be sinusoidal. Physically relevant waveforms are often available for the analysis instead. The details of the transform depend on the waveforms underlying the analysis, which in turn are specified through the implicit assumption that the signal is governed by a certain evolution equation. For example, water waves generated by the Korteweg-de Vries equation can be expressed in terms of cnoidal waves. Light waves in optical fiber governed by the nonlinear Schr\\"dinger equation (NSE) are another example. Nonlinear analogs of classic problems such as spectral analysis and filtering arise in many applications, with information transmission in optical fiber, as proposed by Yousefi and Kschischang, being a very recent one. The nonlinear Fourier transform is eminently suited to address them ...
Lou, X M; Hassebrook, L G; Lhamon, M E; Li, J
1997-01-01
We introduce a new method for determining the number of straight lines, line angles, offsets, widths, and discontinuities in complicated images. In this method, line angles are obtained by searching the peaks of a hybrid discrete Fourier and bilinear transformed line angle spectrum. Numerical advantages and performance are demonstrated.
Static Fourier transform infrared spectrometer.
Schardt, Michael; Murr, Patrik J; Rauscher, Markus S; Tremmel, Anton J; Wiesent, Benjamin R; Koch, Alexander W
2016-04-01
Fourier transform spectroscopy has established itself as the standard method for spectral analysis of infrared light. Here we present a robust and compact novel static Fourier transform spectrometer design without any moving parts. The design is well suited for measurements in the infrared as it works with extended light sources independent of their size. The design is experimentally evaluated in the mid-infrared wavelength region between 7.2 μm and 16 μm. Due to its large etendue, its low internal light loss, and its static design it enables high speed spectral analysis in the mid-infrared.
Lu, Xiangwen; Gao, Wenpei; Zuo, Jian-Min; Yuan, Jiabin
2015-02-01
Advances in diffraction and transmission electron microscopy (TEM) have greatly improved the prospect of three-dimensional (3D) structure reconstruction from two-dimensional (2D) images or diffraction patterns recorded in a tilt series at atomic resolution. Here, we report a new graphics processing unit (GPU) accelerated iterative transformation algorithm (ITA) based on polar fast Fourier transform for reconstructing 3D structure from 2D diffraction patterns. The algorithm also applies to image tilt series by calculating diffraction patterns from the recorded images using the projection-slice theorem. A gold icosahedral nanoparticle of 309 atoms is used as the model to test the feasibility, performance and robustness of the developed algorithm using simulations. Atomic resolution in 3D is achieved for the 309 atoms Au nanoparticle using 75 diffraction patterns covering 150° rotation. The capability demonstrated here provides an opportunity to uncover the 3D structure of small objects of nanometers in size by electron diffraction.
快速傅立叶变换中的一种倒位序生成法%AN ALGORITHM TO GENERATE REVERSE SEQUENCE IN FAST FOURIER TRANSFORM
Institute of Scientific and Technical Information of China (English)
王芳; 张学锋; 程增会
2011-01-01
快速傅立叶变换是离散傅立叶变换(DFT)的一种快速算法,它的出现使DFT的计算大大简化,运算时间可缩短一、二个数量级,从而使得离散傅立叶变换在信号分析与处理领域中得到了广泛的应用.在应用软件和硬件程序设计中要实现快速傅立叶变换算法,均涉及到序列的倒位序排列问题.针对该问题提出倒位序生成法,直接计算各自然顺序位置的倒位序数值,然后通过交址运算完成原数列的倒位序的排列.该方法对任何满足N=2M点的快速傅立叶变换,能很快实现其变换中序列的倒位序排列.该方法只涉及倒位序十进制数和顺序十进制数,不用对二进制数进行转换,简单易行,仿真实验结果证明算法可靠有效.%Fast Fourier transform is a fast algorithm of discrete Fourier transform, its appearance greatly simplifies the calculation of DFT,and the computation time can be shortened by one or two orders of magnitude thereby. For the reason of that, the discrete Fourier transform has been widely used in signal analysis and processing fields. The issue of reverse sequence is involved in programming designs of beth application software and hardware for achieving fast Fourier transform algorithm. In light of this, in the paper a generation algorithm for reverse sequence is proposed. It directly calculates the values of reverse ordinals in each natural sequential position, and then through the operation of addresses variation the ordering of reverse sequence of the primary sequence is achieved. For any FFT meets the point of N = 2M, this algorithm can quickly realise the reverse sequence ordering of the transform. The method only involves the reverse sequence decimal numeral and ordinal decimal numeral, but does not need to transform the binary numeral, it is simple and easy to implement. Simulation results show that the algorithm is reliable and effective.
Ham, Woonchul; Song, Chulgyu
2017-05-01
In this paper, we propose a new three-dimensional stereo image reconstruction algorithm for a photoacoustic medical imaging system. We also introduce and discuss a new theoretical algorithm by using the physical concept of Radon transform. The main key concept of proposed theoretical algorithm is to evaluate the existence possibility of the acoustic source within a searching region by using the geometric distance between each sensor element of acoustic detector and the corresponding searching region denoted by grid. We derive the mathematical equation for the magnitude of the existence possibility which can be used for implementing a new proposed algorithm. We handle and derive mathematical equations of proposed algorithm for the one-dimensional sensing array case as well as two dimensional sensing array case too. A mathematical k-wave simulation data are used for comparing the image quality of the proposed algorithm with that of general conventional algorithm in which the FFT should be necessarily used. From the k-wave Matlab simulation results, we can prove the effectiveness of the proposed reconstruction algorithm.
A More Accurate Fourier Transform
Courtney, Elya
2015-01-01
Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of explicit integrals (EI) that define Fourier transforms. This paper compares frequency, amplitude, and phase accuracy of the two methods for well resolved peaks over a wide array of data sets including cosine series with and without random noise and a variety of physical data sets, including atmospheric $\\mathrm{CO_2}$ concentrations, tides, temperatures, sound waveforms, and atomic spectra. The FFT uses MIT's FFTW3 library. The EI method uses the rectangle method to compute the areas under the curve via complex math. Results support the hypothesis that EI methods are more accurate than FFT methods. Errors range from 5 to 10 times higher when determining peak frequency by FFT, 1.4 to 60 times higher for peak amplitude, and 6 to 10 times higher for phase under a peak. The ability t...
A discrete Fourier transform for virtual memory machines
Galant, David C.
1992-01-01
An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of the details of the theory leads to a computationally efficient fast Fourier transform for the use on computers with virtual memory. Such an algorithm is of great use on modern desktop machines. A FORTRAN coded version of the algorithm is given for the case when the sequence of numbers to be transformed is a power of two.
Debnath, Lokenath
2012-01-01
This article deals with a brief biographical sketch of Joseph Fourier, his first celebrated work on analytical theory of heat, his first great discovery of Fourier series and Fourier transforms. Included is a historical development of Fourier series and Fourier transforms with their properties, importance and applications. Special emphasis is made…
Novel Micro Fourier Transform Spectrometers
Institute of Scientific and Technical Information of China (English)
KONG Yan-mei; LIANG Jing-qiu; LIANG Zhong-zhu; WANG-Bo; ZHANG Jun
2008-01-01
The miniaturization of spectrometer opens a new application area with real-time and on-site measurements. The Fourier transform spectrometer(FTS) is much attractive considering its particular advantages among the approaches. This paper reviews the current status of micro FTS in worldwide and describes its developments; In addition, analyzed are the key problems in designing and fabricating FTS to be settled during the miniaturization. Finally, a novel model of micro FTS with no moving parts is proposed and analyzed, which may provide new concepts for the design of spectrometers.
Fourier-transform optical microsystems
Collins, S. D.; Smith, R. L.; Gonzalez, C.; Stewart, K. P.; Hagopian, J. G.; Sirota, J. M.
1999-01-01
The design, fabrication, and initial characterization of a miniature single-pass Fourier-transform spectrometer (FTS) that has an optical bench that measures 1 cm x 5 cm x 10 cm is presented. The FTS is predicated on the classic Michelson interferometer design with a moving mirror. Precision translation of the mirror is accomplished by microfabrication of dovetailed bearing surfaces along single-crystal planes in silicon. Although it is miniaturized, the FTS maintains a relatively high spectral resolution, 0.1 cm-1, with adequate optical throughput.
JPL Fourier transform ultraviolet spectrometer
Cageao, R. P.; Friedl, R. R.; Sander, Stanley P.; Yung, Y. L.
1994-01-01
The Fourier Transform Ultraviolet Spectrometer (FTUVS) is a new high resolution interferometric spectrometer for multiple-species detection in the UV, visible and near-IR. As an OH sensor, measurements can be carried out by remote sensing (limb emission and column absorption), or in-situ sensing (long-path absorption or laser-induced fluorescence). As a high resolution detector in a high repetition rate (greater than 10 kHz) LIF system, OH fluorescence can be discriminated against non-resonant background emission and laser scatter, permitting (0, 0) excitation.
Fourier-Transform Infrared Spectrometer
Schindler, R. A.
1986-01-01
Fourier-transform spectrometer provides approximately hundredfold increase in luminosity at detector plane over that achievable with older instruments of this type. Used to analyze such weak sources as pollutants and other low-concentration substances in atmosphere. Interferometer creates fringe patterns on two distinct arrays of light detectors, which observe different wavelength bands. Objective lens focuses scene on image plane, which contains optical chopper. To make instrument less susceptible to variations in scene under observation, field and detector lenses focus entrance aperture, rather that image, onto detector array.
Fourier Transform Methods. Chapter 4
Kaplan, Simon G.; Quijada, Manuel A.
2015-01-01
This chapter describes the use of Fourier transform spectrometers (FTS) for accurate spectrophotometry over a wide spectral range. After a brief exposition of the basic concepts of FTS operation, we discuss instrument designs and their advantages and disadvantages relative to dispersive spectrometers. We then examine how common sources of error in spectrophotometry manifest themselves when using an FTS and ways to reduce the magnitude of these errors. Examples are given of applications to both basic and derived spectrophotometric quantities. Finally, we give recommendations for choosing the right instrument for a specific application, and how to ensure the accuracy of the measurement results..
The multiple-parameter fractional Fourier transform
Institute of Scientific and Technical Information of China (English)
LANG Jun; TAO Ran; RAN QiWen; WANG Yue
2008-01-01
The fractional Fourier transform (FRFT) has multiplicity, which is intrinsic in frac-tional operator. A new source for the multiplicity of the weight-type fractional Fou-rier transform (WFRFT) is proposed, which can generalize the weight coefficients of WFRFT to contain two vector parameters MN,∈ZM. Therefore a generalized frac-tional Fourier transform can be defined, which is denoted by the multiple-parameter fractional Fourier transform (MPFRFT). It enlarges the multiplicity of the FRFT, which not only includes the conventional FRFT and general multi-fractional Fourier transform as special cases, but also introduces new fractional Fourier transforms. It provides a unified framework for the FRFT, and the method is also available for fractionalizing other linear operators. In addition, numerical simulations of the MPFRFT on the Hermite-Gaussian and rectangular functions have been performed as a simple application of MPFRFT to signal processing.
The Fourier Transform on Quantum Euclidean Space
Directory of Open Access Journals (Sweden)
Kevin Coulembier
2011-05-01
Full Text Available We study Fourier theory on quantum Euclidean space. A modified version of the general definition of the Fourier transform on a quantum space is used and its inverse is constructed. The Fourier transforms can be defined by their Bochner's relations and a new type of q-Hankel transforms using the first and second q-Bessel functions. The behavior of the Fourier transforms with respect to partial derivatives and multiplication with variables is studied. The Fourier transform acts between the two representation spaces for the harmonic oscillator on quantum Euclidean space. By using this property it is possible to define a Fourier transform on the entire Hilbert space of the harmonic oscillator, which is its own inverse and satisfies the Parseval theorem.
Two modified discrete chirp Fourier transform schemes
Institute of Scientific and Technical Information of China (English)
樊平毅; 夏香根
2001-01-01
This paper presents two modified discrete chirp Fourier transform (MDCFT) schemes.Some matched filter properties such as the optimal selection of the transform length, and its relationship to analog chirp-Fourier transform are studied. Compared to the DCFT proposed previously, theoretical and simulation results have shown that the two MDCFTs can further improve the chirp rate resolution of the detected signals.
Fourier Analysis and Structure Determination: Part I: Fourier Transforms.
Chesick, John P.
1989-01-01
Provides a brief introduction with some definitions and properties of Fourier transforms. Shows relations, ways of understanding the mathematics, and applications. Notes proofs are not included but references are given. First of three part series. (MVL)
Discrete fourier transform (DFT) analysis for applications using iterative transform methods
Dean, Bruce H. (Inventor)
2012-01-01
According to various embodiments, a method is provided for determining aberration data for an optical system. The method comprises collecting a data signal, and generating a pre-transformation algorithm. The data is pre-transformed by multiplying the data with the pre-transformation algorithm. A discrete Fourier transform of the pre-transformed data is performed in an iterative loop. The method further comprises back-transforming the data to generate aberration data.
Quantum Fourier Transform and Phase Estimation in Qudit System
Institute of Scientific and Technical Information of China (English)
CAO Ye; PENG Shi-Guo; ZHENG Chao; LONG Gui-Lu
2011-01-01
The quantum Fourier transform and quantum phase estimation are the key components for many quantum algorithms, such as order-finding, factoring, and etc.In this article, the general procedure of quantum Fourier transform and phase estimation are investigated for high dimensional case.They can be seen as subroutines in a main program run in a qudit quantum computer, and the quantum circuits are given.
A new twist to fourier transforms
Meikle, Hamish D
2004-01-01
Making use of the inherent helix in the Fourier transform expression, this book illustrates both Fourier transforms and their properties in the round. The author draws on elementary complex algebra to manipulate the transforms, presenting the ideas in such a way as to avoid pages of complicated mathematics. Similarly, abbreviations are not used throughout and the language is kept deliberately clear so that the result is a text that is accessible to a much wider readership.The treatment is extended with the use of sampled data to finite and discrete transforms, the fast Fourier transform, or FFT, being a special case of a discrete transform. The application of Fourier transforms in statistics is illustrated for the first time using the examples operational research and later radar detection. In addition, a whole chapter on tapering or weighting functions is added for reference. The whole is rounded off by a glossary and examples of diagrams in three dimensions made possible by today's mathematics programs
The Geostationary Fourier Transform Spectrometer
Key, Richard; Sander, Stanley; Eldering, Annmarie; Blavier, Jean-Francois; Bekker, Dmitriy; Manatt, Ken; Rider, David; Wu, Yen-Hung
2012-01-01
The Geostationary Fourier Transform Spectrometer (GeoFTS) is an imaging spectrometer designed for a geostationary orbit (GEO) earth science mission to measure key atmospheric trace gases and process tracers related to climate change and human activity. GEO allows GeoFTS to continuously stare at a region of the earth for frequent sampling to capture the variability of biogenic fluxes and anthropogenic emissions from city to continental spatial scales and temporal scales from diurnal, synoptic, seasonal to interannual. The measurement strategy provides a process based understanding of the carbon cycle from contiguous maps of carbon dioxide (CO2), methane (CH4), carbon monoxide (CO), and chlorophyll fluorescence (CF) collected many times per day at high spatial resolution (2.7kmx2.7km at nadir). The CO2/CH4/CO/CF measurement suite in the near infrared spectral region provides the information needed to disentangle natural and anthropogenic contributions to atmospheric carbon concentrations and to minimize uncertainties in the flow of carbon between the atmosphere and surface. The half meter cube size GeoFTS instrument is based on a Michelson interferometer design that uses all high TRL components in a modular configuration to reduce complexity and cost. It is self-contained and as independent of the spacecraft as possible with simple spacecraft interfaces, making it ideal to be a "hosted" payload on a commercial communications satellite mission. The hosted payload approach for measuring the major carbon-containing gases in the atmosphere from the geostationary vantage point will affordably advance the scientific understating of carbon cycle processes and climate change.
Andrianov, Alexey; Szabo, Aron; Sergeev, Alexander; Kim, Arkady; Chvykov, Vladimir; Kalashnikov, Mikhail
2016-11-14
We developed an improved approach to calculate the Fourier transform of signals with arbitrary large quadratic phase which can be efficiently implemented in numerical simulations utilizing Fast Fourier transform. The proposed algorithm significantly reduces the computational cost of Fourier transform of a highly chirped and stretched pulse by splitting it into two separate transforms of almost transform limited pulses, thereby reducing the required grid size roughly by a factor of the pulse stretching. The application of our improved Fourier transform algorithm in the split-step method for numerical modeling of CPA and OPCPA shows excellent agreement with standard algorithms.
A fast DFT algorithm using complex integer transforms
Reed, I. S.; Truong, T. K.
1978-01-01
Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.
Ron, Izhar; Zaltsman, Amalia; Kendler, Shai
2013-12-01
On-site identification of organic compounds in the presence of interfering materials using a field-portable attenuated total reflection Fourier transform infrared (ATR FT-IR) spectrometer is presented. Identification is based on an algorithm that compares the analyte's infrared absorption spectrum with the reference spectra. The comparison is performed at several predetermined frequencies, and a similarity value (distance) between the measured and the reference spectra is calculated either at each frequency individually, or, alternatively, the average distance for all frequencies is calculated. The examined frequencies are selected to give the best contrast between the target materials of interest. In this study, the algorithm was optimized to identify three common chemical warfare agents (CWAs): O-ethyl S-[2-(diisopropylamino)ethyl] methylphosphonothioic acid (VX), sarin (GB), and sulfur mustard (bis(2-chloroethyl) sulfide) (HD), in the presence of field-related interfering materials (fuels, water, and dust). Receiver operating characteristics analysis was performed in order to determine the probabilities for detection (PD) and for false alerts (PF). Challenging the algorithm with a set of data that contains mixtures of CWAs and interfering materials resulted in PD of 90% and PF of 0%, 0%, and 1% for VX, GB, and HD, respectively, using the average distance approach, which was found to be much more effective than analyzing each frequency individually. This finding was validated for all possible combinations of 2-7 peaks per material. It is suggested that this algorithm provides a reliable mean for the identification of a predetermined set of target analytes and interfering materials.
Fourier transforms in radar and signal processing
Brandwood, David
2011-01-01
Fourier transforms are used widely, and are of particular value in the analysis of single functions and combinations of functions found in radar and signal processing. Still, many problems that could have been tackled by using Fourier transforms may have gone unsolved because they require integration that is difficult and tedious. This newly revised and expanded edition of a classic Artech House book provides you with an up-to-date, coordinated system for performing Fourier transforms on a wide variety of functions. Along numerous updates throughout the book, the Second Edition includes a crit
Phase retrieval for attacking fractional Fourier transform encryption.
Kong, Dezhao; Shen, Xueju; Cao, Liangcai; Jin, Guofan
2017-04-20
An advanced iterative phase retrieval algorithm is applied to perform a ciphertext-only attack on the fractional Fourier transform-based double random phase encryption system. With the given complex amplitude of ciphertext and definite support of the object image, the original object image can be recovered by estimating the energy of support area in the recovered image. The encryption system can be attacked by analyzing the sensibility of fractional Fourier transform order keys and evaluating the energy of the object image support area. The proposed algorithm can obtain encrypted fractional order and retrieve two random phase keys. Numerical results demonstrate the efficacy of the proposed attacking method.
Electronically-Scanned Fourier-Transform Spectrometer
Breckinridge, J. B.; Ocallaghan, F. G.
1984-01-01
Instrument efficient, lightweight, and stable. Fourier-transform spectrometer configuration uses electronic, instead of mechanical, scanning. Configuration insensitive to vibration-induced sampling errors introduced into mechanically scanned systems.
A DISTRIBUTION SPACE FOR FOURIER TRANSFORM
Institute of Scientific and Technical Information of China (English)
Zhou Chaoying; Yang Lihua; Huang Daren
2007-01-01
A space DF is constructed and some characterizations of space DF are given. Itis shown that the classical Fourier transform is extended to the distribution space D'F, whichcan be embedded into the Schwartz distribution space D' continuously. It is also shown thatD'F is the biggest embedded subspace of D' on which the extended Fourier transform, F, is ahomeomorphism of D'F onto itself.
Fractional Fourier transform of Lorentz beams
Institute of Scientific and Technical Information of China (English)
Zhou Guo-Quan
2009-01-01
This paper introduces Lorentz beams to describe certain laser sources that produce highly divergent fields. The fractional Fourier transform (FRFT) is applied to treat the propagation of Lorentz beams. Based on the definition of convolution and the convolution theorem of the Fourier transform, an analytical expression for a Lorentz beam passing through a FRFT system has been derived. By using the derived formula, the properties of a Lorentz beam in the FRFT plane are illustrated numerically.
Glasser, L.
1987-01-01
This paper explores how Fourier Transform (FT) mimics spectral transformation, how this property can be exploited to advantage in spectroscopy, and how the FT can be used in data treatment. A table displays a number of important FT serial/spectral pairs related by Fourier Transformations. A bibliography and listing of computer software related to…
From Complex Fractional Fourier Transform to Complex Fractional Radon Transform
Institute of Scientific and Technical Information of China (English)
FAN Hong-Yi; JIANG Nian-Quan
2004-01-01
We show that for n-dimensional complex fractional Fourier transform the corresponding complex fractional Radon transform can also be derived, however, it is different from the direct product of two n-dimensional real fractional Radon transforms. The complex fractional Radon transform of two-mode Wigner operator is calculated.
On the Scaled Fractional Fourier Transformation Operator
Institute of Scientific and Technical Information of China (English)
FAN Hong-Yi; HU Li-Yun
2008-01-01
Based on our previous study [Chin.Phys.Lett.24(2007)2238]in which the Fresnel operator corresponding to classical Fresnel transform was introduced,we derive the fractional Fourier transformation operator,and the optical operator method is then enriched.
SAW chirp Fourier transform for MB-OFDM UWB receiver
Institute of Scientific and Technical Information of China (English)
HE Peng-fei; L(U) Ying-hua; ZHANG Hong-xin; WANG Ye-qiu; XU Yong
2006-01-01
In the conventional multiband orthogonal frequency division multiplexing ultra wideband (MB-OFDM UWB )receiver, the fast Fourier transform (FFT) algorithm is realized by the expensive and power-consuming digital signal processor (DSP) chips. In this article, the lower power, lower cost, and lower complexity real-time analog surface acoustic wave (SAW)chirp Fourier transform devices were used to replace the DSP part. A MB-OFDM UWB receiver based on the M-C-M SAW chirp Fourier transform was presented, and the step of signal transformation from input signals was also depicted. The simulation results show that the proposed receiver provides similar bit error performance compared to the fully digital receiver when used in the channel environments proposed by the IEEE 802.15SG3a.
Zhang, Fang; Zhu, Jing; Song, Qiang; Yue, Weirui; Liu, Jingdan; Wang, Jian; Situ, Guohai; Huang, Huijie
2015-10-20
In general, Fourier transform lenses are considered as ideal in the design algorithms of diffractive optical elements (DOEs). However, the inherent aberrations of a real Fourier transform lens disturb the far field pattern. The difference between the generated pattern and the expected design will impact the system performance. Therefore, a method for modifying the Fourier spectrum of DOEs without introducing other optical elements to reduce the aberration effect of the Fourier transform lens is proposed. By applying this method, beam shaping performance is improved markedly for the optical system with a real Fourier transform lens. The experiments carried out with a commercial Fourier transform lens give evidence for this method. The method is capable of reducing the system complexity as well as improving its performance.
Directory of Open Access Journals (Sweden)
Mahmud Benhamid
2009-01-01
Full Text Available Problem statement: Ultra Wide Band (UWB technology has attracted many researchers' attention due to its advantages and its great potential for future applications. The physical layer standard of Multi-band Orthogonal Frequency Division Multiplexing (MB-OFDM UWB system is defined by ECMA International. In this standard, the data sampling rate from the analog-to-digital converter to the physical layer is up to 528 M sample sec-1. Therefore, it is a challenge to realize the physical layer especially the components with high computational complexity in Very Large Scale Integration (VLSI implementation. Fast Fourier Transform (FFT block which plays an important role in MB-OFDM system is one of these components. Furthermore, the execution time of this module is only 312.5 ns. Therefore, if employing the traditional approach, high power consumption and hardware cost of the processor will be needed to meet the strict specifications of the UWB system. The objective of this study was to design an Application Specific Integrated Circuit (ASIC FFT processor for this system. The specification was defined from the system analysis and literature research. Approach: Based on the algorithm and architecture analysis, a novel Genetic Algorithm (GA based Canonical Signed Digit (CSD Multiplier less 128-point FFT processor and its inverse (IFFT for MB-OFDM UWB systems had been proposed. The proposed pipelined architecture was based on the modified Radix-22 algorithm that had same number of multipliers as that of the conventional Radix-22. However, the multiplication complexity and the ROM memory needed for storing twiddle factors coefficients could be eliminated by replacing the conventional complex multipliers with a newly proposed GA optimized CSD constant multipliers. The design had been coded in Verilog HDL and targeted Xilinx Virtex-II FPGA series. It was fully implemented and tested on real hardware using Virtex-II FG456 prototype board and logic analyzer
High order generalized permutational fractional Fourier transforms
Institute of Scientific and Technical Information of China (English)
Ran Qi-Wen; Yuan Lin; Tan Li-Ying; Ma Jing; Wang Qi
2004-01-01
We generalize the definition of the fractional Fourier transform (FRFT) by extending the new definition proposed by Shih. The generalized FRFT, called the high order generalized permutational fractional Fourier transform (HGPFRFT),is a generalized permutational transform. It is shown to have arbitrary natural number M periodic eigenvalues not only with respect to the order of Hermite-Gaussian functions but also to the order of the transform. This HGPFRFT will be reduced to the original FRFT proposed by Namias and Liu's generalized FRFT and Shih's FRFT at the three limits with M = +∞,M = 4k (k is a natural number), and M = 4, respectively. Therefore the HGPFRFT introduces a comprehensive approach to Shih's FRFT and the original definition. Some important properties of HGPFRFT are discussed. Lastly the results of computer simulations and symbolic representations of the transform are provided.
Fourier transforms and convolutions for the experimentalist
Jennison, RC
1961-01-01
Fourier Transforms and Convolutions for the Experimentalist provides the experimentalist with a guide to the principles and practical uses of the Fourier transformation. It aims to bridge the gap between the more abstract account of a purely mathematical approach and the rule of thumb calculation and intuition of the practical worker. The monograph springs from a lecture course which the author has given in recent years and for which he has drawn upon a number of sources, including a set of notes compiled by the late Dr. I. C. Browne from a series of lectures given by Mr. J . A. Ratcliffe of t
Clifford Fourier transform on vector fields.
Ebling, Julia; Scheuermann, Gerik
2005-01-01
Image processing and computer vision have robust methods for feature extraction and the computation of derivatives of scalar fields. Furthermore, interpolation and the effects of applying a filter can be analyzed in detail and can be advantages when applying these methods to vector fields to obtain a solid theoretical basis for feature extraction. We recently introduced the Clifford convolution, which is an extension of the classical convolution on scalar fields and provides a unified notation for the convolution of scalar and vector fields. It has attractive geometric properties that allow pattern matching on vector fields. In image processing, the convolution and the Fourier transform operators are closely related by the convolution theorem and, in this paper, we extend the Fourier transform to include general elements of Clifford Algebra, called multivectors, including scalars and vectors. The resulting convolution and derivative theorems are extensions of those for convolution and the Fourier transform on scalar fields. The Clifford Fourier transform allows a frequency analysis of vector fields and the behavior of vector-valued filters. In frequency space, vectors are transformed into general multivectors of the Clifford Algebra. Many basic vector-valued patterns, such as source, sink, saddle points, and potential vortices, can be described by a few multivectors in frequency space.
Implementation of quantum and classical discrete fractional Fourier transforms.
Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N; Szameit, Alexander
2016-03-23
Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.
Replica Fourier Transform: Properties and applications
Directory of Open Access Journals (Sweden)
A. Crisanti
2015-02-01
Full Text Available The Replica Fourier Transform is the generalization of the discrete Fourier Transform to quantities defined on an ultrametric tree. It finds use in conjunction of the replica method used to study thermodynamics properties of disordered systems such as spin glasses. Its definition is presented in a systematic and simple form and its use illustrated with some representative examples. In particular we give a detailed discussion of the diagonalization in the Replica Fourier Space of the Hessian matrix of the Gaussian fluctuations about the mean field saddle point of spin glass theory. The general results are finally discussed for a generic spherical spin glass model, where the Hessian can be computed analytically.
Ultrafast Fourier-transform parallel processor
Energy Technology Data Exchange (ETDEWEB)
Greenberg, W.L.
1980-04-01
A new, flexible, parallel-processing architecture is developed for a high-speed, high-precision Fourier transform processor. The processor is intended for use in 2-D signal processing including spatial filtering, matched filtering and image reconstruction from projections.
Fourier transforms on an amalgam type space
Liflyand, E
2012-01-01
We introduce an amalgam type space, a subspace of $L^1(\\mathbb R_+).$ Integrability results for the Fourier transform of a function with the derivative from such an amalgam space are proved. As an application we obtain estimates for the integrability of trigonometric series.
Fourier transform infrared spectrometery: an undergraduate experiment
Lerner, L.
2016-11-01
Simple apparatus is developed, providing undergraduate students with a solid understanding of Fourier transform (FT) infrared (IR) spectroscopy in a hands on experiment. Apart from its application to measuring the mid-IR spectra of organic molecules, the experiment introduces several techniques with wide applicability in physics, including interferometry, the FT, digital data analysis, and control theory.
Discrete Fourier Transform Analysis in a Complex Vector Space
Dean, Bruce H.
2009-01-01
Alternative computational strategies for the Discrete Fourier Transform (DFT) have been developed using analysis of geometric manifolds. This approach provides a general framework for performing DFT calculations, and suggests a more efficient implementation of the DFT for applications using iterative transform methods, particularly phase retrieval. The DFT can thus be implemented using fewer operations when compared to the usual DFT counterpart. The software decreases the run time of the DFT in certain applications such as phase retrieval that iteratively call the DFT function. The algorithm exploits a special computational approach based on analysis of the DFT as a transformation in a complex vector space. As such, this approach has the potential to realize a DFT computation that approaches N operations versus Nlog(N) operations for the equivalent Fast Fourier Transform (FFT) calculation.
Electro-optic imaging Fourier transform spectrometer
Chao, Tien-Hsin (Inventor); Znod, Hanying (Inventor)
2009-01-01
An Electro-Optic Imaging Fourier Transform Spectrometer (EOIFTS) for Hyperspectral Imaging is described. The EOIFTS includes an input polarizer, an output polarizer, and a plurality of birefringent phase elements. The relative orientations of the polarizers and birefringent phase elements can be changed mechanically or via a controller, using ferroelectric liquid crystals, to substantially measure the spectral Fourier components of light propagating through the EIOFTS. When achromatic switches are used as an integral part of the birefringent phase elements, the EIOFTS becomes suitable for broadband applications, with over 1 micron infrared bandwidth.
Fractional Fourier Transform for Ultrasonic Chirplet Signal Decomposition
Directory of Open Access Journals (Sweden)
Yufeng Lu
2012-01-01
Full Text Available A fractional fourier transform (FrFT based chirplet signal decomposition (FrFT-CSD algorithm is proposed to analyze ultrasonic signals for NDE applications. Particularly, this method is utilized to isolate dominant chirplet echoes for successive steps in signal decomposition and parameter estimation. FrFT rotates the signal with an optimal transform order. The search of optimal transform order is conducted by determining the highest kurtosis value of the signal in the transformed domain. A simulation study reveals the relationship among the kurtosis, the transform order of FrFT, and the chirp rate parameter in the simulated ultrasonic echoes. Benchmark and ultrasonic experimental data are used to evaluate the FrFT-CSD algorithm. Signal processing results show that FrFT-CSD not only reconstructs signal successfully, but also characterizes echoes and estimates echo parameters accurately. This study has a broad range of applications of importance in signal detection, estimation, and pattern recognition.
The Discrete Fourier Transform on hexagonal remote sensing image
Li, Yalu; Ben, Jin; Wang, Rui; Du, Lingyu
2016-11-01
Global discrete grid system will subdivide the earth recursively to form a multi-resolution grid hierarchy with no Overlap and seamless which help build global uniform spatial reference datum and multi-source data processing mode which takes the position as the object and in the aspect of data structure supports the organization, process and analysis of the remote sensing big data. This paper adopts the base transform to realize the mutual transformation of square pixel and hexagonal pixel. This paper designs the corresponding discrete Fourier transform algorithm for any lattice. Finally, the paper show the result of the DFT of the remote sensing image of the hexagonal pixel.
A FAST ALGORITHM OF DISCRETE GENERALIZED FOURIER TRANSFORMS ON HEXAGON DOMAINS%平行六边形区域上的快速离散傅立叶变换
Institute of Scientific and Technical Information of China (English)
孙家昶; 姚继锋
2004-01-01
In this paper, we propose a fast algorithm for computing the DGFT (Discrete Generalized Fourier Transforms) on hexagon domains [6], based on the geometric properties of the domain. Our fast algorithm (FDGFT) reduces the computation complexity of DGFT from O(N4) to O(N2 log N). In particulary, for N =2P23P34P45P56P6, the floating point computation working amount equals to(17/2P2 + 16p3 + 135/8p4 + 2424/25p5 + 201/2P6)3N2. Numerical examples are given to access our analysis.
Time-frequency representation measurement based on temporal Fourier transformation
Suen, Yifan; Xiao, Shaoqiu; Hao, Sumin; Zhao, Xiaoxiang; Xiong, Yigao; Liu, Shenye
2016-10-01
We propose a new scheme to physically realize the short-time Fourier transform (STFT) of chirped optical pulse using time-lens array that enables us to get time-frequency representation without using FFT algorithm. The time-lens based upon the four-wave mixing is used to perform the process of temporal Fourier transformation. Pump pulse is used for both providing the quadratic phase and being the window function of STFT. The idea of STFT is physically realized in our scheme. Simulations have been done to investigate performance of the time-frequency representation scheme (TFRS) in comparison with STFT using FFT algorithm. Optimal measurement of resolution in time and frequency has been discussed.
Fourier Transform Fabry-Perot Interferometer
Snell, Hilary E.; Hays, Paul B.
1992-01-01
We are developing a compact, rugged, high-resolution remote sensing instrument with wide spectral scanning capabilities. This relatively new type of instrument, which we have chosen to call the Fourier-Transform Fabry-Perot Interferometer (FT-FPI), is accomplished by mechanically scanning the etalon plates of a Fabry-Perot interferometer (FPI) through a large optical distance while examining the concomitant signal with a Fourier-transform analysis technique similar to that employed by the Michelson interferometer. The FT-FPI will be used initially as a ground-based instrument to study near-infrared atmospheric absorption lines of trace gases using the techniques of solar absorption spectroscopy. Future plans include modifications to allow for measurements of trace gases in the stratosphere using spectral lines at terahertz frequencies.
Fourier Transform Infrared Spectroscopic Studies in Flotation
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Fourier transform infrared (FTIR) spectroscopy has been extensively employed in flotation research.The work done by the author and co-workers has been reported.A comparison has been made among the different FTIR spectroscopic techniques,e.g.,transmission FTIR spectroscopy,diffuse reflectance infrared Fourier transform (DRIFT) spectroscopy,and attenuated total reflectance (ATR) FTIR spectroscopy.FTIR spectroscopy has been used to study the mechanism of interaction between the collector and the surfaces of different minerals,the mechanism of action of the depressant in improving the selectivity of flotation,and the mechanism of adsorption of the polymeric modifying reagent on mineral surfaces.The interaction between particles in mineral suspension has also been studied by FTIR spectroscopy.
Fourier-transform spectroscopy instrumentation engineering
Saptari, Vidi
2003-01-01
Many applications today require the Fourier-transform (FT) spectrometer to perform close to its limitations, such as taking many quantitative measurements in the visible and in the near infrared wavelength regions. In such cases, the instrument should not be considered as a perfect ""black box."" Knowing where the limitations of performance arise and which components must be improved are crucial to obtaining repeatable and accurate results. One of the objectives of this book is to help the user identify the instrument's bottleneck.
The Non-uniform Fast Fourier Transform in Computed Tomography
Tang, Junqi
2016-01-01
This project is aimed at designing the fast forward projection algorithm and also the backprojection algorithm for cone beam CT imaging systems with circular X-ray source trajectory. The principle of the designs is based on utilizing the potential computational efficiency which the Fourier Slice Theorem and the Non-uniform Fast Fourier Transform (NUFFT) will bring forth. In this Masters report, the detailed design of the NUFFT based forward projector including a novel 3D (derivative of) Radon space resampling method will be given. Meanwhile the complexity of the NUFFT based forward projector is analysed and compared with the non-Fourier based CT projector, and the advantage of the NUFFT based forward projection in terms of the computational efficiency is demonstrated in this report. Base on the design of the forward algorithm, the NUFFT based 3D direct reconstruction algorithm will be derived. The experiments will be taken to test the performance of the forward algorithm and the backprojection algorithm to sh...
Matrix isolation studies with Fourier transform IR
Energy Technology Data Exchange (ETDEWEB)
Green, David W.; Reedy, Gerald T.
1977-01-01
The combination of Fourier transform infrared (FT-IR) spectroscopy with the matrix-isolation techniques has advantages compared with the use of more conventional grating spectroscopy. Furthermore, the recent commercial availability of Fourier transform spectrometers has made FT-IR a practical alternative. Some advantages of the FT-IR spectrometer over the grating spectrometer are the result of the computerized data system that is a necessary part of the FT-IR spectrometer; other advantages are a consequence of the difference in optical arrangements and these represent the inherent advantages of the FT-IR method. In most applications with the matrix-isolation technique, the use of FT-IR spectroscopy results in either an improved signal-to-noise ratio or a shorter time for data collection compared with grating infrared spectroscopy. Fourier transform infrared spectroscopy has been used in the laboratory to study several molecular species in low-temperature matrices. Some species have been produced by high-temperature vaporization from Knudsen cells and others by sputtering. By sputtering, Ar and Kr matrices have been prepared which contain U atoms, UO, UO/sub 2/, UO/sub 3/, PuO, PuO/sub 2/, UN, or UN/sub 2/, depending upon the composition of the gas used to sputter as well as the identity of the metallic cathode. Infrared spectra of matrices containing these compounds are presented and discussed. (JRD)
Optical Planar Discrete Fourier and Wavelet Transforms
Cincotti, Gabriella; Moreolo, Michela Svaluto; Neri, Alessandro
2007-10-01
We present all-optical architectures to perform discrete wavelet transform (DWT), wavelet packet (WP) decomposition and discrete Fourier transform (DFT) using planar lightwave circuits (PLC) technology. Any compact-support wavelet filter can be implemented as an optical planar two-port lattice-form device, and different subband filtering schemes are possible to denoise, or multiplex optical signals. We consider both parallel and serial input cases. We design a multiport decoder/decoder that is able to generate/process optical codes simultaneously and a flexible logarithmic wavelength multiplexer, with flat top profile and reduced crosstalk.
Wavelets for approximate Fourier transform and data compression
Guo, Haitao
This dissertation has two parts. In the first part, we develop a wavelet-based fast approximate Fourier transform algorithm. The second part is devoted to the developments of several wavelet-based data compression techniques for image and seismic data. We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The classical Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. The main advantage of our algorithm is that the good time and frequency localization of wavelets can be exploited to approximate the Fourier transform for many classes of signals, resulting in much less computation. Thus the new algorithm provides an efficient complexity versus accuracy tradeoff. When approximations are allowed, under certain sparsity conditions, the algorithm can achieve linear complexity, i.e. O(N). The proposed algorithm also has built-in noise reduction capability. For waveform and image compression, we propose a novel scheme using the recently developed Burrows-Wheeler transform (BWT). We show that the discrete wavelet transform (DWT) should be used before the Burrows-Wheeler transform to improve the compression performance for many natural signals and images. We demonstrate that the simple concatenation of the DWT and BWT coding performs comparably as the embedded zerotree wavelet (EZW) compression for images. Various techniques that significantly improve the performance of our compression scheme are also discussed. The phase information is crucial for seismic data processing. However, traditional compression schemes do not pay special attention to preserving the phase of the seismic data, resulting in the loss of critical information. We propose a lossy compression method that preserves the phase as much as possible. The method is based on the self-adjusting wavelet transform that adapts to the locations of the significant signal components
Programs for high-speed Fourier, Mellin and Fourier-Bessel transforms
Ikhabisimov, D. K.; Debabov, A. S.; Kolosov, B. I.; Usikov, D. A.
1979-01-01
Several FORTRAN program modules for performing one-dimensional and two-dimensional discrete Fourier transforms, Mellin, and Fourier-Bessel transforms are described along with programs that realize the algebra of high speed Fourier transforms on a computer. The programs can perform numerical harmonic analysis of functions, synthesize complex optical filters on a computer, and model holographic image processing methods.
Vélez-Rábago, Rodrigo; Solorza-Calderón, Selene; Jordan-Aramburo, Adina
2016-12-01
This work presents an image pattern recognition system invariant to translation, scale and rotation. The system uses the Fourier transform to achieve the invariance to translation and the analytical Forier-Mellin transform for the invariance to scale and rotation. According with the statistical theory of box-plots, the pattern recognition system has a confidence level at least of 95.4%.
Laser Field Imaging Through Fourier Transform Heterodyne
Energy Technology Data Exchange (ETDEWEB)
Cooke, B.J.; Laubscher, B.E.; Olivas, N.L.; Galbraith, A.E.; Strauss, C.E.; Grubler, A.C.
1999-04-05
The authors present a detection process capable of directly imaging the transverse amplitude, phase, and Doppler shift of coherent electromagnetic fields. Based on coherent detection principles governing conventional heterodyned RADAR/LADAR systems, Fourier Transform Heterodyne incorporates transverse spatial encoding of the reference local oscillator for image capture. Appropriate selection of spatial encoding functions allows image retrieval by way of classic Fourier manipulations. Of practical interest: (1) imaging may be accomplished with a single element detector/sensor requiring no additional scanning or moving components, (2) as detection is governed by heterodyne principles, near quantum limited performance is achievable, (3) a wide variety of appropriate spatial encoding functions exist that may be adaptively configured in real-time for applications requiring optimal detection, and (4) the concept is general with the applicable electromagnetic spectrum encompassing the RF through optical.
Mass spectral peak distortion due to Fourier transform signal processing.
Rockwood, Alan L; Erve, John C L
2014-12-01
Distortions of peaks can occur when one uses the standard method of signal processing of data from the Orbitrap and other FT-based methods of mass spectrometry. These distortions arise because the standard method of signal processing is not a linear process. If one adds two or more functions, such as time-dependent signals from a Fourier transform mass spectrometer and performs a linear operation on the sum, the result is the same as if the operation was performed on separate functions and the results added. If this relationship is not valid, the operation is non-linear and can produce unexpected and/or distorted results. Although the Fourier transform itself is a linear operator, the standard algorithm for processing spectra in Fourier transform-based methods include non-linear mathematical operators such that spectra processed by the standard algorithm may become distorted. The most serious consequence is that apparent abundances of the peaks in the spectrum may be incorrect. In light of these considerations, we performed theoretical modeling studies to illustrate several distortion effects that can be observed, including abundance distortions. In addition, we discuss experimental systems where these effects may manifest, including suggested systems for study that should demonstrate these peak distortions. Finally, we point to several examples in the literature where peak distortions may be rationalized by the phenomena presented here.
Implementing quantum Fourier transform with integrated photonic devices
Tabia, Gelo Noel
2014-03-01
Many quantum algorithms that exhibit exponential speedup over their classical counterparts employ the quantum Fourier transform, which is used to solve interesting problems such as prime factorization. Meanwhile, nonclassical interference of single photons achieved on integrated platforms holds the promise of achieving large-scale quantum computation with multiport devices. An optical multiport device can be built to realize any quantum circuit as a sequence of unitary operations performed by beam splitters and phase shifters on path-encoded qudits. In this talk, I will present a recursive scheme for implementing quantum Fourier transform with a multimode interference photonic integrated circuit. Research at Perimeter Institute is supported by the Government of Canada through Industry Canada and by the Province of Ontario through the Ministry of Research and Innovation.
Fourier transforms in the complex domain
Wiener, N
1934-01-01
With the aid of Fourier-Mellin transforms as a tool in analysis, the authors were able to attack such diverse analytic questions as those of quasi-analytic functions, Mercer's theorem on summability, Milne's integral equation of radiative equilibrium, the theorems of MÃ¼nz and SzÃ¡sz concerning the closure of sets of powers of an argument, Titchmarsh's theory of entire functions of semi-exponential type with real negative zeros, trigonometric interpolation and developments in polynomials of the form \\sum^N_1A_ne^{i\\lambda_nx}, lacunary series, generalized harmonic analysis in the complex domain,
Improved method of generating bit reversed numbers for calculating fast fourier transform
Digital Repository Service at National Institute of Oceanography (India)
Suresh, T.
Fast Fourier Transform (FFT) is an important tool required for signal processing in defence applications. This paper reports an improved method for generating bit reversed numbers needed in calculating FFT using radix-2. The refined algorithm takes...
Fourier transforms in generalized Fock spaces
Directory of Open Access Journals (Sweden)
John Schmeelk
1990-01-01
Full Text Available A classical Fock space consists of functions of the form,Φ↔(ϕ0,ϕ1,…,ϕq,…,where ϕ0∈C and ϕq∈L2(R3q, q≥1. We will replace the ϕq, q≥1 with q-symmetric rapid descent test functions within tempered distribution theory. This space is a natural generalization of a classical Fock space as seen by expanding functionals having generalized Taylor series. The particular coefficients of such series are multilinear functionals having tempered distributions as their domain. The Fourier transform will be introduced into this setting. A theorem will be proven relating the convergence of the transform to the parameter, s, which sweeps out a scale of generalized Fock spaces.
FFTW: Fastest Fourier Transform in the West
Frigo, Matteo; Johnson, Steven G.
2012-01-01
FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data, i.e. the discrete cosine/sine transforms or DCT/DST). Benchmarks performed on a variety of platforms show that FFTW's performance is typically superior to that of other publicly available FFT software, and is even competitive with vendor-tuned codes. In contrast to vendor-tuned codes, however, FFTW's performance is portable: the same program will perform well on most architectures without modification. The FFTW library is required by other codes such as StarCrash and Hammurabi.
Two-dimensional fourier transform spectrometer
Energy Technology Data Exchange (ETDEWEB)
DeFlores, Lauren; Tokmakoff, Andrei
2016-10-25
The present invention relates to a system and methods for acquiring two-dimensional Fourier transform (2D FT) spectra. Overlap of a collinear pulse pair and probe induce a molecular response which is collected by spectral dispersion of the signal modulated probe beam. Simultaneous collection of the molecular response, pulse timing and characteristics permit real time phasing and rapid acquisition of spectra. Full spectra are acquired as a function of pulse pair timings and numerically transformed to achieve the full frequency-frequency spectrum. This method demonstrates the ability to acquire information on molecular dynamics, couplings and structure in a simple apparatus. Multi-dimensional methods can be used for diagnostic and analytical measurements in the biological, biomedical, and chemical fields.
Two-dimensional fourier transform spectrometer
DeFlores, Lauren; Tokmakoff, Andrei
2013-09-03
The present invention relates to a system and methods for acquiring two-dimensional Fourier transform (2D FT) spectra. Overlap of a collinear pulse pair and probe induce a molecular response which is collected by spectral dispersion of the signal modulated probe beam. Simultaneous collection of the molecular response, pulse timing and characteristics permit real time phasing and rapid acquisition of spectra. Full spectra are acquired as a function of pulse pair timings and numerically transformed to achieve the full frequency-frequency spectrum. This method demonstrates the ability to acquire information on molecular dynamics, couplings and structure in a simple apparatus. Multi-dimensional methods can be used for diagnostic and analytical measurements in the biological, biomedical, and chemical fields.
Research progress on discretization of fractional Fourier transform
Institute of Scientific and Technical Information of China (English)
TAO Ran; ZHANG Feng; WANG Yue
2008-01-01
As the fractional Fourier transform has attracted a considerable amount of atten-tion in the area of optics and signal processing,the discretization of the fractional Fourier transform becomes vital for the application of the fractional Fourier trans-form.Since the discretization of the fractional Fourier transform cannot be obtained by directly sampling in time domain and the fractional Fourier domain,the discre-tization of the fractional Fourier transform has been investigated recently.A sum-mary of discretizations of the fractional Fourier transform developed in the last nearly two decades is presented in this paper.The discretizations include sampling in the fractional Fourier domain,discrete-time fractional Fourier transform,frac-tional Fourier series,discrete fractional Fourier transform (including 3 main types:linear combination-type;sampling-type;and eigen decomposition-type),and other discrete fractional signal transform.It is hoped to offer a doorstep for the readers who are interested in the fractional Fourier transform.
The Fourier transform of tubular densities
Prior, C B
2012-05-18
We consider the Fourier transform of tubular volume densities, with arbitrary axial geometry and (possibly) twisted internal structure. This density can be used to represent, among others, magnetic flux or the electron density of biopolymer molecules. We consider tubes of both finite radii and unrestricted radius. When there is overlap of the tube structure the net density is calculated using the super-position principle. The Fourier transform of this density is composed of two expressions, one for which the radius of the tube is less than the curvature of the axis and one for which the radius is greater (which must have density overlap). This expression can accommodate an asymmetric density distribution and a tube structure which has non-uniform twisting. In addition we give several simpler expressions for isotropic densities, densities of finite radius, densities which decay at a rate sufficient to minimize local overlap and finally individual surfaces of the tube manifold. These simplified cases can often be expressed as arclength integrals and can be evaluated using a system of first-order ODEs. © 2012 IOP Publishing Ltd.
JCE Online: Interactive Fourier Transform Activities
Zielinski, Theresa Julia
1999-02-01
In our vigorous teaching of concepts and skills to students, we may cover (hide) more than we uncover, obscuring significant relationships between mathematical models and their associated chemical concepts with excessive mathematical derivations. To set the record straight, I find that mathematical treatments of physical phenomena are beautiful and elegant. Students should know from where the equations and simplifications leading to them arise. They should know the limits of the equations in order to use them properly. However, this can be the Siren's song. For example, the mathematical representation of the Fourier transform and its significance as presented in most texts are too brief to convey understanding to the typical undergraduate student. Furthermore, a few hand calculations would not permit deeper probing of the method and its intimate link to spectroscopy. The Fourier transform is a very good example of how symbolic equation software can help to uncover the science by making the mathematical manipulations easier and the mathematical concepts more accessible. The complete articles and Mathcad documents described in these abstracts are available from JCE Online at http://jchemed.chem.wisc.edu/JCEWWW/Columns/McadInChem/.
Energy Technology Data Exchange (ETDEWEB)
Bueno, Josiane M.; Traina, Agma Juci M. [Sao Paulo Univ., Sao Carlos, SP (Brazil). Inst. de Ciencias Matematicas; Cruvinel, Paulo E. [EMBRAPA, Sao Carlos, SP (Brazil). CNPDIA
1995-12-31
This work presents an algorithm for three-dimensional digital image reconstruction. Such algorithms based on the combination of both a Fast Fourier Transform method with Hamming Window and the use of a tri-linear interpolation function. The algorithm allows not only the generation of three-dimensional spatial spin distribution maps for Magnetic Resonance Tomography data but also X and Y-rays linear attenuation coefficient maps for CT scanners. Results demonstrates the usefulness of the algorithm in three-dimensional image reconstruction by doing first two-dimensional reconstruction and rather after interpolation. The algorithm was developed in C++ language, and there are two available versions: one under the DOS environment, and the other under the UNIX/Sun environment. (author) 10 refs., 5 figs.
Fourier transform approach in modulation technique of experimental measurements.
Khazimullin, M V; Lebedev, Yu A
2010-04-01
An application of Fourier transform approach in modulation technique of experimental studies is considered. This method has obvious advantages compared with traditional lock-in amplifiers technique--simple experimental setup, a quickly available information on all the required harmonics, high speed of data processing using fast Fourier transform algorithm. A computationally simple, fast and accurate Fourier coefficients interpolation (FCI) method has been implemented to obtain a useful information from harmonics of a multimode signal. Our analysis shows that in this case FCI method has a systematical error (bias) of a signal parameters estimation, which became essential for the short data sets. Hence, a new differential Fourier coefficients interpolation (DFCI) method has been suggested, which is less sensitive to a presence of several modes in a signal. The analysis has been confirmed by simulations and measurements of a quartz wedge birefringence by means of the photoelastic modulator. The obtained bias, noise level, and measuring speed are comparable and even better than in lock-in amplifier technique. Moreover, presented DFCI method is expected to be promised candidate for using in actively developing imaging systems based on the modulation technique requiring fast digital signal processing of large data sets.
Fourier Transforms Simplified: Computing an Infrared Spectrum from an Interferogram
Hanley, Quentin S.
2012-01-01
Fourier transforms are used widely in chemistry and allied sciences. Examples include infrared, nuclear magnetic resonance, and mass spectroscopies. A thorough understanding of Fourier methods assists the understanding of microscopy, X-ray diffraction, and diffraction gratings. The theory of Fourier transforms has been presented in this "Journal",…
Institute of Scientific and Technical Information of China (English)
周业勤; 龙敏
2015-01-01
According to the properties of fractional Fourier transform, a kind of fractional Fourier transform image encryp-tion algorithm is analyzed. The key is not sensitive and the deciphering diagram is of great distortion, when with the naked eye on results chart to judge and extract the image data for comparison. Theoretical analysis and experimental results show that the algorithm is not sensitive to the key when the fractional Fourier transform is directly applied to image encryption. The introduction of RGB mapping to realize the cipher image display and transmission, result a great distortion in pixels.%从分数阶傅里叶变换的性质出发，对一类分数阶傅里叶变换图像加密算法进行分析。对原有算法结果图进行肉眼判断，提取图像中间结果数据进行对比分析，可知算法的密钥具有不敏感性，并且解密图具有很大失真。对分数傅里叶变换进行理论上的分析和讨论。分析及实验结果表明，直接使用分数阶傅里叶变换进行加密的算法对密钥并不敏感，存在安全隐患。为实现密文图像的显示和传输而引入的RGB映射将导致解密图像像素值失真。
From fractional Fourier transformation to quantum mechanical fractional squeezing transformation
Institute of Scientific and Technical Information of China (English)
吕翠红; 范洪义; 李东韡
2015-01-01
By converting the triangular functions in the integration kernel of the fractional Fourier transformation to the hy-perbolic function, i.e., tanα→tanhα, sinα→sinhα, we find quantum mechanical fractional squeezing transformation (FrST) which satisfies additivity. By virtue of the integration technique within ordered product of operators (IWOP) wederive the unitary operator responsible for the FrST, which is composite and is made of eiπa†a/2 and exp[ iα2 (a2+a†2)]. The FrST may be implemented in combinations of quadratic nonlinear crystals with different phase mismatches.
Pisani, Marco; Zucco, Massimo
2009-05-11
An imaging spectrometer based on a Fabry-Perot interferometer is presented. The Fabry-Perot interferometer scans the mirror distance up to contact and the intensity modulated light signal is transformed using a Fourier Transform based algorithm, as the Michelson based Fourier Transform Spectrometers does. The resulting instrument has the advantage of a compact, high numerical aperture, high luminosity hyperspectral imaging device. Theory of operation is described along with one experimental realization and preliminary results.
Fourier transform inequalities for phylogenetic trees.
Matsen, Frederick A
2009-01-01
Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for phylogenetic trees. A mutation matrix, by its definition, is the exponential of a matrix with non-negative off-diagonal entries; this positivity requirement implies non-trivial constraints on the site-pattern frequency vectors. We call these additional constraints "edge-parameter inequalities". In this paper, we first motivate the edge-parameter inequalities by considering a pathological site-pattern frequency vector corresponding to a quartet tree with a negative internal edge. This site-pattern frequency vector nevertheless satisfies all of the constraints described up to now in the literature. We next describe two complete sets of edge-parameter inequalities for the group-based models; these constraints are square-free monomial inequalities in the Fourier transformed coordinates. These inequalities, along with the phylogenetic invariants, form a complete description of the set of site-pattern frequency vectors corresponding to bona fide trees. Said in mathematical language, this paper explicitly presents two finite lists of inequalities in Fourier coordinates of the form "monomial < or = 1", each list characterizing the phylogenetically relevant semialgebraic subsets of the phylogenetic varieties.
Multicomplementary operators via finite Fourier transform
Energy Technology Data Exchange (ETDEWEB)
Klimov, Andrei B [Departamento de Fisica, Universidad de Guadalajara, Revolucion 1500, 44420 Guadalajara, Jalisco (Mexico); Sanchez-Soto, Luis L [Department of Physics, Lakehead University, Thunder Bay, Ontario P7B 5E1 (Canada); Guise, Hubert de [Department of Physics, Lakehead University, Thunder Bay, Ontario P7B 5E1 (Canada)
2005-03-25
A complete set of d + 1 mutually unbiased bases exists in a Hilbert space of dimension d, whenever d is a power of a prime. We discuss a simple construction of d + 1 disjoint classes (each one having d - 1 commuting operators) such that the corresponding eigenstates form sets of unbiased bases. Such a construction works properly for prime dimension. We investigate an alternative construction in which the real numbers that label the classes are replaced by a finite field having d elements. One of these classes is diagonal, and can be mapped to cyclic operators by means of the finite Fourier transform, which allows one to understand complementarity in a similar way as for the position-momentum pair in standard quantum mechanics. The relevant examples of two and three qubits and two qutrits are discussed in detail.
Fourier transform spectroscopy for future planetary missions
Brasunas, John; Kolasinski, John; Kostiuk, Ted; Hewagama, Tilak
2017-01-01
Thermal-emission infrared spectroscopy is a powerful tool for exploring the composition, temperature structure, and dynamics of planetary atmospheres; and the temperature of solid surfaces. A host of Fourier transform spectrometers (FTS) such as Mariner IRIS, Voyager IRIS, and Cassini CIRS from NASA Goddard have made and continue to make important new discoveries throughout the solar system. Future FTS instruments will have to be more sensitive (when we concentrate on the colder, outer reaches of the solar system), and less massive and less power-hungry as we cope with decreasing resource allotments for future planetary science instruments. With this in mind, we have developed CIRS-lite, a smaller version of the CIRS FTS for future planetary missions. We discuss the roadmap for making CIRS-lite a viable candidate for future planetary missions, including the recent increased emphasis on ocean worlds (Europa, Encelatus, Titan) and also on smaller payloads such as CubeSats and SmallSats.
Applying Quaternion Fourier Transforms for Enhancing Color Images
Directory of Open Access Journals (Sweden)
M.I. Khalil
2012-03-01
Full Text Available The Fourier transforms play a critical role in a broad range of image processing applications, including enhancement, analysis, restoration, and compression. Until recently, it was common to use the conventional methods to deal with colored images. These methods are based on RGB decomposition of the colored image by separating it into three separate scalar images and computing the Fourier transforms of these images separately. The computing of the Hypercomplex 2D Fourier transform of a color image as a whole unit has only recently been realized. This paper is concerned with frequency domain noise reduction of color images using quaternion Fourier transforms. The approach is based on obtaining quaternion Fourier transform of the color image and applying the Gaussian filter to it in the frequency domain. The filtered image is then obtained by calculating the inverse quaternion Fourier transforms.
Integrability of the Fourier transform: functions of bounded variation
Liflyand, E
2012-01-01
Certain relations between the Fourier transform of a function of bounded variation and the Hilbert transform of its derivative are revealed. The widest subspaces of the space of functions of bounded variation are indicated in which the cosine and sine Fourier transforms are integrable.
Geometric interpretations of the Discrete Fourier Transform (DFT)
Campbell, C. W.
1984-01-01
One, two, and three dimensional Discrete Fourier Transforms (DFT) and geometric interpretations of their periodicities are presented. These operators are examined for their relationship with the two sided, continuous Fourier transform. Discrete or continuous transforms of real functions have certain symmetry properties. The symmetries are examined for the one, two, and three dimensional cases. Extension to higher dimension is straight forward.
Precise and fast spatial-frequency analysis using the iterative local Fourier transform.
Lee, Sukmock; Choi, Heejoo; Kim, Dae Wook
2016-09-19
The use of the discrete Fourier transform has decreased since the introduction of the fast Fourier transform (fFT), which is a numerically efficient computing process. This paper presents the iterative local Fourier transform (ilFT), a set of new processing algorithms that iteratively apply the discrete Fourier transform within a local and optimal frequency domain. The new technique achieves 210 times higher frequency resolution than the fFT within a comparable computation time. The method's superb computing efficiency, high resolution, spectrum zoom-in capability, and overall performance are evaluated and compared to other advanced high-resolution Fourier transform techniques, such as the fFT combined with several fitting methods. The effectiveness of the ilFT is demonstrated through the data analysis of a set of Talbot self-images (1280 × 1024 pixels) obtained with an experimental setup using grating in a diverging beam produced by a coherent point source.
Accelerating the Non-equispaced Fast Fourier Transform on Commodity Graphics Hardware
DEFF Research Database (Denmark)
Sørensen, Thomas Sangild; Schaeffter, Tobias; Noe, Karsten Østergaard
2008-01-01
We present a fast parallel algorithm to compute the Non-equispaced fast Fourier transform on commodity graphics hardware (the GPU). We focus particularly on a novel implementation of the convolution step in the transform, which was previously its most time consuming part. We describe the performa......We present a fast parallel algorithm to compute the Non-equispaced fast Fourier transform on commodity graphics hardware (the GPU). We focus particularly on a novel implementation of the convolution step in the transform, which was previously its most time consuming part. We describe...
Fast Inverse Nonlinear Fourier Transforms for Fiber Bragg Grating Design and Related Problems
Wahls, Sander
2016-01-01
The problem of constructing a fiber Bragg grating profile numerically such that the reflection coefficient of the grating matches a given specification is considered. The well-known analytic solution to this problem is given by a suitable inverse nonlinear Fourier transform (also known as inverse scattering transform) of the specificed reflection coefficient. Many different algorithms have been proposed to compute this inverse nonlinear Fourier transform numerically. The most efficient ones require $\\mathcal{O}(D^{2})$ floating point operations (flops) to generate $D$ samples of the grating profile. In this paper, two new fast inverse nonlinear Fourier transform algorithms that require only $\\mathcal{O}(D\\log^{2}D)$ flops are proposed. The merits of our algorithms are demonstrated in numerical examples, in which they are compared to a conventional layer peeling method, the Toeplitz inner bordering method and integral layer peeling. One of our two algorithms also extends to the design problem for fiber-assiste...
Partial differential equation transform - Variational formulation and Fourier analysis.
Wang, Yang; Wei, Guo-Wei; Yang, Siyang
2011-12-01
Nonlinear partial differential equation (PDE) models are established approaches for image/signal processing, data analysis and surface construction. Most previous geometric PDEs are utilized as low-pass filters which give rise to image trend information. In an earlier work, we introduced mode decomposition evolution equations (MoDEEs), which behave like high-pass filters and are able to systematically provide intrinsic mode functions (IMFs) of signals and images. Due to their tunable time-frequency localization and perfect reconstruction, the operation of MoDEEs is called a PDE transform. By appropriate selection of PDE transform parameters, we can tune IMFs into trends, edges, textures, noise etc., which can be further utilized in the secondary processing for various purposes. This work introduces the variational formulation, performs the Fourier analysis, and conducts biomedical and biological applications of the proposed PDE transform. The variational formulation offers an algorithm to incorporate two image functions and two sets of low-pass PDE operators in the total energy functional. Two low-pass PDE operators have different signs, leading to energy disparity, while a coupling term, acting as a relative fidelity of two image functions, is introduced to reduce the disparity of two energy components. We construct variational PDE transforms by using Euler-Lagrange equation and artificial time propagation. Fourier analysis of a simplified PDE transform is presented to shed light on the filter properties of high order PDE transforms. Such an analysis also offers insight on the parameter selection of the PDE transform. The proposed PDE transform algorithm is validated by numerous benchmark tests. In one selected challenging example, we illustrate the ability of PDE transform to separate two adjacent frequencies of sin(x) and sin(1.1x). Such an ability is due to PDE transform's controllable frequency localization obtained by adjusting the order of PDEs. The
Weighted inequalities for Hilbert transforms and multiplicators of Fourier transforms
Directory of Open Access Journals (Sweden)
Kokilashvili V
1997-01-01
Full Text Available As is well known, invariant operators with a shift can be bounded from into only if . We show that the case might also hold for weighted spaces. We derive the sufficient conditions for the validity of strong (weak type inequalities for the Hilbert transform when . The examples of couple of weights which guarantee the fulfillness of two-weighted strong (weak type inequalities for singular integrals are presented. The method of proof of the main results allows us to generalize the results of this paper to the singular integrals which are defined on homogeneous groups. The Fourier multiplier theorem is also proved.
Image encryption techniques based on the fractional Fourier transform
Hennelly, B. M.; Sheridan, J. T.
2003-11-01
The fractional Fourier transform, (FRT), is a generalisation of the Fourier transform which allows domains of mixed spatial frequency and spatial information to be examined. A number of method have recently been proposed in the literature for the encryption of two dimensional information using optical systems based on the FRT. Typically, these methods require random phase screen keys to decrypt the data, which must be stored at the receiver and must be carefully aligned with the received encrypted data. We have proposed a new technique based on a random shifting or Jigsaw transformation. This method does not require the use of phase keys. The image is encrypted by juxtaposition of sections of the image in various FRT domains. The new method has been compared numerically with existing methods and shows comparable or superior robustness to blind decryption. An optical implementation is also proposed and the sensitivity of the various encryption keys to blind decryption is quantified. We also present a second image encryption technique, which is based on a recently proposed method of optical phase retrieval using the optical FRT and one of its discrete counterparts. Numerical simulations of the new algorithm indicates that the sensitivity of the keys is much greater than any of the techniques currently available. In fact the sensitivity appears to be so high that optical implementation, based on existing optical signal processing technology, may be impossible. However, the technique has been shown to be a powerful method of 2-D image data encryption.
Stepwise Iterative Fourier Transform: The SIFT
Benignus, V. A.; Benignus, G.
1975-01-01
A program, designed specifically to study the respective effects of some common data problems on results obtained through stepwise iterative Fourier transformation of synthetic data with known waveform composition, was outlined. Included in this group were the problems of gaps in the data, different time-series lengths, periodic but nonsinusoidal waveforms, and noisy (low signal-to-noise) data. Results on sinusoidal data were also compared with results obtained on narrow band noise with similar characteristics. The findings showed that the analytic procedure under study can reliably reduce data in the nature of (1) sinusoids in noise, (2) asymmetric but periodic waves in noise, and (3) sinusoids in noise with substantial gaps in the data. The program was also able to analyze narrow-band noise well, but with increased interpretational problems. The procedure was shown to be a powerful technique for analysis of periodicities, in comparison with classical spectrum analysis techniques. However, informed use of the stepwise procedure nevertheless requires some background of knowledge concerning characteristics of the biological processes under study.
Krovi, Hari; Russell, Alexander
2012-01-01
Knot and link invariants naturally arise from any braided Hopf algebra. We consider the computational complexity of the invariants arising from an elementary family of finite-dimensional Hopf algebras: quantum doubles of finite groups (denoted D(G), for a group G). Regarding algorithms for these invariants, we develop quantum circuits for the quantum Fourier transform over D(G); in general, we show that when one can uniformly and efficiently carry out the quantum Fourier transform over the ce...
Institute of Scientific and Technical Information of China (English)
魏鑫宇; 冯立新; 张国艳
2012-01-01
Based on the trigonometric interpolation theory, a function is approximated by its trigonometric interpolation function. By the properties of Dirac distribution function, the analytic expressions of the Fourier transform and inverse Fourier transform for the trigonometric interpolation function are derived to approximate the Fourier transform and inverse Fourier transform for the original function. The numerical formulations for calculating the Fourier transforms and the inverse Fourier transforms of the functions with one variable and two variables are derived, respectively. Comparing with the algorithm using rectangular formula of numerical integration, the numerical examples show that the proposed method achieves higher accuracy.%基于三角插值理论,用函数的三角插值函数代替函数本身,并借助Dirac广义函数的性质写出三角插值函数的Fourier变换、逆变换的解析表达式,将之作为函数的Fourier变换、逆变换的近似.基于这种想法,分别推导一元函数、二元函数的Fourier变换和Fourier逆变换的计算公式.数值实验表明,这种方法比通常基于矩形求积公式计算连续Fourier变换、逆变换的精度要高.
Realization of quantum discrete Fourier transform with NMR
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
The pulse sequences of the logic operations used in quantum discrete Fourier transform are designed for the experiment of nuclear magnetic resonance(NMR), and 2-qubit discrete Fourier transforms are implemented experimentally with NMR. The experimental errors are examined and methods for reducing the errors are proposed.
AN ANOMALY INTRUSION DETECTION METHOD USING FOURIER TRANSFORM
Institute of Scientific and Technical Information of China (English)
Yue Bing; Zhao Yuexia; Xu Zhoujun; Fu Hongjuan; Ma Fengning
2004-01-01
A set of discrete points obtained from audit records on a behavior session is processed with Fourier transform. The criterion of selecting Fourier transform coefficients is introduced, and is used to find a unified value from the set of coefficients. This unified value is compared with a threshold to determine whether the session is abnormal. Finally simple test results are reported.
Fiber Optic Fourier Transform White-Light Interferometry
Institute of Scientific and Technical Information of China (English)
Yi Jiang; Cai-Jie Tang
2008-01-01
Fiber optic Fourier transform white-light inter-fereometry is presented to interrogate the absolute optical path difference of an Mach-Zehnder inter-ferometer. The phase change of the interferometer caused by scanning wavelength can be calculated by a Fourier transform-based phase demodulation technique. A linear output is achieved.
Multi-modal Color Medical Image Fusion Using Quaternion Discrete Fourier Transform
Nawaz, Qamar; Xiao, Bin; Hamid, Isma; Jiao, Du
2016-12-01
Multimodal image fusion is a process of combining multiple images, generated by identical or diverse imaging modalities, to get precise inside information about the same body organ. In recent years, various multimodal image fusion algorithms have been proposed to fuse medical image. However, most of them focus on fusing grayscale images. This paper proposes a novel algorithm for the fusion of multimodal color medical images. The proposed algorithm divides source images into blocks, converts each RGB block into quaternion representation and transforms them from special domain to frequency domain by applying quaternion discrete Fourier transform. The fused coefficients are obtained by calculating and comparing contrast values of corresponding coefficients in transformed blocks. The resultant fused image is reconstructed by merging all the blocks after applying inverse quaternion discrete Fourier transform on each block. Experimental evaluation demonstrates that the proposed algorithm qualitatively outperforms many existing state-of-the-art multimodal image fusion algorithms.
MULTIVARIATE FOURIER TRANSFORM METHODS OVER SIMPLEX AND SUPER-SIMPLEX DOMAINS
Institute of Scientific and Technical Information of China (English)
Jiachang Sun
2006-01-01
In this paper we propose the well-known Fourier method on some non-tensor product domains in Rd, including simplex and so-called super-simplex which consists of (d + 1)! simplices. As two examples, in 2-D and 3-D case a super-simplex is shown as a paralle lhexagon and a parallel quadrilateral dodecahedron, respectively. We have extended most of concepts and results of the traditional Fourier methods on multivariate cases, such as Fourier basis system, Fourier series, discrete Fourier transform (DFT) and its fast algorithm(FFT) on the super-simplex, as well as generalized sine and cosine transforms (DST, DCT) and related fast algorithms over a simplex. The relationship between the basic orthogonal system and eigen-functions of a Laplacian-like operator over these domains is explored.
Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes
Lin, Sian-Jheng
2016-09-13
In this paper, we present a fast Fourier transform (FFT) algorithm over extension binary fields, where the polynomial is represented in a non-standard basis. The proposed Fourier-like transform requires O(h lg(h)) field operations, where h is the number of evaluation points. Based on the proposed Fourier-like algorithm, we then develop the encoding/ decoding algorithms for (n = 2m; k) Reed-Solomon erasure codes. The proposed encoding/erasure decoding algorithm requires O(n lg(n)), in both additive and multiplicative complexities. As the complexity leading factor is small, the proposed algorithms are advantageous in practical applications. Finally, the approaches to convert the basis between the monomial basis and the new basis are proposed.
Thermal stabilization of static single-mirror Fourier transform spectrometers
Schardt, Michael; Schwaller, Christian; Tremmel, Anton J.; Koch, Alexander W.
2017-05-01
Fourier transform spectroscopy has become a standard method for spectral analysis of infrared light. With this method, an interferogram is created by two beam interference which is subsequently Fourier-transformed. Most Fourier transform spectrometers used today provide the interferogram in the temporal domain. In contrast, static Fourier transform spectrometers generate interferograms in the spatial domain. One example of this type of spectrometer is the static single-mirror Fourier transform spectrometer which offers a high etendue in combination with a simple, miniaturized optics design. As no moving parts are required, it also features a high vibration resistance and high measurement rates. However, it is susceptible to temperature variations. In this paper, we therefore discuss the main sources for temperature-induced errors in static single-mirror Fourier transform spectrometers: changes in the refractive index of the optical components used, variations of the detector sensitivity, and thermal expansion of the housing. As these errors manifest themselves in temperature-dependent wavenumber shifts and intensity shifts, they prevent static single-mirror Fourier transform spectrometers from delivering long-term stable spectra. To eliminate these shifts, we additionally present a work concept for the thermal stabilization of the spectrometer. With this stabilization, static single-mirror Fourier transform spectrometers are made suitable for infrared process spectroscopy under harsh thermal environmental conditions. As the static single-mirror Fourier transform spectrometer uses the so-called source-doubling principle, many of the mentioned findings are transferable to other designs of static Fourier transform spectrometers based on the same principle.
Institute of Scientific and Technical Information of China (English)
王本庆; 李兴国
2009-01-01
现有很多LFM信号调频斜率的分析算法,但这些算法存在诸多不足,如计算复杂、搜索时间长,对多LFM信号有交叉项等.该文提出了基于双正交Fourier变换的新LFM信号调频斜率分析算法,其特点是信号在双正交基下展开,通过变换得到信号调频斜率密度谱.该算法不需要搜索,且特别适合对不同调频斜率组成的多LFM信号进行调频斜率分析.文中推导了连续双正交Fourier变换公式和离散变换公式,并讨论了算法的一些主要性质.%There are many analysis algorithms for frequency rate of LFM signal, but those algorithms have some drawbacks, such as highly computational complexity, long time for searching, and cross-term in multi-LFM signal. In this paper, a new analysis algorithm of frequency rate of LFM signal is presented based on Biorthogonal Fourier Transform (BFT), the signal is expanded with biorthogonal base function that could be got frequency rate density spectrum of the signal. This algorithm need no searching, and has better performance for detection different frequency rate of multi-LFM signal. This paper derives continual BFT formula and discrete transform formula and discusses its some main characters.
Ordered fast fourier transforms on a massively parallel hypercube multiprocessor
Tong, Charles; Swarztrauber, Paul N.
1989-01-01
Design alternatives for ordered Fast Fourier Transformation (FFT) algorithms were examined on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end, the order and computational phases of the FFT were combined, and the sequence to processor maps that reduce communication were used. The class of ordered transforms is expanded to include any FFT in which the order of the transform is the same as that of the input sequence. Two such orderings are examined, namely, standard-order and A-order which can be implemented with equal ease on the Connection Machine where orderings are determined by geometries and priorities. If the sequence has N = 2 exp r elements and the hypercube has P = 2 exp d processors, then a standard-order FFT can be implemented with d + r/2 + 1 parallel transmissions. An A-order sequence can be transformed with 2d - r/2 parallel transmissions which is r - d + 1 fewer than the standard order. A parallel method for computing the trigonometric coefficients is presented that does not use trigonometric functions or interprocessor communication. A performance of 0.9 GFLOPS was obtained for an A-order transform on the Connection Machine.
Fractional Fourier transform of apertured paraboloid refracting system
Institute of Scientific and Technical Information of China (English)
Jiannong Chen; Jinliang Yan; Defa Wang; Yongjiang Yu
2007-01-01
The limitation of paraxial condition of paraboloid refracting system in performing fractional Fourier transform acts like an aperture, which makes the system different from ideal systems. With aperture expanded as the sum of finite complex Gaussian terms, a more practical approximate analytical solution of fractional Fourier transform of Gaussian beam in an apertured paraboloid refracting system is obtained and also numerical investigation is presented. Complicated and practical fractional Fourier transform systems can be constructed by cascading several apertured paraboloid refracting systems which are the simplest and the most basic units for performing more precise transform.
Generalized Fourier-grid R-matrix theory: a discrete Fourier-Riccati-Bessel transform approach
Energy Technology Data Exchange (ETDEWEB)
Layton, E.G. (Joint Inst. for Lab. Astrophysics, Boulder, CO (United States)); Stade, E. (Colorado Univ., Boulder, CO (United States). Dept. of Mathematics)
1993-08-28
We present the latest developments in the Fourier-grid R-matrix theory of scattering. These developments are based on the generalized Fourier-grid formalism and use a new type of extended discrete Fourier transform: the discrete Fourier-Riccati-Bessel transform. We apply this new R-matrix approach to problems of potential scattering, to demonstrate how this method reduces computational effort by incorporating centrifugal effects into the representation. As this technique is quite new, we have hopes to broaden the formalism to many types of problems. (author).
Cryogenic Scan Mechanism for Fourier Transform Spectrometer
Brasunas, John C.; Francis, John L.
2011-01-01
A compact and lightweight mechanism has been developed to accurately move a Fourier transform spectrometer (FTS) scan mirror (a cube corner) in a near-linear fashion with near constant speed at cryogenic temperatures. This innovation includes a slide mechanism to restrict motion to one dimension, an actuator to drive the motion, and a linear velocity transducer (LVT) to measure the speed. The cube corner mirror is double-passed in one arm of the FTS; double-passing is required to compensate for optical beam shear resulting from tilting of the moving cube corner. The slide, actuator, and LVT are off-the-shelf components that are capable of cryogenic vacuum operation. The actuator drives the slide for the required travel of 2.5 cm. The LVT measures translation speed. A proportional feedback loop compares the LVT voltage with the set voltage (speed) to derive an error signal to drive the actuator and achieve near constant speed. When the end of the scan is reached, a personal computer reverses the set voltage. The actuator and LVT have no moving parts in contact, and have magnetic properties consistent with cryogenic operation. The unlubricated slide restricts motion to linear travel, using crossed roller bearings consistent with 100-million- stroke operation. The mechanism tilts several arc seconds during transport of the FTS mirror, which would compromise optical fringe efficiency when using a flat mirror. Consequently, a cube corner mirror is used, which converts a tilt into a shear. The sheared beam strikes (at normal incidence) a flat mirror at the end of the FTS arm with the moving mechanism, thereby returning upon itself and compensating for the shear
Quantum process tomography of the quantum Fourier transform.
Weinstein, Yaakov S; Havel, Timothy F; Emerson, Joseph; Boulant, Nicolas; Saraceno, Marcos; Lloyd, Seth; Cory, David G
2004-10-01
The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The quantum operation studied was the quantum Fourier transform, which is important in several quantum algorithms and poses a rigorous test for the precision of our recently developed strongly modulating control fields. The results were analyzed in an attempt to decompose the implementation errors into coherent (overall systematic), incoherent (microscopically deterministic), and decoherent (microscopically random) components. This analysis yielded a superoperator consisting of a unitary part that was strongly correlated with the theoretically expected unitary superoperator of the quantum Fourier transform, an overall attenuation consistent with decoherence, and a residual portion that was not completely positive-although complete positivity is required for any quantum operation. By comparison with the results of computer simulations, the lack of complete positivity was shown to be largely a consequence of the incoherent errors which occurred over the full quantum process tomography procedure. These simulations further showed that coherent, incoherent, and decoherent errors can often be identified by their distinctive effects on the spectrum of the overall superoperator. The gate fidelity of the experimentally determined superoperator was 0.64, while the correlation coefficient between experimentally determined superoperator and the simulated superoperator was 0.79; most of the discrepancies with the simulations could be explained by the cumulative effect of small errors in the single qubit gates.
Institute of Scientific and Technical Information of China (English)
王本庆; 曾昭林
2015-01-01
针对多进制Chirp-rate调制的通信系统解调算法由于基函数的正交性差导致实现复杂且性能不佳的特点，提出采用基于双正交Fourier变换的解调算法多进制的Chirp-rate调制行正交解调，解决了不同调频率的Chirp信号相互正交的问题，解调后可以得到信号调频率密度谱。BFT算法特点是信号在双正交基下展开，对多LFM信号分析不需要搜索，没有交叉项，特别适合对不同调频斜率组成的多LFM信号进行调频斜率分析。仿真表明其基于双正交Fourier变换的多进制Chirp-rate键控调制的解调算法具有接近MFSK误码率的性能。%According to the communication system and demodulation algorithm for M-ary Chirp-rate modulation due to the orthogonality of basis functions due to poor implementation complexity and poor performance, put forward using Chirp-rate modulation demodulation algorithm for orthogonal demodulating M-ary double orthogonal Fourier transform based on Chirp, to solve the signals of different frequency rate are orthogonal, the demodulated signal was FM density spectrum. The characteristics of the BFT algorithm is carried out in two orthogonal signal, the analysis on the multi LFM signal does not need to search, no cross terms, especially suitable for the analysis of multi LFM signal modulation slope composed of different frequency rate. Simulation results show that the demodulation algorithm for M-ary biorthogonal transform Chirp-rate key Fourier modulation based on BER performance close to MFSK.
Ma, Q.; Tipping, R. H.; Lavrentieva, N. N.
2012-01-01
By adopting a concept from signal processing, instead of starting from the correlation functions which are even, one considers the causal correlation functions whose Fourier transforms become complex. Their real and imaginary parts multiplied by 2 are the Fourier transforms of the original correlations and the subsequent Hilbert transforms, respectively. Thus, by taking this step one can complete the two previously needed transforms. However, to obviate performing the Cauchy principal integrations required in the Hilbert transforms is the greatest advantage. Meanwhile, because the causal correlations are well-bounded within the time domain and band limited in the frequency domain, one can replace their Fourier transforms by the discrete Fourier transforms and the latter can be carried out with the FFT algorithm. This replacement is justified by sampling theory because the Fourier transforms can be derived from the discrete Fourier transforms with the Nyquis rate without any distortions. We apply this method in calculating pressure induced shifts of H2O lines and obtain more reliable values. By comparing the calculated shifts with those in HITRAN 2008 and by screening both of them with the pair identity and the smooth variation rules, one can conclude many of shift values in HITRAN are not correct.
Fourier Transform Mass Spectrometry: The Transformation of Modern Environmental Analyses
Directory of Open Access Journals (Sweden)
Lucy Lim
2016-01-01
Full Text Available Unknown compounds in environmental samples are difficult to identify using standard mass spectrometric methods. Fourier transform mass spectrometry (FTMS has revolutionized how environmental analyses are performed. With its unsurpassed mass accuracy, high resolution and sensitivity, researchers now have a tool for difficult and complex environmental analyses. Two features of FTMS are responsible for changing the face of how complex analyses are accomplished. First is the ability to quickly and with high mass accuracy determine the presence of unknown chemical residues in samples. For years, the field has been limited by mass spectrometric methods that were based on knowing what compounds of interest were. Secondly, by utilizing the high resolution capabilities coupled with the low detection limits of FTMS, analysts also could dilute the sample sufficiently to minimize the ionization changes from varied matrices.
Fast Fourier Transform Co-Processor (FFTC)- Towards Embedded GFLOPs
Kuehl, Christopher; Liebstueckel, Uwe; Tejerina, Isaac; Uemminghaus, Michael; Wite, Felix; Kolb, Michael; Suess, Martin; Weigand, Roland
2012-08-01
Many signal processing applications and algorithms perform their operations on the data in the transform domain to gain efficiency. The Fourier Transform Co- Processor has been developed with the aim to offload General Purpose Processors from performing these transformations and therefore to boast the overall performance of a processing module. The IP of the commercial PowerFFT processor has been selected and adapted to meet the constraints of the space environment.In frame of the ESA activity “Fast Fourier Transform DSP Co-processor (FFTC)” (ESTEC/Contract No. 15314/07/NL/LvH/ma) the objectives were the following:Production of prototypes of a space qualified version of the commercial PowerFFT chip called FFTC based on the PowerFFT IP.The development of a stand-alone FFTC Accelerator Board (FTAB) based on the FFTC including the Controller FPGA and SpaceWire Interfaces to verify the FFTC function and performance.The FFTC chip performs its calculations with floating point precision. Stand alone it is capable computing FFTs of up to 1K complex samples in length in only 10μsec. This corresponds to an equivalent processing performance of 4.7 GFlops. In this mode the maximum sustained data throughput reaches 6.4Gbit/s. When connected to up to 4 EDAC protected SDRAM memory banks the FFTC can perform long FFTs with up to 1M complex samples in length or multidimensional FFT- based processing tasks.A Controller FPGA on the FTAB takes care of the SDRAM addressing. The instructions commanded via the Controller FPGA are used to set up the data flow and generate the memory addresses.The presentation will give and overview on the project, including the results of the validation of the FFTC ASIC prototypes.
Fast Fourier Transform Co-processor (FFTC), towards embedded GFLOPs
Kuehl, Christopher; Liebstueckel, Uwe; Tejerina, Isaac; Uemminghaus, Michael; Witte, Felix; Kolb, Michael; Suess, Martin; Weigand, Roland; Kopp, Nicholas
2012-10-01
Many signal processing applications and algorithms perform their operations on the data in the transform domain to gain efficiency. The Fourier Transform Co-Processor has been developed with the aim to offload General Purpose Processors from performing these transformations and therefore to boast the overall performance of a processing module. The IP of the commercial PowerFFT processor has been selected and adapted to meet the constraints of the space environment. In frame of the ESA activity "Fast Fourier Transform DSP Co-processor (FFTC)" (ESTEC/Contract No. 15314/07/NL/LvH/ma) the objectives were the following: • Production of prototypes of a space qualified version of the commercial PowerFFT chip called FFTC based on the PowerFFT IP. • The development of a stand-alone FFTC Accelerator Board (FTAB) based on the FFTC including the Controller FPGA and SpaceWire Interfaces to verify the FFTC function and performance. The FFTC chip performs its calculations with floating point precision. Stand alone it is capable computing FFTs of up to 1K complex samples in length in only 10μsec. This corresponds to an equivalent processing performance of 4.7 GFlops. In this mode the maximum sustained data throughput reaches 6.4Gbit/s. When connected to up to 4 EDAC protected SDRAM memory banks the FFTC can perform long FFTs with up to 1M complex samples in length or multidimensional FFT-based processing tasks. A Controller FPGA on the FTAB takes care of the SDRAM addressing. The instructions commanded via the Controller FPGA are used to set up the data flow and generate the memory addresses. The paper will give an overview on the project, including the results of the validation of the FFTC ASIC prototypes.
D'Astous, Y.; Blanchard, M.
1982-05-01
In the past years, the Journal has published a number of articles1-5 devoted to the introduction of Fourier transform spectroscopy in the undergraduate labs. In most papers, the proposed experimental setup consists of a Michelson interferometer, a light source, a light detector, and a chart recorder. The student uses this setup to record an interferogram which is then Fourier transformed to obtain the spectrogram of the light source. Although attempts have been made to ease the task of performing the required Fourier transform,6 the use of computers and Cooley-Tukey's fast Fourier transform (FFT) algorithm7 is by far the simplest method to use. However, to be able to use FFT, one has to get a number of samples of the interferogram, a tedious job which should be kept to a minimum. (AIP)
Initial Results from the USNO Dispersed Fourier Transform Spectrograph
Hajian, A R; Cenko, A T; Olling, R P; Mozurkewich, D; Armstrong, J T; Pohl, B; Petrossian, S; Knuth, K H; Hindsley, R B; Murison, M; Efroimsky, M; Dantowitz, R; Kozubal, M; Currie, D G; Nordgren, T E; Tycner, C; McMillan, R S; Hajian, Arsen R.; Behr, Bradford B.; Cenko, Andrew T.; Olling, Robert P.; Mozurkewich, David; Pohl, Brian; Petrossian, Sevan; Knuth, Kevin H.; Hindsley, Robert B.; Murison, Marc; Efroimsky, Michael; Dantowitz, Ronald; Kozubal, Marek; Currie, Douglas G.; Nordgren, Tyler E.; Tycner, Christopher; Millan, Robert S. Mc
2006-01-01
We have designed and constructed a ``dispersed Fourier Transform Spectrometer'' (dFTS), consisting of a conventional FTS followed by a grating spectrometer. By combining these two devices, we negate a substantial fraction of the sensitivity disadvantage of a conventional FTS for high resolution, broadband, optical spectroscopy, while preserving many of the advantages inherent to interferometric spectrometers. In addition, we have implemented a simple and inexpensive laser metrology system, which enables very precise calibration of the interferometer wavelength scale. The fusion of interferometric and dispersive technologies with a laser metrology system yields an instrument well-suited to stellar spectroscopy, velocimetry, and extrasolar planet detection, which is competitive with existing high-resolution, high accuracy stellar spectrometers. In this paper, we describe the design of our prototype dFTS, explain the algorithm we use to efficiently reconstruct a broadband spectrum from a sequence of narrowband i...
Image restoration based on the discrete fraction Fourier transform
Yan, Peimin; Mo, Yu L.; Liu, Hong
2001-09-01
The fractional Fourier transform is the powerful tool for time-variant signal analysis. For space-variant degradation and non-stationary processes the filtering in fractional Fourier domains permits reduction of the error compared with ordinary Fourier domain filtering. In this paper the concept of filtering in fractional Fourier domains is applied to the problem of estimating degraded images. Efficient digital implementation using discrete Hermite eigenvectors can provide similar results to match the continuous outputs. Expressions for the 2D optimal filter function in fractional domains will be given for transform domains characterized by the two rotation angle parameters of the 2D fractional Fourier transform. The proposed method is used to restore images that have several degradations in the experiments. The results show that the method presented in this paper is valid.
Quantum copying and simplification of the quantum Fourier transform
Niu, Chi-Sheng
Theoretical studies of quantum computation and quantum information theory are presented in this thesis. Three topics are considered: simplification of the quantum Fourier transform in Shor's algorithm, optimal eavesdropping in the BB84 quantum cryptographic protocol, and quantum copying of one qubit. The quantum Fourier transform preceding the final measurement in Shor's algorithm is simplified by replacing a network of quantum gates with one that has fewer and simpler gates controlled by classical signals. This simplification results from an analysis of the network using the consistent history approach to quantum mechanics. The optimal amount of information which an eavesdropper can gain, for a given level of noise in the communication channel, is worked out for the BB84 quantum cryptographic protocol. The optimal eavesdropping strategy is expressed in terms of various quantum networks. A consistent history analysis of these networks using two conjugate quantum bases shows how the information gain in one basis influences the noise level in the conjugate basis. The no-cloning property of quantum systems, which is the physics behind quantum cryptography, is studied by considering copying machines that generate two imperfect copies of one qubit. The best qualities these copies can have are worked out with the help of the Bloch sphere representation for one qubit, and a quantum network is worked out for an optimal copying machine. If the copying machine does not have additional ancillary qubits, the copying process can be viewed using a 2-dimensional subspace in a product space of two qubits. A special representation of such a two-dimensional subspace makes possible a complete characterization of this type of copying. This characterization in turn leads to simplified eavesdropping strategies in the BB84 and the B92 quantum cryptographic protocols.
Security of image encryption scheme based on multi-parameter fractional Fourier transform
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2016-10-01
Recently, multi-parameter fractional Fourier transform (MPFRFT) has been widely applied in the optics cryptosystem, which has attracted more and more researchers' attention. However, in further study we find a serious security problem on the MPFRFT which is the multi-choice of decryption key corresponding to an encryption key. The existence of multi-decryption-key hinders the application of this algorithm. We present a new generalized fractional Fourier transform, which can overcome the problem and enlarge the key space. The simulation results show that the proposed algorithm has higher security and key sensitivity.
Research progress of the fractional Fourier transform in signal processing
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
The fractional Fourier transform is a generalization of the classical Fourier transform, which is introduced from the mathematic aspect by Namias at first and has many applications in optics quickly. Whereas its potential appears to have remained largely unknown to the signal processing community until 1990s. The fractional Fourier transform can be viewed as the chirp-basis expansion directly from its definition, but essentially it can be interpreted as a rotation in the time-frequency plane, i.e. the unified time-frequency transform. With the order from 0 increasing to 1, the fractional Fourier transform can show the characteristics of the signal changing from the time domain to the frequency domain. In this research paper, the fractional Fourier transform has been comprehensively and systematically treated from the signal processing point of view. Our aim is to provide a course from the definition to the applications of the fractional Fourier transform, especially as a reference and an introduction for researchers and interested readers.
Imaging Analysis by Means of Fractional Fourier Transform
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Starting from the diffraction imaging process,we have discussed the relationship between optical imaging system and fractional Fourier transform, and proposed a specific system which can form an inverse amplified image of input function.
Electro-Optic Imaging Fourier Transform Spectral Polarimeter Project
National Aeronautics and Space Administration — Boulder Nonlinear Systems, Inc. (BNS) proposes to develop an Electro-Optic Imaging Fourier Transform Spectral Polarimeter (E-O IFTSP). The polarimetric system is...
On the physical relevance of the discrete Fourier transform
CSIR Research Space (South Africa)
Greben, JM
1991-11-01
Full Text Available This paper originated from the author's dissatisfaction with the way the discrete Fourier transform is usually presented in the literature. Although mathematically correct, the physical meaning of the common representation is unsatisfactory...
Embolic Doppler ultrasound signal detection via fractional Fourier transform.
Gençer, Merve; Bilgin, Gökhan; Aydın, Nizamettin
2013-01-01
Computerized analysis of Doppler ultrasound signals can aid early detection of asymptomatic circulating emboli. For analysis, physicians use informative features extracted from Doppler ultrasound signals. Time -frequency analysis methods are useful tools to exploit the transient like signals such as Embolic signals. Detection of discriminative features would be the first step toward automated analysis of embolic Doppler ultrasound signals. The most problematic part of setting up emboli detection system is to differentiate embolic signals from confusing similar wave-like patterns such as Doppler speckle and artifacts caused by tissue movement, probe tapping, speaking etc. In this study, discrete version of fractional Fourier transform is presented as a solution in the detection of emboli in digitized Doppler ultrasound signals. An accurate set of parameters are extracted using short time Fourier transform and fractional Fourier transform and the results are compared to reveal detection quality. Experimental results prove the efficiency of fractional Fourier transform in which discriminative features becomes more evident.
Gerchberg-Papoulis algorithm and the finite Zak transform
Brodzik, Andrzej K.; Tolimieri, Richard
2000-12-01
We propose a new, time-frequency formulation of the Gerchberg-Papoulis algorithm for extrapolation of band- limited signals. The new formulation is obtained by translating the constituent operations of the Gerchberg- Papoulis procedure, the truncation and the Fourier transform, into the language of the finite Zak transform, a time-frequency tool intimately related to the Fourier transform. We will show that the use of the Zak transform results in a significant reduction of the computational complexity of the Gerchberg-Papoulis procedure and in an increased flexibility of the algorithm.
Marko, H.
1978-01-01
A general spectral transformation is proposed and described. Its spectrum can be interpreted as a Fourier spectrum or a Laplace spectrum. The laws and functions of the method are discussed in comparison with the known transformations, and a sample application is shown.
Simple optical setup implementation for digital Fourier transform holography
Energy Technology Data Exchange (ETDEWEB)
De Oliveira, G N [Pos-graduacao em Engenharia Mecanica, TEM/PGMEC, Universidade Federal Fluminense, Rua Passo da Patria, 156, Niteroi, R.J., Cep.: 24.210-240 (Brazil); Rodrigues, D M C; Dos Santos, P A M, E-mail: pams@if.uff.br [Instituto de Fisica, Laboratorio de Optica Nao-linear e Aplicada, Universidade Federal Fluminense, Av. Gal. Nilton Tavares de Souza, s/n, Gragoata, Niteroi, R.J., Cep.:24.210-346 (Brazil)
2011-01-01
In the present work a simple implementation of Digital Fourier Transform Holography (DFTH) setup is discussed. This is obtained making a very simple modification in the classical setup arquiteture of the Fourier Transform holography. It is also demonstrated the easy and practical viability of the setup in an interferometric application for mechanical parameters determination. The work is also proposed as an interesting advanced introductory training for graduated students in digital holography.
Fourier transform spectroscopy in the visible and ultraviolet range.
Luc, P; Gerstenkorn, S
1978-05-01
In cases where the photon noise is the limiting factor, the multiplex gain is not always conserved; however the throughput (Jacquinot's advantage) is not affected. Therefore extension of Fourier transform spectroscopy to higher frequencies has great possibilities. Studies at high resolution, both in emission and in absorption, show that the performance achieved by Fourier transform spectroscopy in the visible and uv range is comparable with that reached in the ir.
Fast Inverse Nonlinear Fourier Transform For Generating Multi-Solitons In Optical Fiber
Wahls, Sander
2015-01-01
The achievable data rates of current fiber-optic wavelength-division-multiplexing (WDM) systems are limited by nonlinear interactions between different subchannels. Recently, it was thus proposed to replace the conventional Fourier transform in WDM systems with an appropriately defined nonlinear Fourier transform (NFT). The computational complexity of NFTs is a topic of current research. In this paper, a fast inverse NFT algorithm for the important special case of multi-solitonic signals is presented. The algorithm requires only $\\mathcal{O}(D\\log^{2}D)$ floating point operations to compute $D$ samples of a multi-soliton. To the best of our knowledge, this is the first algorithm for this problem with $\\log^{2}$-linear complexity. The paper also includes a many samples analysis of the generated nonlinear Fourier spectra.
A Synthetic Quadrature Phase Detector/Demodulator for Fourier Transform Transform Spectrometers
Campbell, Joel
2008-01-01
A method is developed to demodulate (velocity correct) Fourier transform spectrometer (FTS) data that is taken with an analog to digital converter that digitizes equally spaced in time. This method makes it possible to use simple low cost, high resolution audio digitizers to record high quality data without the need for an event timer or quadrature laser hardware, and makes it possible to use a metrology laser of any wavelength. The reduced parts count and simplicity implementation makes it an attractive alternative in space based applications when compared to previous methods such as the Brault algorithm.
Rotation-invariant texture analysis using Radon and Fourier transforms
Institute of Scientific and Technical Information of China (English)
Songshan Xiao; Yongxing Wu
2007-01-01
@@ Texture analysis is a basic issue in image processing and computer vision, and how to attain the rotationinvariant texture characterization is a key problem. This paper proposes a rotation-invariant texture analysis technique using Radon and Fourier transforms. This method uses Radon transform to convert rotation to translation, then utilizes Fourier transform and takes the moduli of the Fourier transform of these functions to make the translation invariant. A k-nearest-neighbor rule is employed to classify texture images. The proposed method is robust to additive white noise as a result of summing pixel values to generate projections in the Radon transform step. Experiment results show the feasibility of the proposed method and its robustness to additive white noise.
Optimal Padding for the Two-Dimensional Fast Fourier Transform
Dean, Bruce H.; Aronstein, David L.; Smith, Jeffrey S.
2011-01-01
One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that
Dynamic measurement of deformation using Fourier transform digital holographic interferometry
Gao, Xinya; Wu, Sijin; Yang, Lianxiang
2013-10-01
Digital holographic interferometry (DHI) is a well-established optical technique for measurement of nano-scale deformations. It has become more and more important due to the rapid development of applications in aerospace engineering and biomedicine. Traditionally, phase shift technique is used to quantitatively measure the deformations in DHI. However, it cannot be applied in dynamic measurement. Fourier transform phase extraction method, which can determine the phase distribution from only a single hologram, becomes a promising method to extract transient phases in DHI. This paper introduces a digital holographic interferometric system based on 2D Fourier transform phase extraction method, with which deformations of objects can be measured quickly. In the optical setup, the object beam strikes a CCD via a lens and aperture, and the reference beam is projected on the CCD through a single-mode fiber. A small inclination angle between the diverging reference beam and optical axial is introduced in order to physically separate the Fourier components in frequency domain. Phase maps are then obtained by the utilization of Fourier transform and windowed inverse Fourier transform. The capability of the Fourier transform DHI is discussed by theoretical discussion as well as experiments.
Imaginary angle fractional Fourier transform and its optical implementation
Institute of Scientific and Technical Information of China (English)
华建文; 刘立人; 李国强
1997-01-01
The concept of imaginary angle fractional Fourier transform is proposed. Its existence and additive operation are proved. With this concept, FRT is expanded to the optical transform of convex lens outside the range of double focal length and that of concave lens.
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
A new method of resolving overlapped peak, Fourier self-deconvolution (FSD) using approximation CN obtained from frequency domain wavelet transform of F(ω) yielded by Fourier transform of overlapped peak signals f(t) as the linear function, was presented in this paper.Compared with classical FSD, the new method exhibits excellent resolution for different overlapped peak signals such as HPLC signals, and have some characteristics such as an extensive applicability for any overlapped peak shape signals and a simple operation because of no selection procedure of the linear function. Its excellent resolution for those different overlapped peak signals is mainly because F(ω) obtained from Fourier transform of f(t) and CN obtained from wavelet transform of F(ω) have the similar linearity and peak width. The effect of those fake peaks can be eliminated by the algorithm proposed by authors. This method has good potential in the process of different overlapped peak signals.
[Analysis of cell arrangements in Biota orientalis using Fourier transformation].
Duo, Hua-Qiong; Wang, Xi-Ming
2009-10-01
Fourier transform image-processing technology is applied for determining the cross section cell arrangement of early-wood in Biota orientalis. In this method, the disc-convoluted dot map from each cell radius with 10 pixels is transformed by Fourier transform, generating the angle distribution function in the power spectral pattern. The maximum value is the arrangement of the cell. The results of Fourier transform image-processing technology indicated that the arrangements of the cell of Biota orientalis are 15 degrees in oblique direction, respectively. This method provides a new basis for the digitized identification of the wood, and also the new theoretical research direction for the digitized identification and examination of the wood species.
Wuttke, Joachim
2009-01-01
An algorithm is described for computing the Laplace transform (one-sided Fourier sine and cosine transform) of the stretched (or compressed) exponential function exp(-t^beta) (also known as Kohlrausch-Williams-Watts function, as characteristic function of a Levy stable distribution, or as complementary cumulative Weibull distribution) for exponents beta between 0.1 and 2. For low and high frequencies, the well-known series expansions are used; for intermediate frequencies, the explicit integration is strongly accelerated by the Ooura-Mori double exponential transformation. The algorithm is implemented in C as library libkww. The source code is available at http://www.messen-und-deuten.de/kww
DEFF Research Database (Denmark)
Clausen, Sønnik; Morgenstjerne, Axel; Rathmann, Ole
1996-01-01
Surface temperatures are estimated with high precision based on a multitemperature method for Fourier-transform spectrometers. The method is based on Planck's radiation law and a nonlinear least-squares fitting algorithm applied to two or more spectra at different sample temperatures and a single...
Electro-Optical Imaging Fourier-Transform Spectrometer
Chao, Tien-Hsin; Zhou, Hanying
2006-01-01
An electro-optical (E-O) imaging Fourier-transform spectrometer (IFTS), now under development, is a prototype of improved imaging spectrometers to be used for hyperspectral imaging, especially in the infrared spectral region. Unlike both imaging and non-imaging traditional Fourier-transform spectrometers, the E-O IFTS does not contain any moving parts. Elimination of the moving parts and the associated actuator mechanisms and supporting structures would increase reliability while enabling reductions in size and mass, relative to traditional Fourier-transform spectrometers that offer equivalent capabilities. Elimination of moving parts would also eliminate the vibrations caused by the motions of those parts. Figure 1 schematically depicts a traditional Fourier-transform spectrometer, wherein a critical time delay is varied by translating one the mirrors of a Michelson interferometer. The time-dependent optical output is a periodic representation of the input spectrum. Data characterizing the input spectrum are generated through fast-Fourier-transform (FFT) post-processing of the output in conjunction with the varying time delay.
Methods of theme presentation "The Fourier transform of impulse functions"
Directory of Open Access Journals (Sweden)
Faniya Ahmetova
2016-09-01
Full Text Available The paper considers the Fourier transform of impulse functions, which is the mathematical basis of the tasks associated with the theory of reception and signal conversion in optoelectronic system. The method of calculating of two functions convolution, its Fourier image and the image of the Fourier-Bessel axisymmetric functions are demonstrated in details. A table, which summarizes the analytical expression for the shifted impulse functions and records their Fourier transforms, is provided. A wide range of examples of solving tasks, containing the graphic illustration, is analyzed. A structured approach to the presentation of the material, which combines basic theoretical information and analysis of typical tasks, will help second-year students of optoelectronic specialty in their independent work and homework.
Fractional Fourier Transform Applied to Digital Images Encryption
Vilardy, Juan M.; Torres, Cesar O.; Mattos, Lorenzo
2008-04-01
In the present paper a digital algorithm was developed to make phase encryption of digital indexed images to color using the fractional Fourier transform (the images in RGB are converted to indexed before to encrypt). The indexed images are represented by a matrix of M×N pixels (where M defines the height and N is the Width of the image) and a color map (it's a matrix of C×3 elements, where C indicates the colors number of the image and the number 3 indicates the three columns associated with the color components: Red, Green and Blue of each pixel of the matrix of M×N) associated to the matrix of pixels to suitably represent the color information of the image. The indexed image (matrix of M×N pixels) to encrypt is placed as the phase of a complex exponential, then is transformed three times and multiplied in intermediate steps by two random phase masks statistically independent thus to obtain the encrypted image, for decrypt the coding image the encryption procedure is applied in the inverse sense to the conjugated complex of the encrypted image, then is taken the negative of the phase of the resulting function of the decryption process and the original image is obtained this way that had been encrypted; For the color map equal procedure is applied in the encryption/decryption process described previously for the matrix of M×N pixels. In the implemented cryptographic algorithm five keys are used, constituted by three fractional orders and two random phase masks, all these keys are necessary for a correct decryption providing a dependability to the transference of images by means of the communications nets.
Double-resolution electron holography with simple Fourier transform of fringe-shifted holograms.
Volkov, V V; Han, M G; Zhu, Y
2013-11-01
We propose a fringe-shifting holographic method with an appropriate image wave recovery algorithm leading to exact solution of holographic equations. With this new method the complex object image wave recovered from holograms appears to have much less traditional artifacts caused by the autocorrelation band present practically in all Fourier transformed holograms. The new analytical solutions make possible a double-resolution electron holography free from autocorrelation band artifacts and thus push the limits for phase resolution. The new image wave recovery algorithm uses a popular Fourier solution of the side band-pass filter technique, while the fringe-shifting holographic method is simple to implement in practice.
VLSI Implementation of Digital Fourier Transforms.
1982-11-01
23) which , coplte the proofi .t)0 !/*!, R,.),ta , ’,.[ ](5 ".: - 10- We now look at the structure of Theorem 1 for three cases. Cow 1: n -k = k...phase devices have reasonable signal ban- dung capabilities. From three phases on up the signal handling is very good, but the problem of routing all...Tompsett, Choarge Transfer Demices, Academic Press Inc. (1975). 4. J. W. Cooley and J. W. Tukey, "An Algorithm for the Machine Calculation of Complex
Three-dimensional radiative transfer using a Fourier-transform matrix-operator method
Martonchik, J. V.; Diner, D. J.
1985-01-01
The three-dimensional equation of transfer for a scattering medium with planar geometry is solved by using a spatial Fourier transform and extending matrix-operator techniques developed previously for the one-dimensional equation. Doubling and adding algorithms were derived by means of an interaction principle for computing the Fourier-transformed radiation field. The resulting expressions fully describe the radiative transfer process in a scattering medium, inhomogeneous in the x-, y- and z-directions, illuminated from above by an arbitrarily general intensity field and bounded from below by a surface with completely general reflection properties.
COMPARISON OF FOURIER AND WAVELET TRANSFORMS IN GEOPHYSICAL APPLICATIONS
Directory of Open Access Journals (Sweden)
Hakan ALP
2008-01-01
Full Text Available In this study, it was compared Fourier Transformation using widely in analysing of geophysics data and image processing and Wavelet Transformation using in image processing, boundary analysis and recently years in use geophysical data analysis. It was applicated and compared two transformations in the both geophysical data and fundamental functions. Then the results obtained were evaluated. In this study it was compared two transformation using earthquake records and Bouger gravity anomalies map of Hatay region geophysical data. At the end of the our study it was clearly seen that wavelet transform can be used by geophysical data analysing.
Energy Technology Data Exchange (ETDEWEB)
Rodriguez G, A.; Bowtell, R.; Mansfield, P. [Area de Procesamiento Digital de Senales e Imagenes Biomedicas. Universidad Autonoma Metropolitana Iztapalapa. Mexico D.F. 09340 Mexico (Mexico)
1998-12-31
Velocity maps were studied combining Doyle and Mansfield method (1986) with each of the following transforms: Fourier, window Fourier and wavelet (Mexican hat). Continuous wavelet transform was compared against the two Fourier transform to determine which technique is best suited to study blood maps generated by Half Fourier Echo-Planar Imaging. Coefficient images were calculated and plots of the pixel intensity variation are presented. Finally, contour maps are shown to visualize the behavior of the blood flow in the cardiac chambers for the wavelet technique. (Author)
The Formalization of Discrete Fourier Transform in HOL
Directory of Open Access Journals (Sweden)
Zhiping Shi
2015-01-01
Full Text Available Traditionally, Discrete Fourier Transform (DFT is performed with numerical or symbolic computation, which cannot guarantee 100% accurate analysis which may be necessary for safety-critical applications. Machine theorem proving is one of the formal methods that perform accurate analysis with completeness to some extent. This paper proposes the formalization of DFT in a higher-order logic theorem prover named HOL. We propose the formal definition of DFT and verify the fundamental properties of DFT. Two case studies are presented to illustrate usefulness and correctness of the formalized DFT, including formal verifications of Fast Fourier Transform (FFT and cosine frequency shift.
Fourier transform infrared spectra applications to chemical systems
Ferraro, John R
1985-01-01
The final and largest volume to complete this four-volume treatise is published in response to the intense commercial and research interest in Fourier Transform Interferometry.Presenting current information from leading experts in the field, Volume 4 introduces new information on, for example, applications of Diffuse Reflectance Spectroscopy in the Far-Infrared Region. The editors place emphasis on surface studies and address advances in Capillary Gas Chromatography - Fourier Transform Interferometry.Volume 4 especially benefits spectroscopists and physicists, as well as researchers
Recording Fractional Fourier Transform Hologram Using Holographic Zone Plate
Institute of Scientific and Technical Information of China (English)
高峰; 曾阳素; 张怡霄; 杨静; 高福华; 郭永康
2002-01-01
FRTH(fractional Fourier transform hologram) is a new kind of hologram that differs from common Fresnel holograms and Fourier transform holograms. Due to the flexibility of zone plate. A method that uses the -1 order diffraction wave of zone plate as the object wave and the 0 order diffraction wave as the reference wave to record FRTH is presented. It provides a new simple way to record FRTH. In this paper, the theory of achieving FRT and recording FRTH using holographic zone plate is presented and experimental results are given.
Multifractional Fourier Transform Method and Its Applications to Image Encryption
Institute of Scientific and Technical Information of China (English)
RANQiwen; WANGQi; MAJing; TANLiying
2003-01-01
The multiplicity of the fractional Fourier transform(FRFT),which is intrinsic in any fractional operator,has been claimed by several authors,but never across-the-board developed.Particularly,the weight-type FRFT(WFRFT) has not been investigated.Starting with defining the multifractional Fourier transform (MFRFT),we gained the generalization permutation matrix group (GPMG)representation and multiplicity of the MFRFT,and the relationships among the MFRFT the standard WFRFT and the standard CFRFT.Finally,as a application,a novel image encryption method hased on the MFRFT is propounded.Similation results show that this method is safe,practicable and impactful.
Fourier-transform and global contrast interferometer alignment methods
Goldberg, Kenneth A.
2001-01-01
Interferometric methods are presented to facilitate alignment of image-plane components within an interferometer and for the magnified viewing of interferometer masks in situ. Fourier-transforms are performed on intensity patterns that are detected with the interferometer and are used to calculate pseudo-images of the electric field in the image plane of the test optic where the critical alignment of various components is being performed. Fine alignment is aided by the introduction and optimization of a global contrast parameter that is easily calculated from the Fourier-transform.
Fourier transform infrared spectra applications to chemical systems
Ferraro, John R
1978-01-01
Fourier Transform Infrared Spectroscopy: Applications to Chemical Systems presents the chemical applications of the Fourier transform interferometry (FT-IR).The book contains discussions on the applications of FT-IR in the fields of chromatography FT-IR, polymers and biological macromolecules, emission spectroscopy, matrix isolation, high-pressure interferometry, and far infrared interferometry. The final chapter is devoted to the presentation of the use of FT-IR in solving national technical problems such as air pollution, space exploration, and energy related subjects.Researc
Resource requirements for a fault-tolerant quantum Fourier transform
Goto, Hayato; Nakamura, Satoshi; Kujiraoka, Mamiko; Ichimura, Kouichi
2015-03-01
The quantum Fourier transform (QFT) is a basic subroutine for most quantum algorithms providing an exponential speedup over classical ones. We investigate resource requirements for a fault-tolerant QFT. To implement single-qubit rotations for a QFT in a fault-tolerant manner, we examine three types of approaches: ancilla-free gate synthesis, ancilla-assisted gate synthesis, and state distillation. While the gate synthesis approximates single-qubit rotations with basic quantum operations, the state distillation enables to perform specific single-qubit rotations required for the QFT exactly. It is unknown, however, which approach is better for the QFT. We estimated the resource requirement for a QFT in each case, where the resource is measured by the total number of the π / 8 gates denoted by T, which is called the T count. Contrary to the initial expectation, the total T count for the state distillation is considerably larger than those for the ancilla-free and ancilla-assisted gate synthesis. Thus, we conclude that the ancilla-assisted gate synthesis is the best for a fault-tolerant QFT so far.
Fourier transform infrared microspectroscopy and multivariate methods for radiobiological dosimetry.
Meade, A D; Clarke, C; Byrne, H J; Lyng, F M
2010-02-01
The scientific literature contains an ever-growing number of reports of applications of vibrational spectroscopy as a multivariate non-invasive tool for analysis of biological effects at the molecular level. Recently, Fourier transform infrared microspectroscopy (FTIRM) has been demonstrated to be sensitive to molecular events occurring in cells and tissue after exposure to ionizing radiation. In this work the application of FTIRM in the examination of dose-dependent molecular effects occurring in skin cells after exposure to ionizing radiation with the use of partial least-squares regression (PLSR) and generalized regression neural networks (GRNN) was studied. The methodology is shown to be sensitive to molecular events occurring with radiation dose and time after exposure. The variation in molecular species with dose and time after irradiation is shown to be non-linear by virtue of the higher modeling efficiency yielded from the non-linear algorithms. Dose prediction efficiencies of approximately +/-10 mGy were achieved at 96 h after irradiation, highlighting the potential applications of the methodology in radiobiological dosimetry.
High-resolution wide-band Fast Fourier Transform spectrometers
Klein, Bernd; Krämer, Ingo; Bell, Andreas; Meyer, Klaus; Güsten, Rolf
2012-01-01
We describe the performance of our latest generations of sensitive wide-band high-resolution digital Fast Fourier Transform Spectrometer (FFTS). Their design, optimized for a wide range of radio astronomical applications, is presented. Developed for operation with the GREAT far infrared heterodyne spectrometer on-board SOFIA, the eXtended bandwidth FFTS (XFFTS) offers a high instantaneous bandwidth of 2.5 GHz with 88.5 kHz spectral resolution and has been in routine operation during SOFIA's Basic Science since July 2011. We discuss the advanced field programmable gate array (FPGA) signal processing pipeline, with an optimized multi-tap polyphase filter bank algorithm that provides a nearly loss-less time-to-frequency data conversion with significantly reduced frequency scallop and fast sidelobe fall-off. Our digital spectrometers have been proven to be extremely reliable and robust, even under the harsh environmental conditions of an airborne observatory, with Allan-variance stability times of several 1000 se...
Institute of Scientific and Technical Information of China (English)
熊坤来; 罗景青
2012-01-01
利用多相码雷达信号在某个分数阶域内呈现多个间隔相等的冲击这一特性,提出了一种基于分数阶Fourier变换的多相码雷达信号分离算法,首先将混合信号以特定的旋转角作分数阶Fourier变换,然后通过窄带通滤波器抽取多相码雷达信号,去除大量噪声和其他干扰信号,最后再经过分数阶Fourier反变换,恢复出时域的多相码雷达信号.理论分析和仿真实验表明,该算法计算量小,分离效果好,可实现较低信噪比下的多相码雷达信号分离.%By using the characteristics of poly-phase code radar signals that its energy are concentrated in one fractional domain, a separation algorithm of poly-phase code radar signals based on fractional Fourier transform (FrFT) is proposed in this paper. First, a mixed signal is rotated to a certain angle by the FrFT. Then, a narrow band filter is exploited to extract the poly-phase code radar signal and depress most of noise and other signals. Finally, the poly-phase code radar signal is rotated back to the time domain by the inverse FrFT. The theoretical analysis and simulation results demonstrate the validity of the method.
Discrete Fourier Transform in a Complex Vector Space
Dean, Bruce H. (Inventor)
2015-01-01
An image-based phase retrieval technique has been developed that can be used on board a space based iterative transformation system. Image-based wavefront sensing is computationally demanding due to the floating-point nature of the process. The discrete Fourier transform (DFT) calculation is presented in "diagonal" form. By diagonal we mean that a transformation of basis is introduced by an application of the similarity transform of linear algebra. The current method exploits the diagonal structure of the DFT in a special way, particularly when parts of the calculation do not have to be repeated at each iteration to converge to an acceptable solution in order to focus an image.
Fully phase encrypted memory using cascaded extended fractional Fourier transform
Nishchal, Naveen K.; Joseph, Joby; Singh, Kehar
2003-11-01
In this paper, we implement a fully phase encrypted memory system using cascaded extended fractional Fourier transform (FRT). We encrypt and decrypt a two-dimensional image obtained from an amplitude image. The fully phase image to be encrypted is fractional Fourier transformed three times and random phase masks are placed in the two intermediate planes. Performing the FRT three times increases the key size, at an added complexity of one more lens. The encrypted image is holographically recorded in a photorefractive crystal and is then decrypted by generating through phase conjugation, conjugate of encrypted image. The decrypted phase image is converted into an amplitude image by using phase contrast technique. A lithium niobate crystal has been used as a phase contrast filter to reconstruct the phase image, alleviating the need of alignment in the Fourier plane, thereby making the system rugged.
Fourier and Hadamard transform spectrometers - A limited comparison
Tai, M. H.; Harwit, M.
1976-01-01
An encoding figure of merit is established for a detector-noise limited Fourier transform spectrometer (FTS) and compared to the comparable figure for a Hadamard transform spectrometer (HTS). The limitation of the Fourier system is partly that it does not truly Fourier analyze the radiation. Instead a cosine squared modulation is imposed on the different spectral frequencies. An additional difficulty is that neither the cosine nor the cosine squared functions form an orthonormal set. This makes the Fellgett's advantage (root-mean-squared figure of merit) for a single detector Michelson interferometer a factor of the square root of (N/8) greater than for a conventional grating instrument - rather than the square root of (N/2). The theoretical limit would be the square root of N.
Application of fast Fourier transformation in thermoluminescence thermogram reconstruction
Pla, C.; Podgorsak, E. B.
1984-03-01
A thermoluminescence (TL) thermogram reconstruction technique based on fast Fourier transformation (FFT) techniques is presented. Only the first few terms of the real and imaginary ``frequency arrays,'' representing the thermogram in the frequency domain, are used for thermogram reconstruction by an inverse transformation. A method to determine the optimum number of FFT terms is discussed and a reconstruction study performed on six commonly used TL materials.
Institute of Scientific and Technical Information of China (English)
陈鹏; 侯朝焕; 马晓川; 梁亦慧
2008-01-01
各种离散分数阶傅立叶变换DFRFT(Discrete Fractional Fourier Transform)算法的发展促进了分数阶傅立叶变换FRFT(Fractional Fourier Transform)在数字信号处理领域的应用.本文首先介绍了FRFT的定义和特性,并给出了几种DFRFT计算方法的比较.在对Ozaktas提出的DFRFT快速算法理论分析基础上,本文给出了基于TMS320C6201定点数字信号处理器DSP(Digital Signal Processor)的快速算法详细实现.该详细充分利用FFT计算和数学处理来有效降低算法的运算量.
SPICA/SAFARI fourier transform spectrometer mechanism evolutionary design
Dool, T.C. van den; Kruizinga, B.; Braam, B.C.; Hamelinck, R.F.M.M.; Loix, N.; Loon, D. van; Dams, J.
2012-01-01
TNO, together with its partners, have designed a cryogenic scanning mechanism for use in the SAFARI Fourier Transform Spectrometer (FTS) on board of the SPICA mission. SPICA is one of the M-class missions competing to be launched in ESA's Cosmic Vision Programme in 2022. JAXA leads the development o
Optical correlation based on the fractional Fourier transform.
Granieri, S; Arizaga, R; Sicre, E E
1997-09-10
Some properties of optical correlation based on the fractional Fourier transform are analyzed. For a particular set of fractional orders, a filter is obtained that becomes insensitive to scale variations of the object. An optical configuration is also proposed to carry out the fractional correlation in a flexible way, and some experimental results are shown.
Coupling of column liquid chromatography and Fourier transform infrared spectrometry
Somsen, G.W; Gooijer, C; Velthorst, N.H; Brinkman, U.A Th
1998-01-01
This paper provides an extensive overview of the literature on the coupling of column liquid chromatography (LC) and Fourier transform infrared spectrometry (FT-IR). Flow-cell-based FT-IR detection and early solvent-elimination interfaces for LC-FT-IR are discussed in brief. A comprehensive descript
Quantum Discrete Fourier Transform in an Ion Trap System
Institute of Scientific and Technical Information of China (English)
ZHENG Shi-Biao
2007-01-01
We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap system. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementation of the schemes would be an important step toward complex quantum computation in the ion trap system.
Fourier transformation methods in the field of gamma spectrometry
Indian Academy of Sciences (India)
A Abdel-Hafiez
2006-09-01
The basic principles of a new version of Fourier transformation is presented. This new version was applied to solve some main problems such as smoothing, and denoising in gamma spectroscopy. The mathematical procedures were first tested by simulated data and then by actual experimental data.
Quaternion Fourier transforms for signal and image processing
Ell, Todd A; Sangwine, Stephen J
2014-01-01
Based on updates to signal and image processing technology made in the last two decades, this text examines the most recent research results pertaining to Quaternion Fourier Transforms. QFT is a central component of processing color images and complex valued signals. The book's attention to mathematical concepts, imaging applications, and Matlab compatibility render it an irreplaceable resource for students, scientists, researchers, and engineers.
AN ASYMPTOTIC ORDER OF FOURIER TRANSFORM ON SL(2,R)
Institute of Scientific and Technical Information of China (English)
Wang Xinsong; Zheng Weixing
2003-01-01
In this paper, a better asymptotic order of Fourier transform on SL(2 ,R) is obtained by using classicalanalysis and Lie analysis comparing with that of [5]、 [6], and the Plancherel theorem on Cc2 (SL (2, R)) isalso obtained as an application.
Simplification of multiple Fourier series - An example of algorithmic approach
Ng, E. W.
1981-01-01
This paper describes one example of multiple Fourier series which originate from a problem of spectral analysis of time series data. The example is exercised here with an algorithmic approach which can be generalized for other series manipulation on a computer. The generalized approach is presently pursued towards applications to a variety of multiple series and towards a general purpose algorithm for computer algebra implementation.
Institute of Scientific and Technical Information of China (English)
陈家杰; 李会元; 张先轶
2012-01-01
In this paper, we study the parallel algorithm based on CUDA and MPI for the Fast Fourier Transform on the hexagon (FFTH) and its implementation. Firstly, we design a CUDA FFTH algorithm by utilizing the hierachical parallelization mechanism and the build-in CUFFT library for classic rectangular FFTs. With respect to the serial cpu program, our CUDA program achieves 12x speedup for 3 × 20482 double-precision complex-to-complex FFTH. If we ignore the PCI between main memory and GPU device memory, around 30x-40x speedup can be even achieved. Although the non-tensorial FFTH is much more complicated than the rectangular FFT, our CUDA FFTH program gains the same efficiency as the rectangular CUFFT. Next, efforts are mainly contributed to optimization techniques for parallel array transposition and data sorting, which significantly improve the efficiency of the CUDA-MPI FFTH algorithm. On a 10-node cluster with 60 GPUs, our CUDA-MPI program achieves about 55x speedup with respect to the the serial cpu program for 3 × 81922 complex-to-complex double-precision FFTH, and it is more efficient than the MPI parallel FFTW. Our research on the CUDA-MPI algorithm for FFTH is beneficial to the exploration and development of new parallel algorithms on large-scale CPU-GPU heterogeneous computer systems.%本文研究六边形区域上快速傅里叶变换(FFTH)的CUDA-MPI算法及其实现.首先,我们通过充分利用CUDA的层次化并行机制及其库函数,设计了FFTH的高效率的CUDA算法.对于规模为3×20482的双精度复数类型数据,我们设计的CUDA程序与CPU串行程序相比可以达到12倍加速比,如果不计内存和显存之间的数据传输,则加速比可达40倍;其计算效率与CUFFT所提供的二维方形区域FFT程序的效率基本一致.在此基础上,我们通过研究GPU上分布式并行数据的转置与排序算法,优化设计了FFTH的CUDA-MPI算法.在3×81922的数据规模、10节点×6GPU的计算环境下,我们的CUDA
Quasi- Chun- Ching Shih's Fractional Fourier Transform with Periodicity of 2,3 and M
Institute of Scientific and Technical Information of China (English)
FAN Xi-zhi
2004-01-01
Based on Chun-Ching Shih's idea, the basic transform was substituted and the quasi-ChunChing Shih's fractional Fourier transform with periodicity of 2, 3 and M was deduced. The two former transforms and the Chun-Ching Shih's fractional Fourier transform were only the particular cases of quasiChun-Ching Shih's fractional Fourier transform with periodicity of M.
Grimm, C. A.
This document contains two units that examine integral transforms and series expansions. In the first module, the user is expected to learn how to use the unified method presented to obtain Laplace transforms, Fourier transforms, complex Fourier series, real Fourier series, and half-range sine series for given piecewise continuous functions. In…
On the finite Fourier transforms of functions with infinite discontinuities
Directory of Open Access Journals (Sweden)
Branko Saric
2002-01-01
Full Text Available The introductory part of the paper is provided to give a brief review of the stability theory of a matrix pencil for discrete linear time-invariant singular control systems, based on the causal relationship between Jordan's theorem from the theory of Fourier series and Laurent's theorem from the calculus of residues. The main part is concerned with the theory of the integral transforms, which has proved to be a powerful tool in the control systems theory. On the basis of a newly defined notion of the total value of improper integrals, throughout the main part of the paper, an attempt has been made to present the global theory of the integral transforms, which are slightly more general with respect to the Laplace and Fourier transforms. The paper ends with examples by which the results of the theory are verified.
An introduction to Laplace transforms and Fourier series
Dyke, Phil
2014-01-01
Laplace transforms continue to be a very important tool for the engineer, physicist and applied mathematician. They are also now useful to financial, economic and biological modellers as these disciplines become more quantitative. Any problem that has underlying linearity and with solution based on initial values can be expressed as an appropriate differential equation and hence be solved using Laplace transforms. In this book, there is a strong emphasis on application with the necessary mathematical grounding. There are plenty of worked examples with all solutions provided. This enlarged new edition includes generalised Fourier series and a completely new chapter on wavelets. Only knowledge of elementary trigonometry and calculus are required as prerequisites. An Introduction to Laplace Transforms and Fourier Series will be useful for second and third year undergraduate students in engineering, physics or mathematics, as well as for graduates in any discipline such as financial mathematics, econometrics and ...
Ultrafast ranging lidar based on real-time Fourier transformation.
Xia, Haiyun; Zhang, Chunxi
2009-07-15
Real-time Fourier-transformation-based ranging lidar using a mode-locked femtosecond fiber laser is demonstrated. The object signal and the reference signal are guided from a fiber Mach-Zehnder interferometer into a dispersive element. The two optical pulses extend and overlap with each other temporally, which yields a microwave pulse on the photodetector with its frequency proportional to the time delay between the two signals. The temporal interferograms are transformed from the time domain into the frequency domain using a time-to-frequency conversion function obtained in the calibration process. The Fourier transform is used in the data processing. A range resolution of 334 nm at a sampling rate of 48.6 MHz over a distance of 16 cm is demonstrated in the laboratory.
Transfer Functions Via Laplace- And Fourier-Borel Transforms
Can, Sumer; Unal, Aynur
1991-01-01
Approach to solution of nonlinear ordinary differential equations involves transfer functions based on recently-introduced Laplace-Borel and Fourier-Borel transforms. Main theorem gives transform of response of nonlinear system as Cauchy product of transfer function and transform of input function of system, together with memory effects. Used to determine responses of electrical circuits containing variable inductances or resistances. Also possibility of doing all noncommutative algebra on computers in such symbolic programming languages as Macsyma, Reduce, PL1, or Lisp. Process of solution organized and possibly simplified by algebraic manipulations reducing integrals in solutions to known or tabulated forms.
A Student's Guide to Fourier Transforms - 2nd Edition
James, J. F.
2002-09-01
Fourier transform theory is of central importance in a vast range of applications in physical science, engineering, and applied mathematics. This new edition of a successful student text provides a concise introduction to the theory and practice of Fourier transforms, using qualitative arguments wherever possible and avoiding unnecessary mathematics. After a brief description of the basic ideas and theorems, the power of the technique is then illustrated by referring to particular applications in optics, spectroscopy, electronics and telecommunications. The rarely discussed but important field of multi-dimensional Fourier theory is covered, including a description of computer-aided tomography (CAT-scanning). The final chapter discusses digital methods, with particular attention to the fast Fourier transform. Throughout, discussion of these applications is reinforced by the inclusion of worked examples. The book assumes no previous knowledge of the subject, and will be invaluable to students of physics, electrical and electronic engineering, and computer science. Expanded to include more emphasis on applications An established successful textbook for undergraduate and graduate students Includes worked examples and copious diagrams throughout
Chen, Li; Yap, Yee Leng
2008-01-01
This study describes a new algorithm for charge state determination of complex isotope-resolved mass spectra. This algorithm is based on peak-target Fourier transform (PTFT) of isotope packets. It is modified from the widely used Fourier transform method because Fourier transform may give ambiguous charge state assignment for low signal-to-noise ratio (S/N) or overlapping isotopic clusters. The PTFT algorithm applies a novel "folding" strategy to enhance peaks that are symmetrically spaced about the targeted peak before applying the FT. The "folding" strategy multiplies each point to the high-m/z side of the targeted peak by its counterpart on the low-m/z side. A Fourier transform of this "folded" spectrum is thus simplified, emphasizing the charge state of the "chosen" ion, whereas ions of other charge states contribute less to the transformed data. An intensity-dependent technique is also proposed for charge state determination from frequency signals. The performance of PTFT is demonstrated using experimental electrospray ionization Fourier transform ion cyclotron resonance mass spectra. The results show that PTFT is robust for charge state determination of low S/N and overlapping isotopic clusters, and also useful for manual verification of potential hidden isotopic clusters that may be missed by the current analysis algorithms, i.e., AID-MS or THRASH.
Melchert, O; Roth, B
2016-01-01
We discuss efficient algorithms for the accurate forward and reverse evaluation of the discrete Fourier-Bessel transform (dFBT) as numerical tools to assist in the 2D polar convolution of two radially symmetric functions, relevant, e.g., to applications in computational biophotonics. In our survey of the numerical procedure we account for the circumstance that the objective function might result from a more complex measurement process and is, in the worst case, known on a finite sequence of coordinate values, only. We contrast the performance of the resulting algorithms with a procedure based on a straight forward numerical quadrature of the underlying integral transform and asses its efficienty for two benchmark Fourier-Bessel pairs. An application to the problem of finite-size beam-shape convolution in polar coordinates, relevant in the context of tissue optics and optoacoustics, is used to illustrate the versatility and computational efficiency of the numerical procedure.
Novel fringe scanning/Fourier transform method of synthetic imaging
Energy Technology Data Exchange (ETDEWEB)
Crawford, T.M.; Albano, R.K.
1993-08-01
We have developed a one-dimensional theory and a computer model for synthetically imaging scenes using a novel fringe scanning/Fourier transform technique. Our method probes a scene using two interfering beams of slightly different frequency. These beams form a moving fringe pattern which scans the scene and resonates with any spatial frequency components having the same spatial frequency as the scanning fringe pattern. A simple, non-imaging detector above the scene observes any scattered radiation from the scene falling onto it. If a resonance occurs between the scanning fringe pattern and the scene, then the scattered radiation will be modulated at the difference frequency between the two probing beams. By changing the spatial period of the fringe pattern and then measuring the amplitude and phase of the modulated radiation that is scattered from the scene, the Fourier amplitudes and phases of the different spatial frequency components making up the scene can be measured. A synthetic image of the scene being probed can be generated from this Fourier amplitude and phase data by taking the inverse Fourier transform of this information. This technique could be used to image objects using light, ultrasonic, or other electromagnetic or acoustic waves.
Prediction of Tide Height Using the Discrete Fourier Transform
Directory of Open Access Journals (Sweden)
Md. Towhiduzzaman
2016-12-01
Full Text Available In this study, I have investigated some aspects of astronomical tide and predicted tide time and height by different methods. This thesis deals with the prediction of height and time for both high and low waters of the ports set up in several places by discrete Fourier transform. I computed the tide height using Discrete Fourier Transform (DFT. The results are found to be in an agreement with the predicted data of others. By this work, we can predict the tide height of overall stations if the sample observed data are available for any kind of stations. I think that my work could be helpful to predict the tides over all stations where the observed data are available.
A simple scanning mirror mechanism for a Fourier transform spectrometer
Brasunas, John C.; Cushman, G. Mark
1998-04-01
We present a simple scanning mirror mechanism for a Fourier transform spectrometer, consisting of a voice coil actuator, a ball-bearing slide, and a single cube corner mirror or retroreflector. The use of a single cube corner reduces significantly the sensitivity of the Fourier transform spectrometer to the tilt of its moving mirror, enabling the simple mechanism. With simple velocity feedback using a linear velocity transducer, we achieve a scan speed stability of 2%-5% (root-mean-square) for scan speeds from 40 to 440 μm/s for a travel of 2.2 cm, corresponding to a spectral resolution of 0.06 cm-1. Fringe amplitude stability is about 5%. This scan mechanism was operated at standard temperature and pressure, but the relatively minute amount of lubricant in the ball-bearing slide may indicate possible operation under vacuum and/or cryogenic conditions.
Fourier transform spectrometer based on Fabry-Perot interferometer.
Al-Saeed, Tarek A; Khalil, Diaa A
2016-07-10
We analyze the Fourier transform spectrometer based on a symmetric/asymmetric Fabry-Perot interferometer. In this spectrometer, the interferogram is obtained by recording the intensity as a function of the interferometer length. Then, we recover the spectrum by applying the discrete Fourier transform (DFT) directly on the interferogram. This technique results in spectral harmonic overlap and fictitious wavenumber components outside the original spectral range. For this purpose, in this work, we propose a second method to recover the spectrum. This method is based on expanding the DFT of the interferogram and the spectrum by a Haar or box function. By this second method, we recovered the spectrum and got rid of the fictitious spectral components and spectral harmonic overlap.
Perfect vortex beam: Fourier transformation of a Bessel beam.
Vaity, Pravin; Rusch, Leslie
2015-02-15
We derive a mathematical description of a perfect vortex beam as the Fourier transformation of a Bessel beam. Building on this development, we experimentally generate Bessel-Gauss beams of different orders and Fourier transform them to form perfect vortex beams. By controlling the radial wave vector of a Bessel-Gauss beam, we can control the ring radius of the generated beam. Our theoretical predictions match with the experimental results and also provide an explanation for previous published works. We find the perfect vortex resembles that of an orbital angular momentum (OAM) mode supported in annular profiled waveguides. Our prefect vortex beam generation method can be used to excite OAM modes in an annular core fiber.
Multiparty Quantum Secret Sharing Using Quantum Fourier Transform
Institute of Scientific and Technical Information of China (English)
HUANG Da-Zu; CHEN Zhi-Gang; GUO Ying
2009-01-01
A (n, n )-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform.In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert.Furthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant.Security analysis shows that our scheme is secure.Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.
On the Fourier transform of the greatest common divisor
van der Kamp, Peter H
2012-01-01
The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with Ramanujan's sum, and on the other hand it can be written as a generalised convolution product of the identity with the totient function. We show that this arithmetic function of two integers (a,m) counts the number of elements in the set of ordered pairs (i,j) such that i*j is equivalent to a modulo m. Furthermore we generalise a dozen known identities for the totient function, to identities which involve the discrete Fourier transform of the greatest common divisor, including its partial sums, and its Lambert series.
Scalable Fourier transform system for instantly structured illumination in lithography.
Ye, Yan; Xu, Fengchuan; Wei, Guojun; Xu, Yishen; Pu, Donglin; Chen, Linsen; Huang, Zhiwei
2017-05-15
We report the development of a unique scalable Fourier transform 4-f system for instantly structured illumination in lithography. In the 4-f system, coupled with a 1-D grating and a phase retarder, the ±1st order of diffracted light from the grating serve as coherent incident sources for creating interference patterns on the image plane. By adjusting the grating and the phase retarder, the interference fringes with consecutive frequencies, as well as their orientations and phase shifts, can be generated instantly within a constant interference area. We demonstrate that by adapting this scalable Fourier transform system into lithography, the pixelated nano-fringe arrays with arbitrary frequencies and orientations can be dynamically produced in the photoresist with high variation resolution, suggesting its promising application for large-area functional materials based on space-variant nanostructures in lithography.
On-chip photonic Fourier transform with surface plasmon polaritons
Institute of Scientific and Technical Information of China (English)
Shan Shan Kou; Guanghui Yuan; Qian wang; Luping Du; Eugeniu Balaur; Daohua Zhang; Dingyuan Tang
2016-01-01
The Fourier transform (FT),a cornerstone of optical processing,enables rapid evaluation of fundamental mathematical operations,such as derivatives and integrals.Conventionally,a converging lens performs an optical FT in free space when light passes through it.The speed of the transformation is limited by the thickness and the focal length of the lens.By usingthe wave nature of surface plasmon polaritons (SPPs),here we demonstrate that the FT can be implemented in a planar configuration with a minimal propagation distance of around 10 μm,resulting in an increase of speed by four to five orders of magnitude.The photonic FT was tested by synthesizing intricate SPP waves with their Fourier components.The reduced dimensionality in the minuscule device allows the future development of an ultrafast on-chip photonic information processing platform for large-scale optical computing.
Matrix-Vector Based Fast Fourier Transformations on SDR Architectures
Directory of Open Access Journals (Sweden)
Y. He
2008-05-01
Full Text Available Today Discrete Fourier Transforms (DFTs are applied in various radio standards based on OFDM (Orthogonal Frequency Division Multiplex. It is important to gain a fast computational speed for the DFT, which is usually achieved by using specialized Fast Fourier Transform (FFT engines. However, in face of the Software Defined Radio (SDR development, more general (parallel processor architectures are often desirable, which are not tailored to FFT computations. Therefore, alternative approaches are required to reduce the complexity of the DFT. Starting from a matrix-vector based description of the FFT idea, we will present different factorizations of the DFT matrix, which allow a reduction of the complexity that lies between the original DFT and the minimum FFT complexity. The computational complexities of these factorizations and their suitability for implementation on different processor architectures are investigated.
Institute of Scientific and Technical Information of China (English)
CHEN Xu; WAN Jian-ping
2007-01-01
To study the approximation of foreign currency option prices when the underlying assets'price dynamics are described by exponential Lévy processes, the convolution representations for option pricing formulas were given, and then the fast Fourier transform(FFT) algorithm was used to get the approximate values of option prices. Finally, a numerical example was given to demonstrate the calculate steps to the option price by FFT.
Using single buffers and data reorganization to implement a multi-megasample fast Fourier transform
Brown, R. D.
1992-01-01
Data ordering in large fast Fourier transforms (FFT's) is both conceptually and implementationally difficult. Discribed here is a method of visualizing data orderings as vectors of address bits, which enables the engineer to use more efficient data orderings and reduce double-buffer memory designs. Also detailed are the difficulties and algorithmic solutions involved in FFT lengths up to 4 megasamples (Msamples) and sample rates up to 80 MHz.
Magnetic suspension based Fourier Transform Infrared Spectrometer mechanism (FTIS)
Köker, Ingo; Langenbach, Harald; Schmid, Manfred; Lautier, Jean-Michel
2005-07-01
In the frame of an ESTEC technology contract the development of a Magnetically Suspended Fourier Transform Spectrometer Mechanism (FTIS) was carried out. The aim of the development is to avoid the issues found in mechanically suspended systems and to provide an active alignment and disturbance rejection capability for spectrometer applications. In the frame of FTIS an actively controlled suspension system based on the use of magnetic bearings was defined, developed and built as a demonstration model.
Homology of balanced complexes via the Fourier transform
Meshulam, Roy
2011-01-01
Let G_0,...,G_k be finite abelian groups and let G_0*...*G_k be the join of the 0-dimensional complexes G_i. We give a characterization of the integral k-coboundaries of subcomplexes of G_0*...*G_k in terms of the Fourier transform on the group G_0 \\times ... \\times G_k. This leads to an extension of a recent result of Musiker and Reiner on a topological interpretation of the cyclotomic polynomial.
10th International Conference on Progress in Fourier Transform Spectroscopy
Keresztury, Gábor; Kellner, Robert
1997-01-01
19 plenary lectures and 203 poster papers presented at the 10th International Conference of Fourier Transform Spectroscopy in Budapest 1995 give an overview on the state-of-the art of this technology and its wide range of applications. The reader will get information on any aspects of FTS including the latest instrumental developments, e.g. in diode array detection, time resolution FTS, microscopy and spectral mapping, double modulation and two-dimensional FTS.
Scaled Fractional Fourier Transform for Partially Coherent Beams
Institute of Scientific and Technical Information of China (English)
蔡阳健; 林强
2003-01-01
The definition of scaled fractional Fourier transform (SFRT) is extended to partially coherent beams based directly on the cross-spectral density. Based on this formula, an equivalent tensor ABCD law for the SFRT of partially coherent twisted anisotropic Gaussian-Schell model beams is derived. The derived formulae provide a powerful tool for analysing and calculating the SFRT of partially coherent beams. An application example is provided.
Fourier spectroscopy with a one-million-point transformation
Connes, J.; Delouis, H.; Connes, P.; Guelachvili, G.; Maillard, J.; Michel, G.
1972-01-01
A new type of interferometer for use in Fourier spectroscopy has been devised at the Aime Cotton Laboratory of the National Center for Scientific Research (CNRS), Orsay, France. With this interferometer and newly developed computational techniques, interferograms comprising as many as one million samples can now be transformed. The techniques are described, and examples of spectra of thorium and holmium, derived from one million-point interferograms, are presented.
Entangled Fractional Fourier Transform for the Multipartite Entangled State Representation
Institute of Scientific and Technical Information of China (English)
QIAN Xiao-Qing; SONG Tong-Qiang
2006-01-01
We deduce entangled fractional Fourier transformation (EFFT) for the multipartite entangled state representation, which was newly constructed with two mutually conjugate n-mode entangled states of continuum variables in n-mode Fock space. We establish a formalism of EFFT for quantum mechanical wave functions, which provides us a convenient way to derive some wave functions. We find that the eigenmode of EFFT is different from the usual Hermite Polynomials. We also derive the EFFT of the n-mode squeezed state.
CONCURRENT SPEECHES SEPARATION USING WRAPPED DISCRETE FOURIER TRANSFORM
Institute of Scientific and Technical Information of China (English)
Zhang Xichun; Li Yunjie; Zhang Jun; Wei Gang
2005-01-01
This letter proposes a new method for concurrent voiced speech separation. Firstly the Wrapped Discrete Fourier Transform (WDFT) is used to decompose the harmonic spectra of the mixed speeches. Then the individual speech is reconstructed by using the sinusoidal speech model. By taking advantage of the non-uniform frequency resolution of WDFT, harmonic spectra parameters can be estimated and separated accurately. Experimental results on mixed vowels separation show that the proposed method can recover the original speeches effectively.
Fourier-transform Ghost Imaging with Hard X-rays
Yu, Hong; Han, Shensheng; Xie, Honglan; Du, Guohao; Xiao, Tiqiao; Zhu, Daming
2016-01-01
Knowledge gained through X-ray crystallography fostered structural determination of materials and greatly facilitated the development of modern science and technology in the past century. Atomic details of sample structures is achievable by X-ray crystallography, however, it is only applied to crystalline structures. Imaging techniques based on X-ray coherent diffraction or zone plates are capable of resolving the internal structure of non-crystalline materials at nanoscales, but it is still a challenge to achieve atomic resolution. Here we demonstrate a novel lensless Fourier-transform ghost imaging method with pseudo-thermal hard X-rays by measuring the second-order intensity correlation function of the light. We show that high resolution Fourier-transform diffraction pattern of a complex structure can be achieved at Fresnel region, and the amplitude and phase distributions of a sample in spatial domain can be retrieved successfully. The method of lensless X-ray Fourier-transform ghost imaging extends X-ray...
Fourier transform light scattering angular spectroscopy using digital inline holography.
Kim, Kyoohyun; Park, YongKeun
2012-10-01
A simple and practical method for measuring the angle-resolved light scattering (ARLS) from individual objects is reported. Employing the principle of inline holography and a Fourier transform light scattering technique, both the static and dynamic scattering patterns from individual micrometer-sized objects can be effectively and quantitatively obtained. First, the light scattering measurements were performed on individual polystyrene beads, from which the refractive index and diameter of each bead were retrieved. Also, the measurements of the static and dynamic light scattering from intact human red blood cells are demonstrated. Using the present method, an existing microscope can be directly transformed into a precise instrument for ARLS measurements.
[Continuum based fast Fourier transform processing of infrared spectrum].
Liu, Qing-Jie; Lin, Qi-Zhong; Wang, Qin-Jun; Li, Hui; Li, Shuai
2009-12-01
To recognize ground objects with infrared spectrum, high frequency noise removing is one of the most important phases in spectrum feature analysis and extraction. A new method for infrared spectrum preprocessing was given combining spectrum continuum processing and Fast Fourier Transform (CFFT). Continuum was firstly removed from the noise polluted infrared spectrum to standardize hyper-spectra. Then the spectrum was transformed into frequency domain (FD) with fast Fourier transform (FFT), separating noise information from target information After noise eliminating from useful information with a low-pass filter, the filtered FD spectrum was transformed into time domain (TD) with fast Fourier inverse transform. Finally the continuum was recovered to the spectrum, and the filtered infrared spectrum was achieved. Experiment was performed for chlorite spectrum in USGS polluted with two kinds of simulated white noise to validate the filtering ability of CFFT by contrast with cubic function of five point (CFFP) in time domain and traditional FFT in frequency domain. A circle of CFFP has limited filtering effect, so it should work much with more circles and consume more time to achieve better filtering result. As for conventional FFT, Gibbs phenomenon has great effect on preprocessing result at edge bands because of special character of rock or mineral spectra, while works well at middle bands. Mean squared error of CFFT is 0. 000 012 336 with cut-off frequency of 150, while that of FFT and CFFP is 0. 000 061 074 with cut-off frequency of 150 and 0.000 022 963 with 150 working circles respectively. Besides the filtering result of CFFT can be improved by adjusting the filter cut-off frequency, and has little effect on working time. The CFFT method overcomes the Gibbs problem of FFT in spectrum filtering, and can be more convenient, dependable, and effective than traditional TD filter methods.
Directory of Open Access Journals (Sweden)
Jinsoo Park
2014-01-01
Full Text Available A new voice activity detector for noisy environments is proposed. In conventional algorithms, the endpoint of speech is found by applying an edge detection filter that finds the abrupt changing point in a feature domain. However, since the frame energy feature is unstable in noisy environments, it is difficult to accurately find the endpoint of speech. Therefore, a novel feature extraction algorithm based on the double-combined Fourier transform and envelope line fitting is proposed. It is combined with an edge detection filter for effective detection of endpoints. Effectiveness of the proposed algorithm is evaluated and compared to other VAD algorithms using two different databases, which are AURORA 2.0 database and SITEC database. Experimental results show that the proposed algorithm performs well under a variety of noisy conditions.
Parallel 3-dim fast Fourier transforms with load balancing of the plane waves
Gao, Xingyu; Fang, Jun; Wang, Han
2016-01-01
The plane wave method is most widely used for solving the Kohn-Sham equations in first-principles materials science computations. In this procedure, the three-dimensional (3-dim) trial wave functions' fast Fourier transform (FFT) is a regular operation and one of the most demanding algorithms in terms of the scalability on a parallel machine. We propose a new partitioning algorithm for the 3-dim FFT grid to accomplish the trade-off between the communication overhead and load balancing of the plane waves. It is shown by qualitative analysis and numerical results that our approach could scale the plane wave first-principles calculations up to more nodes.
Directory of Open Access Journals (Sweden)
Evan Senter
Full Text Available Using complex roots of unity and the Fast Fourier Transform, we design a new thermodynamics-based algorithm, FFTbor, that computes the Boltzmann probability that secondary structures differ by [Formula: see text] base pairs from an arbitrary initial structure of a given RNA sequence. The algorithm, which runs in quartic time O(n(4 and quadratic space O(n(2, is used to determine the correlation between kinetic folding speed and the ruggedness of the energy landscape, and to predict the location of riboswitch expression platform candidates. A web server is available at http://bioinformatics.bc.edu/clotelab/FFTbor/.
A fast butterfly algorithm for generalized Radon transforms
Hu, Jingwei
2013-06-21
Generalized Radon transforms, such as the hyperbolic Radon transform, cannot be implemented as efficiently in the frequency domain as convolutions, thus limiting their use in seismic data processing. We have devised a fast butterfly algorithm for the hyperbolic Radon transform. The basic idea is to reformulate the transform as an oscillatory integral operator and to construct a blockwise lowrank approximation of the kernel function. The overall structure follows the Fourier integral operator butterfly algorithm. For 2D data, the algorithm runs in complexity O(N2 log N), where N depends on the maximum frequency and offset in the data set and the range of parameters (intercept time and slowness) in the model space. From a series of studies, we found that this algorithm can be significantly more efficient than the conventional time-domain integration. © 2013 Society of Exploration Geophysicists.
Institute of Scientific and Technical Information of China (English)
QI Lin; TAO Ran; ZHOU Siyong; WANG Yue
2004-01-01
This paper presents a new method for the detection and parameter estimation of multicomponent LFM signals based on the fractional Fourier transform. For the optimization in the fractional Fourier domain, an algorithm based on Quasi-Newton method is proposed which consists of two steps of searching, leading to a reduction in computation without loss of accuracy. And for multicomponent signals, we further propose a signal separation technique in the fractional Fourier domain which can effectively suppress the interferences on the detection of the weak components brought by the stronger components. The statistical analysis of the estimate errors is also performed which perfects the method theoretically, and finally, simulation results are provided to show the validity of our method.
Chan, Kenny K H; Tang, Shuo
2011-12-19
Gridding based non-uniform fast Fourier transform (NUFFT) has recently been shown as an efficient method of processing non-linearly sampled data from Fourier-domain optical coherence tomography (FD-OCT). This method requires selecting design parameters, such as kernel function type, oversampling ratio and kernel width, to balance between computational complexity and accuracy. The Kaiser-Bessel (KB) and Gaussian kernels have been used independently on the NUFFT algorithm for FD-OCT. This paper compares the reconstruction error and speed for the optimization of these design parameters and justifies particular kernel choice for FD-OCT applications. It is found that for on-the-fly computation of the kernel function, the simpler Gaussian function offers a better accuracy-speed tradeoff. The KB kernel, however, is a better choice in the pre-computed kernel mode of NUFFT, in which the processing speed is no longer dependent on the kernel function type. Finally, the algorithm is used to reconstruct in-vivo images of a human finger at a camera limited 50k A-line/s.
Twin image elimination in digital holography by combination of Fourier transformations
Choudhury, Debesh
2013-01-01
We present a new technique for removing twin image in in-line digital Fourier holography using a combination of Fourier transformations. Instead of recording only a Fourier transform hologram of the object, we propose to record a combined Fourier transform hologram by simultaneously recording the hologram of the Fourier transform and the inverse Fourier transform of the object with suitable weighting coefficients. Twin image is eliminated by appropriate inverse combined Fourier transformation and proper choice of the weighting coefficients. An optical configuration is presented for recording combined Fourier transform holograms. Simulations demonstrate the feasibility of twin image elimination. The hologram reconstruction is sensitive to phase aberrations of the object, thereby opening a way for holographic phase sensing.
Improved Spectral Representation for Birdcall Based on Fractional Fourier Transform
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
A novel spectral representation based on fractional Fourier transform (FrFT) is proposed and applied to birdcall analysis. The FrFT-based spectrogram of a signal is derived and compared with its FT-based counterpart, and the spectrum gathering method is used to show the energy distribution related to the pitch frequency. The fixed transform order and adaptive orders for FrFT are tested. The fixed order can be obtained empirically or calculated according to the known chirp rate. The adaptive optimal orders are determined by using ambiguity function. Experimental results with birdcalls show that the FrFT-based spectrogram with an optimal transform order has higher resolution than its STFT-based counterpart, and the better performance can be achieved if adaptive orders are used.
Numerical Analysis of Inhomogeneous Dielectric Waveguide Using Periodic Fourier Transform
Directory of Open Access Journals (Sweden)
M. Moradian
2007-01-01
Full Text Available A general method is introduced to obtain the propagation constants of the inhomogeneous dielectric waveguide. The periodic Fourier transform is applied to the normalized Maxwell's equations and makes the field components periodic. Then they are expanded in Fourier series. Finally, the trapezoidal rule is applied to approximate the convolution integral which leads to a set of coupled second-order differential equations that can be solved as an eigenvalue-eigenvector problem. The normalized propagation constant can be obtained as the square roots of the eigenvalues of the coefficient matrices. The proposed method is applied to the dielectric waveguide with a two-layered dielectric profile in the transverse direction, and the first four-confined TE modes are obtained. The propagation constants for the mentioned dielectric waveguide are also derived analytically and are then compared with those derived by the proposed method. Comparison of results shows the efficacy of the proposed method.
Gundreddy, Rohith Reddy; Tan, Maxine; Qui, Yuchen; Zheng, Bin
2015-03-01
The purpose of this study is to develop and test a new content-based image retrieval (CBIR) scheme that enables to achieve higher reproducibility when it is implemented in an interactive computer-aided diagnosis (CAD) system without significantly reducing lesion classification performance. This is a new Fourier transform based CBIR algorithm that determines image similarity of two regions of interest (ROI) based on the difference of average regional image pixel value distribution in two Fourier transform mapped images under comparison. A reference image database involving 227 ROIs depicting the verified soft-tissue breast lesions was used. For each testing ROI, the queried lesion center was systematically shifted from 10 to 50 pixels to simulate inter-user variation of querying suspicious lesion center when using an interactive CAD system. The lesion classification performance and reproducibility as the queried lesion center shift were assessed and compared among the three CBIR schemes based on Fourier transform, mutual information and Pearson correlation. Each CBIR scheme retrieved 10 most similar reference ROIs and computed a likelihood score of the queried ROI depicting a malignant lesion. The experimental results shown that three CBIR schemes yielded very comparable lesion classification performance as measured by the areas under ROC curves with the p-value greater than 0.498. However, the CBIR scheme using Fourier transform yielded the highest invariance to both queried lesion center shift and lesion size change. This study demonstrated the feasibility of improving robustness of the interactive CAD systems by adding a new Fourier transform based image feature to CBIR schemes.
A transformada de Fourier em basic The Fourier transform (FFT in basic
Directory of Open Access Journals (Sweden)
Mauricio Gomes Constantino
2000-06-01
Full Text Available In this paper we describe three computer programs in Basic language about the Fourier transform (FFT which are available in the Internet site http://artemis.ffclrp.usp.br/SoftwareE.htm (in English or http://artemis.ffclrp.usp.br/softwareP.htm (in Portuguese since October 1998. Those are addresses to the Web Page of our Laboratory of Organic Synthesis. The programs can be downloaded and used by anyone who is interested on the subject. The texts, menus and captions in the programs are written in English.
Fernandez-de-Cossio, Jorge
2010-03-01
Fine isotopic structure patterns resolvable by ultrahigh-resolution mass spectrometers are diagnostic of the elemental composition of moderately large compounds. Despite the proven performance of Fourier transforms algorithms to calculate accurate high resolution isotopic distribution, its application to finer ultrahigh resolving power exhibits limited performance. Fast Fourier transforms algorithm requires sampling the relevant range at equally spaced mass values, but ultrahigh resolution mass spectrum displays highly localized complex patterns (peaks) separated in between by relatively large unstructured intervals. Computational efforts consumed on those uninformative intervals are a waste of resources. A fast and memory efficient procedure is introduced in this paper to calculate the isotopic distribution of a single relatively high-mass molecule at ultrahigh resolution by Fourier transforms approaches. The whole isotopic distribution is packed closer to the monoisotopic peak without distorting the actual scale of the peak fine structure. This packing procedure reduced 8 to 32 times the computation resources in comparison to the same calculation performed without packing. The procedure can be readily implemented in existing software.
Image Reconstruction from Under sampled Fourier Data Using the Polynomial Annihilation Transform
Energy Technology Data Exchange (ETDEWEB)
Archibald, Richard K. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Gelb, Anne [Arizona State Univ., Mesa, AZ (United States); Platte, Rodrigo [Arizona State Univ., Mesa, AZ (United States)
2015-09-09
Fourier samples are collected in a variety of applications including magnetic resonance imaging and synthetic aperture radar. The data are typically under-sampled and noisy. In recent years, l^{1} regularization has received considerable attention in designing image reconstruction algorithms from under-sampled and noisy Fourier data. The underlying image is assumed to have some sparsity features, that is, some measurable features of the image have sparse representation. The reconstruction algorithm is typically designed to solve a convex optimization problem, which consists of a fidelity term penalized by one or more l^{1} regularization terms. The Split Bregman Algorithm provides a fast explicit solution for the case when TV is used for the l1l1 regularization terms. Due to its numerical efficiency, it has been widely adopted for a variety of applications. A well known drawback in using TV as an l^{1} regularization term is that the reconstructed image will tend to default to a piecewise constant image. This issue has been addressed in several ways. Recently, the polynomial annihilation edge detection method was used to generate a higher order sparsifying transform, and was coined the “polynomial annihilation (PA) transform.” This paper adapts the Split Bregman Algorithm for the case when the PA transform is used as the l^{1} regularization term. In so doing, we achieve a more accurate image reconstruction method from under-sampled and noisy Fourier data. Our new method compares favorably to the TV Split Bregman Algorithm, as well as to the popular TGV combined with shearlet approach.
Magneto-sensor circuit efficiency incremented by Fourier-transformation
Talukdar, Abdul Hafiz Ibne
2011-10-01
In this paper detection by recognized intelligent algorithm for different magnetic films with the aid of a cost-effective and simple high efficient circuit are realized. Well-known, magnetic films generate oscillating frequencies when they stay a part of an LC- oscillatory circuit. These frequencies can be further analyzed to gather information about their magnetic properties. For the first time in this work we apply the signal analysis in frequency domain to create the Fourier frequency spectra which was used to detect the sample properties and their recognition. In this paper we have summarized both the simulation and experimental results. © 2011 Elsevier Ltd. All rights reserved.
Computer Generation of Fourier Transform Libraries for Distributed Memory Architectures
2010-12-01
Cooley-TukeyFFT.Thefirst “fast” algorithm for theDFTwas discoveredbyCooley andTukey [Coo- ley and Tukey, 1965] 1, and is often referred to as “the...Carl Friedrich Gauss , but his work was not widely recog- nized [Heideman et al., 1985]. 2It is important to note the distinction between the terms...Applications, pages 129–136. North-Holland, 1994. 26 M. T. Heideman, D. H. Johnson, and C. S. Burrus. Gauss and the history of the fast Fourier
Suppression law of quantum states in a 3D photonic fast Fourier transform chip
Crespi, Andrea; Osellame, Roberto; Ramponi, Roberta; Bentivegna, Marco; Flamini, Fulvio; Spagnolo, Nicolò; Viggianiello, Niko; Innocenti, Luca; Mataloni, Paolo; Sciarrino, Fabio
2016-01-01
The identification of phenomena able to pinpoint quantum interference is attracting large interest. Indeed, a generalization of the Hong–Ou–Mandel effect valid for any number of photons and optical modes would represent an important leap ahead both from a fundamental perspective and for practical applications, such as certification of photonic quantum devices, whose computational speedup is expected to depend critically on multi-particle interference. Quantum distinctive features have been predicted for many particles injected into multimode interferometers implementing the Fourier transform over the optical modes. Here we develop a scalable approach for the implementation of the fast Fourier transform algorithm using three-dimensional photonic integrated interferometers, fabricated via femtosecond laser writing technique. We observe the suppression law for a large number of output states with four- and eight-mode optical circuits: the experimental results demonstrate genuine quantum interference between the injected photons, thus offering a powerful tool for diagnostic of photonic platforms. PMID:26843135
Wu, Xuebin
2011-01-01
Long Reed-Solomon (RS) codes are desirable for digital communication and storage systems due to their improved error performance, but the high computational complexity of their decoders is a key obstacle to their adoption in practice. As discrete Fourier transforms (DFTs) can evaluate a polynomial at multiple points, efficient DFT algorithms are promising in reducing the computational complexities of syndrome based decoders for long RS codes. In this paper, we first propose partial composite cyclotomic Fourier transforms (CCFTs) and then devise syndrome based decoders for long RS codes over large finite fields based on partial CCFTs. The new decoders based on partial CCFTs achieve a significant saving of computational complexities for long RS codes. Since partial CCFTs have modular and regular structures, the new decoders are suitable for hardware implementations. To further verify and demonstrate the advantages of partial CCFTs, we implement in hardware the syndrome computation block for a $(2720, 2550)$ sho...
Multiple-image encryption based on phase mask multiplexing in fractional Fourier transform domain.
Liansheng, Sui; Meiting, Xin; Ailing, Tian
2013-06-01
A multiple-image encryption scheme is proposed based on the phase retrieval process and phase mask multiplexing in the fractional Fourier transform domain. First, each original gray-scale image is encoded into a phase only function by using the proposed phase retrieval process. Second, all the obtained phase functions are modulated into an interim, which is encrypted into the final ciphertext by using the fractional Fourier transform. From a plaintext image, a group of phase masks is generated in the encryption process. The corresponding decrypted image can be recovered from the ciphertext only with the correct phase mask group in the decryption process. Simulation results show that the proposed phase retrieval process has high convergence speed, and the encryption algorithm can avoid cross-talk; in addition, its encrypted capacity is considerably enhanced.
Denoise in the pseudopolar grid Fourier space using exact inverse pseudopolar Fourier transform
Wei, Fan Jun
2015-01-01
In this paper I show a matrix method to calculate the exact inverse pseudopolar grid Fourier transform, and use this transform to do noise removals in the k space of pseudopolar grids. I apply the Gaussian filter to this pseudopolar grid and find the advantages of the noise removals are very excellent by using pseudopolar grid, and finally I show the Cartesian grid denoise for comparisons. The results present the signal to noise ratio and the variance are much better when doing noise removals in the pseudopolar grid than the Cartesian grid. The noise removals of pseudopolar grid or Cartesian grid are both in the k space, and all these noises are added in the real space.
Directional short-time Fourier transform of distributions
Directory of Open Access Journals (Sweden)
Katerina Hadzi-Velkova Saneva
2016-04-01
Full Text Available Abstract In this paper we consider the directional short-time Fourier transform (DSTFT that was introduced and investigated in (Giv in J. Math. Anal. Appl. 399:100-107, 2013. We analyze the DSTFT and its transpose on test function spaces S ( R n $\\mathcal {S}(\\mathbb {R}^{n}$ and S ( Y 2 n $\\mathcal {S}(\\mathbb {Y}^{2n}$ , respectively, and prove the continuity theorems on these spaces. Then the obtained results are used to extend the DSTFT to spaces of distributions.
Fourier Transform Infrared Spectroscopic Analysis of Protein Secondary Structures
Institute of Scientific and Technical Information of China (English)
Jilie KONG; Shaoning YU
2007-01-01
Infrared spectroscopy is one of the oldest and well established experimental techniques for the analysis of secondary structure of polypeptides and proteins. It is convenient, non-destructive, requires less sample preparation, and can be used under a wide variety of conditions. This review introduces the recent developments in Fourier transform infrared (FTIR) spectroscopy technique and its applications to protein structural studies. The experimental skills, data analysis, and correlations between the FTIR spectroscopic bands and protein secondary structure components are discussed. The applications of FTIR to the secondary structure analysis, conformational changes, structural dynamics and stability studies of proteins are also discussed.
THREE-VARIABLE ALTERNATING TRIGONOMETRIC FUNCTIONS AND CORRESPONDING FOURIER TRANSFORMS
Directory of Open Access Journals (Sweden)
Agata Bezubik
2016-06-01
Full Text Available The common trigonometric functions admit generalizations to any higher dimension, the symmetric, antisymmetric and alternating ones. In this paper, we restrict ourselves to three dimensional generalization only, focusing on alternating case in detail. Many specific properties of this new class of special functions useful in applications are studied. Such are the orthogonalities, both the continuous one and the discrete one on the 3D lattice of any density, corresponding discrete and continuous Fourier transforms, and others. Rapidly increasing precision of the interpolation with increasing density of the 3D lattice is shown in an example.
Hyperspectral imaging using the single-pixel Fourier transform technique
Jin, Senlin; Hui, Wangwei; Wang, Yunlong; Huang, Kaicheng; Shi, Qiushuai; Ying, Cuifeng; Liu, Dongqi; Ye, Qing; Zhou, Wenyuan; Tian, Jianguo
2017-03-01
Hyperspectral imaging technology is playing an increasingly important role in the fields of food analysis, medicine and biotechnology. To improve the speed of operation and increase the light throughput in a compact equipment structure, a Fourier transform hyperspectral imaging system based on a single-pixel technique is proposed in this study. Compared with current imaging spectrometry approaches, the proposed system has a wider spectral range (400-1100 nm), a better spectral resolution (1 nm) and requires fewer measurement data (a sample rate of 6.25%). The performance of this system was verified by its application to the non-destructive testing of potatoes.
Parallel image registration method for snapshot Fourier transform imaging spectroscopy
Zhang, Yu; Zhu, Shuaishuai; Lin, Jie; Zhu, Feijia; Jin, Peng
2017-08-01
A fast and precise registration method for multi-image snapshot Fourier transform imaging spectroscopy is proposed. This method accomplishes registration of an image array using the positional relationship between homologous points in the subimages, which are obtained offline by preregistration. Through the preregistration process, the registration problem is converted to the problem of using a registration matrix to interpolate subimages. Therefore, the hardware interpolation of graphics processing unit (GPU) texture memory, which has speed advantages for its parallel computing, can be used to significantly enhance computational efficiency. Compared to a central processing unit, GPU performance showed ˜27 times acceleration in registration efficiency.
Atomic transition probabilities of Ce I from Fourier transform spectra
Lawler, J. E.; Chisholm, J.; Nitz, D. E.; Wood, M. P.; Sobeck, J.; Den Hartog, E. A.
2010-04-01
Atomic transition probabilities for 2874 lines of the first spectrum of cerium (Ce I) are reported. These data are from new branching fraction measurements on Fourier transform spectra normalized with previously reported radiative lifetimes from time-resolved laser-induced-fluorescence measurements (Den Hartog et al 2009 J. Phys. B: At. Mol. Opt. Phys. 42 085006). The wavelength range of the data set is from 360 to 1500 nm. Comparisons are made to previous investigations which are less extensive. Accurate Ce i transition probabilities are needed for lighting research and development on metal halide high-intensity discharge lamps.
Multi-band Image Registration Method Based on Fourier Transform
Institute of Scientific and Technical Information of China (English)
庹红娅; 刘允才
2004-01-01
This paper presented a registration method based on Fourier transform for multi-band images which is involved in translation and small rotation. Although different band images differ a lot in the intensity and features,they contain certain common information which we can exploit. A model was given that the multi-band images have linear correlations under the least-square sense. It is proved that the coefficients have no effect on the registration progress if two images have linear correlations. Finally, the steps of the registration method were proposed. The experiments show that the model is reasonable and the results are satisfying.
A high-resolution Fourier-transform infrared spectrometer.
Johnson, H. L.; Forbes, F. F.; Thompson, R. I.; Steinmetz , D. L.; Harris, O.
1973-01-01
We have developed a Fourier-transform infrared spectrometer having a resolution of 0.5/cm over the range of wavelength from 1 to 5.5 microns. It has been used to observe the sun over this wavelength range from a Lear Jet flying at an altitude of 14 km, and to observe a number of stars from the ground, using the 229-cm telescope of the Steward Observatory and the 152-cm aluminum-mirror telescope at the Observatorio Astronomico Nacional in the Sierra de San Pedro Martir, Baja California, Mexico. The solar spectrum is given here, while the ground-based spectra are being published separately.
Fourier-transform Raman spectroscopic study of human hair
Akhtar, W.; Edwards, H. G. M.; Farwell, D. W.; Nutbrown, M.
1997-07-01
Fourier-transform Raman microscopic spectra of normal, untreated and bleached hair fibres are presented. Vibrational assignments are made and differences are ascribed to the production of cysteic acid from cysteine. Changes in conformation associated with the disulphide bond in the keratotic component are noted from the ν(CSSC) vibrational modes at wave numbers near 500 cm -1. Raman spectra of hair root ends have also been investigated with a diminution in cysteine content being observed. Application of the technique to the biomedical investigation of healthy and diseased hair is proposed.
Ash melting behavior by Fourier transform infrared spectroscopy
Institute of Scientific and Technical Information of China (English)
LI Han-xu; QIU Xiao-sheng; TANG Yong-xin
2008-01-01
A Fourier Transform Infrared Spectroscopic (FTIR) method involving a Fe2O3 flux was used to learn how China's coal ash melts. The relationship between ash fusion temperature and chemical composition, as well as the effects of Fe2O3 flux on the ash fusion temperature were studied. The relationship between ash fusion temperature and chemical composition, mineralogical phases and functional groups was analyzed with the FTIR method. The results show that the ash fusion temperature is related to the location and transmittance of certain absorption peaks, which is of great significance for the study of ash behavior.
Beam profile for the Herschel-SPIRE Fourier transform spectrometer.
Makiwa, Gibion; Naylor, David A; Ferlet, Marc; Salji, Carl; Swinyard, Bruce; Polehampton, Edward; van der Wiel, Matthijs H D
2013-06-01
One of the instruments on board the Herschel Space Observatory is the Spectral and Photometric Imaging Receiver (SPIRE). SPIRE employs a Fourier transform spectrometer with feed-horn-coupled bolometers to provide imaging spectroscopy. To interpret the resultant spectral images requires knowledge of the wavelength-dependent beam, which in the case of SPIRE is complicated by the use of multimoded feed horns. In this paper we describe a series of observations and the analysis conducted to determine the wavelength dependence of the SPIRE spectrometer beam profile.
Double passing the Kitt Peak 1-m Fourier transform spectrometer
Jennings, D. E.; Hubbard, R.; Brault, J. W.
1985-01-01
Attention is given to a simple technique for performing the conversion of the Kitt Peak 1-m Fourier transform spectrometer's dual input/output optical configuration to a double pass configuration that improves spectral resolution by a factor of 2. The modification is made by placing a flat mirror in the output beam from each cat's eye, retroreflecting the beams back through the cat's eyes to the first beam splitter. A single detector is placed at the second input port, which then becomes the instrument's output.
Particle field holography data reduction by Fourier transform analysis
Hess, Cecil F.; Trolinger, James D.
1987-01-01
The size distribution of a particle field hologram is obtained with a Fourier transformation of the Fraunhofer diffraction pattern of the reconstructed hologram. Off-axis absorption holograms of particle fields with known characteristics were obtained and analyzed with a commercially available instrument. The mean particle size of the reconstructed hologram was measured with an error of + or - 5 percent, while the distribution broadening was estimated within + or - 15 percent. Small sections of a pulsed laser hologram of a synthetic fuel spray were analyzed with this method thus yielding a spatially resolved size distribution. The method yields fast and accurate automated analysis of particle field holograms.
Transfer Function Identification Using Orthogonal Fourier Transform Modeling Functions
Morelli, Eugene A.
2013-01-01
A method for transfer function identification, including both model structure determination and parameter estimation, was developed and demonstrated. The approach uses orthogonal modeling functions generated from frequency domain data obtained by Fourier transformation of time series data. The method was applied to simulation data to identify continuous-time transfer function models and unsteady aerodynamic models. Model fit error, estimated model parameters, and the associated uncertainties were used to show the effectiveness of the method for identifying accurate transfer function models from noisy data.
Directory of Open Access Journals (Sweden)
Jia-chun Zheng
2016-03-01
Full Text Available In the conditions of Gaussian noise, symmetric alpha stable impulse noise, multipath propagation, Doppler effect, and so on, a joint synchronization algorithm is proposed for underwater acoustic communication system based on fractional Fourier transform orthogonal frequency division multiplexing. The algorithm realizes the orthogonal multicarrier underwater acoustic communication system synchronization based on that the symmetrical triangular linear frequency modulation signal has the energy convergence in the domain of fractional Fourier transform. In order to verify the effectiveness of the algorithm, hyperbolic frequency modulation signal and linear frequency modulation signal are used as the evaluation index, and the synchronization performance of bit error rate of them is compared by simulation and pool experiments. The simulation results show that the proposed algorithm in this article is resistant to Gaussian noise, symmetric alpha stable pulse noise, multipath propagation, and Doppler effect, compared with traditional synchronization algorithms; the synchronization error probability is low at the same signal-to-noise ratio.
Lu, Wenlong; Xie, Junwei; Wang, Heming; Sheng, Chuan
2016-01-01
Inspired by track-before-detection technology in radar, a novel time-frequency transform, namely polynomial chirping Fourier transform (PCFT), is exploited to extract components from noisy multicomponent signal. The PCFT combines advantages of Fourier transform and polynomial chirplet transform to accumulate component energy along a polynomial chirping curve in the time-frequency plane. The particle swarm optimization algorithm is employed to search optimal polynomial parameters with which the PCFT will achieve a most concentrated energy ridge in the time-frequency plane for the target component. The component can be well separated in the polynomial chirping Fourier domain with a narrow-band filter and then reconstructed by inverse PCFT. Furthermore, an iterative procedure, involving parameter estimation, PCFT, filtering and recovery, is introduced to extract components from a noisy multicomponent signal successively. The Simulations and experiments show that the proposed method has better performance in component extraction from noisy multicomponent signal as well as provides more time-frequency details about the analyzed signal than conventional methods.
Fractional Fourier transform of Cantor sets: further numerical study
Institute of Scientific and Technical Information of China (English)
Gao Qiong; Liao tian-He; Cui Yuan-Feng
2008-01-01
This paper is a further work of the authors' paper published previously (Liao T H and Gao Q 2005 Chin. Phys. Lett. 22 2316). The amplitudes of fractional Fourier transform of Cantor sets are analysed from the viewpoint of multifractal by wavelet transform maxima method (WTMM). An integral operation is carried out before the application of WTMM, such that the function obtained can be considered as the perturbed devil staircase. Also, wavelets with large number of vanishing moments are used, which makes the complete singularity spectrum more accessible. The validity of multifractal formalism is guaranteed by restricting parameter q to a proper range, so that the phenomenon of multifractal phase transition can be explained reasonably. Particularly, the method of determining the range of parameter q in the above paper is developed to be more operational and rigorous.
A high-resolution Fourier Transform Spectrometer for planetary spectroscopy
Cruikshank, D. P.; Sinton, W. M.
1973-01-01
The employment of a high-resolution Fourier Transform Spectrometer (FTS) is described for planetary and other astronomical spectroscopy in conjunction with the 88-inch telescope at Mauna Kea Observatory. The FTS system is designed for a broad range of uses, including double-beam laboratory spectroscopy, infrared gas chromatography, and nuclear magnetic resonance spectroscopy. The data system is well-suited to astronomical applications because of its great speed in acquiring and transforming data, and because of the enormous storage capability of the magnetic tape unit supplied with the system. The basic instrument is outlined 2nd some of the initial results from the first attempted use on the Mauna Kea 88-inch telescope are reported.
Robust Video Watermarking Based on Discrete Fractional Fourier Transform
Institute of Scientific and Technical Information of China (English)
NIU Xiamu; SUN Shenghe
2001-01-01
A video watermarking techniquebased on discrete fractional Fourier transform(DFRFT) is proposed. Each frame of an original videois first decomposed into two-dimensional (2-D) mul-tiresolution representations by 2-D discrete wavelettransforms (DWT) along the spatial axis. Then thewavelet coefficient frames in each group of pictures(GOP, each GOP has 16 frames) are transformed intoDFRFT coefficient frames by one-dimensional (1-D)DFRFT along the temporal axis. The watermark isembedded into each DFRFT coefficient frame in theGOP, and the angular parameter of the DFRFT canbe changed to adapt itself to the original video. Experimental results show that the proposed techniqueis robust enough against the attacks of frame dropping, averaging and lossy compression.
Fourier transform for fermionic systems and the spectral tensor network.
Ferris, Andrew J
2014-07-01
Leveraging the decomposability of the fast Fourier transform, I propose a new class of tensor network that is efficiently contractible and able to represent many-body systems with local entanglement that is greater than the area law. Translationally invariant systems of free fermions in arbitrary dimensions as well as 1D systems solved by the Jordan-Wigner transformation are shown to be exactly represented in this class. Further, it is proposed that these tensor networks be used as generic structures to variationally describe more complicated systems, such as interacting fermions. This class shares some similarities with the Evenbly-Vidal branching multiscale entanglement renormalization ansatz, but with some important differences and greatly reduced computational demands.
High Etendue Imaging Fourier Transform Spectrometer: initial results
Horton, Richard F.; Conger, Chris A.; Pelligrino, L. S.
1997-10-01
At the Denver meeting, last year, we presented the High Etendue Imaging Fourier Transform Spectrometer, (HEIFTS), theory and optical design. This device uses a new 'image plane interferometer' geometry to produce 'autocorrelation function modulation' in the image plane of a 2D imaging array, such that the phase offset of the modulation varies linearly across the image. As a 2D image is pushbroomed across the imaging, array, the record of an individual scene pixel is recorded for each autocorrelation phase offset. The 3D array of this data is processed to yield an 'autocorrelation function' data cube, which is Fourier transformed to yield a 'wavenumber' hyperspectral data curve. A phase I device has been demonstrated in the laboratory and initial results are presented. The significant increase in signal to noise ratio, which the HEIFTS optical design promises over conventional hyperspectral imaging schemes, has been simulated, and results will be discussed. A Phase II system is being prepared for initial field deployment, and will be described.
Chiral Analysis of Isopulegol by Fourier Transform Molecular Rotational Spectroscopy
Evangelisti, Luca; Seifert, Nathan A.; Spada, Lorenzo; Pate, Brooks
2016-06-01
Chiral analysis on molecules with multiple chiral centers can be performed using pulsed-jet Fourier transform rotational spectroscopy. This analysis includes quantitative measurement of diastereomer products and, with the three wave mixing methods developed by Patterson, Schnell, and Doyle (Nature 497, 475-477 (2013)), quantitative determination of the enantiomeric excess of each diastereomer. The high resolution features enable to perform the analysis directly on complex samples without the need for chromatographic separation. Isopulegol has been chosen to show the capabilities of Fourier transform rotational spectroscopy for chiral analysis. Broadband rotational spectroscopy produces spectra with signal-to-noise ratio exceeding 1000:1. The ability to identify low-abundance (0.1-1%) diastereomers in the sample will be described. Methods to rapidly identify rotational spectra from isotopologues at natural abundance will be shown and the molecular structures obtained from this analysis will be compared to theory. The role that quantum chemistry calculations play in identifying structural minima and estimating their spectroscopic properties to aid spectral analysis will be described. Finally, the implementation of three wave mixing techniques to measure the enantiomeric excess of each diastereomer and determine the absolute configuration of the enantiomer in excess will be described.
Integrated optics in an electrically scanned imaging Fourier transform spectrometer
Breckinridge, James B. (Inventor); Ocallaghan, Fred G. (Inventor)
1982-01-01
An efficient, lightweight and stable, Fourier transform spectrometer was developed. The mechanical slide mechanism needed to create a path difference was eliminated by the use of retro-reflecting mirrors in a monolithic interferometer assembly in which the mirrors are not at 90 degrees to the propagation vector of the radiation, but rather at a small angle. The resulting plane wave fronts create a double-sided inteferogram of the source irradiance distribution which is detected by a charge-coupled device image sensor array. The position of each CCD pixel in the array is an indication of the path difference between the two retro-reflecting mirrors in the monolithic optical structure. The Fourier transform of the signals generated by the image sensor provide the spectral irradiance distribution of the source. For imaging, the interferometer assembly scans the source of irradiation by moving the entire instrument, such as would occur if it was fixedly mounted to a moving platform, i.e., a spacecraft. During scanning, the entrace slot to the monolithic optical structure sends different pixels to corresponding interferograms detected by adjacent columns of pixels of the image sensor.
[Fourier Transform Spectrometer Based on Rotating Parallel-Mirror-Pair].
Zhao, Bao-wei; Xiangli, Bin; Cai, Qi-sheng; Lü, Qun-bo; Zhou, Jin-song
2015-11-01
In the temporally-modulated Fourier transform spectroscopy, the translational moving mirror is difficult to drive accurately, causing tilt and shear problems. While, a rotational moving mirror can solve these problems. A rotary Fourier transform spectrometer is recommanded in this paper. Its principle is analyzed and the optical path difference is deduced. Also, the constrains for engineering realization are presented. This spectrometer consists of one beamsplitter, two fixed mirrors, one rotating parallel mirror pair, a collimating lens, a collecting lens, and one detector. From it's principle, this spectrometer show a simple structure, and it is assembled and adjustmented easily because the two split light are interfered with each other after reflected through the same plane mirror; By calculating the expression of it's optical path difference, the spectrometer is easy to realize large optical path difference, meaning high spectral resolution; Through analyzing it's engineering design constraints and computer simulation, it is known that the spectrometer should get the high resolution sample by high-speed spinning motor, so it is easy to achieve precise motion control, good stability, fast measurement speed.
Fourier-Transform Ghost Imaging with Hard X Rays
Yu, Hong; Lu, Ronghua; Han, Shensheng; Xie, Honglan; Du, Guohao; Xiao, Tiqiao; Zhu, Daming
2016-09-01
Knowledge gained through x-ray crystallography fostered structural determination of materials and greatly facilitated the development of modern science and technology in the past century. However, it is only applied to crystalline structures and cannot resolve noncrystalline materials. Here we demonstrate a novel lensless Fourier-transform ghost imaging method with pseudothermal hard x rays that extends x-ray crystallography to noncrystalline samples. By measuring the second-order intensity correlation function of the light, Fourier-transform diffraction pattern of a complex amplitude sample is achieved at the Fresnel region in our experiment and the amplitude and phase distributions of the sample in the spatial domain are retrieved successfully. For the first time, ghost imaging is experimentally realized with x rays. Since a highly coherent x-ray source is not required, the method can be implemented with laboratory x-ray sources and it also provides a potential solution for lensless diffraction imaging with fermions, such as neutrons and electrons where intensive coherent sources usually are not available.
Dai, Guang-Ming
2006-02-15
The set of Fourier series is discussed following some discussion of Zernike polynomials. Fourier transforms of Zernike polynomials are derived that allow for relating Fourier series expansion coefficients to Zernike polynomial expansion coefficients. With iterative Fourier reconstruction, Zernike representations of wavefront aberrations can easily be obtained from wavefront derivative measurements.
Periodic transonic flow simulation using fourier-based algorithm
Energy Technology Data Exchange (ETDEWEB)
Mohaghegh, Mohammad Reza [Islamic Azad University, Tehran (Iran, Islamic Republic of); Malekjafarian, Majid [University of Birjand, Birjand (Iran, Islamic Republic of)
2014-10-15
The present research simulates time-periodic unsteady transonic flow around pitching airfoils via the solution of unsteady Euler and Navier-Stokes equations, using time spectral method (TSM) and compares it with the traditional methods like BDF and explicit structured adaptive grid method. The TSM uses a Fourier representation in time and hence solves for the periodic state directly without resolving transients (which consume most of the resources in a time-accurate scheme). Mathematical tools used here are discrete Fourier transformations. The TSM has been validated with 2D external aerodynamics test cases. These test cases are NACA 64A010 (CT6) and NACA 0012 (CT1 and CT5) pitching airfoils. Because of turbulent nature of flow, Baldwin-Lomax turbulence model has been used in viscous flow analysis with large oscillation amplitude (CT5 type). The results presented by the TSM are compared with experimental data and the two other methods. By enforcing periodicity and using Fourier representation in time that has a spectral accuracy, tremendous reduction of computational cost has been obtained compared to the conventional time-accurate methods. Results verify the small number of time intervals per pitching cycle (just four time intervals) required to capture the flow physics with small oscillation amplitude (CT6) and large oscillation amplitude (CT5) as compared to the other two methods.
Experimental robustness of Fourier Ptychography phase retrieval algorithms
Yeh, Li-Hao; Zhong, Jingshan; Tian, Lei; Chen, Michael; Tang, Gongguo; Soltanolkotabi, Mahdi; Waller, Laura
2015-01-01
Fourier ptychography is a new computational microscopy technique that provides gigapixel-scale intensity and phase images with both wide field-of-view and high resolution. By capturing a stack of low-resolution images under different illumination angles, a nonlinear inverse algorithm can be used to computationally reconstruct the high-resolution complex field. Here, we compare and classify multiple proposed inverse algorithms in terms of experimental robustness. We find that the main sources of error are noise, aberrations and mis-calibration (i.e. model mis-match). Using simulations and experiments, we demonstrate that the choice of cost function plays a critical role, with amplitude-based cost functions performing better than intensity-based ones. The reason for this is that Fourier ptychography datasets consist of images from both brightfield and darkfield illumination, representing a large range of measured intensities. Both noise (e.g. Poisson noise) and model mis-match errors are shown to scale with int...
Ioup, G. E.; Ioup, J. W.
1985-01-01
Appendix 4 of the Study of One- and Two-Dimensional Filtering and Deconvolution Algorithms for a Streaming Array Computer discusses coordinate axes, location of origin, and redundancy for the one- and two-dimensional Fourier transform for complex and real data.
2014-10-09
Radon -Fractional Fourier Transform and Its Application to Radar Maneuvering Target Detection Xiaolong Chen*, Fuqing Cai, Yu Cong, Jian Guan...unit (ARU) and Doppler frequency migration (DFM) effects. In this paper, a novel transform called the Radon -fractional Fourier transform (RFRFT) is...are carried out and the performances of different methods including MTD, FRFT, and the Radon -Fourier transform (RFT) are compared, which demonstrate
A Fourier transform method for powder diffraction based on the Debye scattering equation.
Thomas, Noel William
2011-11-01
A fast Fourier transform algorithm is introduced into the method recently defined for calculating powder diffraction patterns by means of the Debye scattering equation (DSE) [Thomas (2010). Acta Cryst. A66, 64-77]. For this purpose, conventionally used histograms of interatomic distances are replaced by compound transmittance functions. These may be Fourier transformed to partial diffraction patterns, which sum to give the complete diffraction pattern. They also lead to an alternative analytical expression for the DSE sum, which reveals its convergence behaviour. A means of embedding the DSE approach within the reciprocal-lattice-structure-factor method is indicated, with interpolation methods for deriving the peak profiles of nanocrystalline materials outlined. Efficient calculation of transmittance functions for larger crystallites requires the Patterson group symmetry of the crystals to be taken into account, as shown for α- and β-quartz. The capability of the transmittance functions to accommodate stacking disorder is demonstrated by reference to kaolinite, with a fully analytical treatment of disorder described. Areas of future work brought about by these developments are discussed, specifically the handling of anisotropic atomic displacement parameters, inverse Fourier transformation and the incorporation of instrumental (diffractometer) parameters.
Energy Technology Data Exchange (ETDEWEB)
Bartosch, T. [Erlanger-Nuernberg Univ., Erlanger (Germany). Lehrstul fuer Nachrichtentechnik I; Seidl, D. [Seismologisches Zentralobservatorium Graefenberg, Erlanegen (Greece). Bundesanstalt fuer Geiwissenschaften und Rohstoffe
1999-06-01
Among a variety of spectrogram methods short-time Fourier transform (STFT) and continuous wavelet transform (CWT) were selected to analyse transients in non-stationary signals. Depending on the properties of the tremor signals from the volcanos Mt. Stromboli, Mt. Semeru and Mt. Pinatubo were analyzed using both methods. The CWT can also be used to extend the definition of coherency into a time-varying coherency spectrogram. An example is given using array data from the volcano Mt. Stromboli (Italy).
A new fast algorithm for computing a complex number: Theoretic transforms
Reed, I. S.; Liu, K. Y.; Truong, T. K.
1977-01-01
A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
Institute of Scientific and Technical Information of China (English)
FAN Hong-Yi
2004-01-01
We find quantum mechanical Fourier-Hankel representation transform for an electron moving in a uniform magnetic field. The physical meaning of Fourier decomposition states of electron's coordinate eigenstate and the momentum eigenstate are revealed.
Bladed wheels damage detection through Non-Harmonic Fourier Analysis improved algorithm
Neri, P.
2017-05-01
Recent papers introduced the Non-Harmonic Fourier Analysis for bladed wheels damage detection. This technique showed its potential in estimating the frequency of sinusoidal signals even when the acquisition time is short with respect to the vibration period, provided that some hypothesis are fulfilled. Anyway, previously proposed algorithms showed severe limitations in cracks detection at their early stage. The present paper proposes an improved algorithm which allows to detect a blade vibration frequency shift due to a crack whose size is really small compared to the blade width. Such a technique could be implemented for condition-based maintenance, allowing to use non-contact methods for vibration measurements. A stator-fixed laser sensor could monitor all the blades as they pass in front of the spot, giving precious information about the wheel health. This configuration determines an acquisition time for each blade which become shorter as the machine rotational speed increases. In this situation, traditional Discrete Fourier Transform analysis results in poor frequency resolution, being not suitable for small frequency shift detection. Non-Harmonic Fourier Analysis instead showed high reliability in vibration frequency estimation even with data samples collected in a short time range. A description of the improved algorithm is provided in the paper, along with a comparison with the previous one. Finally, a validation of the method is presented, based on finite element simulations results.
Fourier transform profilometry based on mean envelope extraction
Zhang, Xiaoxuan; Huang, Shujun; Gao, Nan; Zhang, Zonghua
2017-02-01
Based on an image pre-processing algorithm, a three-dimensional (3D) object measurement method is proposed by combining time domain and frequency domain analysis. Firstly, extreme points of sinusoidal fringes under the disturbance of noise are accurately extracted. Secondly, mean envelope of the fringe is obtained through appropriate interpolation method and then removed. Thirdly, phase information is extracted by using specific filtering in Fourier spectrum of the pre-processed fringe pattern. Finally, simulated and experimental results show a good property of the proposed method in accuracy and measurement range. The proposed method can achieve 3D shape of objects having large slopes and/or discontinuous surfaces from one-shot acquisition by using color fringe projection technique and will have wide applications in the fields of fast measurement.
Charge reversal Fourier transform ion cyclotron resonance mass spectrometry.
Lobodin, Vladislav V; Savory, Joshua J; Kaiser, Nathan K; Dunk, Paul W; Marshall, Alan G
2013-02-01
We report the first charge reversal experiments performed by tandem-in-time rather than tandem-in-space MS/MS. Precursor odd-electron anions from fullerene C(60), and even-electron ions from 2,7-di-tert-butylfluorene-9-carboxylic acid and 3,3'-bicarbazole were converted into positive product ions ((-)CR(+)) inside the magnet of a Fourier transform ion cyclotron resonance mass spectrometer. Charge reversal was activated by irradiating precursor ions with high energy electrons or UV photons: the first reported use of those activation methods for charge reversal. We suggest that high energy electrons achieve charge reversal in one step as double electron transfer, whereas UV-activated (-)CR(+) takes place stepwise through two single electron transfers and formally corresponds to a neutralization-reionization ((-)NR(+)) experiment.
Observing Extended Sources with the \\Herschel SPIRE Fourier Transform Spectrometer
Wu, Ronin; Etxaluze, Mireya; Makiwa, Gibion; Naylor, David A; Salji, Carl; Swinyard, Bruce M; Ferlet, Marc; van der Wiel, Matthijs H D; Smith, Anthony J; Fulton, Trevor; Griffin, Matt J; Baluteau, Jean-Paul; Benielli, Dominique; Glenn, Jason; Hopwood, Rosalind; Imhof, Peter; Lim, Tanya; Lu, Nanyao; Panuzzo, Pasquale; Pearson, Chris; Sidher, Sunil; Valtchanov, Ivan
2013-01-01
The Spectral and Photometric Imaging Receiver (SPIRE) on the European Space Agency's Herschel Space Observatory utilizes a pioneering design for its imaging spectrometer in the form of a Fourier Transform Spectrometer (FTS). The standard FTS data reduction and calibration schemes are aimed at objects with either a spatial extent much larger than the beam size or a source that can be approximated as a point source within the beam. However, when sources are of intermediate spatial extent, neither of these calibrations schemes is appropriate and both the spatial response of the instrument and the source's light profile must be taken into account and the coupling between them explicitly derived. To that end, we derive the necessary corrections using an observed spectrum of a fully extended source with the beam profile and the source's light profile taken into account. We apply the derived correction to several observations of planets and compare the corrected spectra with their spectral models to study the beam c...
Seismic Shear Energy Reflection By Radon-Fourier Transform
Directory of Open Access Journals (Sweden)
Malik Umairia
2016-01-01
Full Text Available Seismic waves split in an anisotropic medium, instead of rotating horizontal component to principal direction, Radon-Fourier is derived to observe the signature of shear wave reflection. Synthetic model with fracture is built and discretized using finite difference scheme for spatial and time domain. Common depth point (CDP with single shot gives traces and automatic gain is preprocessed before Radon Transform (RT, a filtering technique gives radon domain. It makes easier to observe fractures at specific incidence and improves its quality in some way by removing the noise. A comparison of synthetic data and BF-data is performed on the basis of root means square error (RMS values. The RMS error is minimum at the 10th trace in radon domain.
Mid-Infrared Frequency Comb Fourier Transform Spectrometer
Adler, Florian; Foltynowicz, Aleksandra; Cossel, Kevin C; Briles, Travis C; Hartl, Ingmar; Ye, Jun
2010-01-01
Optical frequency-comb-based-high-resolution spectrometers offer enormous potential for spectroscopic applications. Although various implementations have been demonstrated, the lack of suitable mid-infrared comb sources has impeded explorations of molecular fingerprinting. Here we present for the first time a frequency-comb Fourier transform spectrometer operating in the 2100-to-3700-cm-1 spectral region that allows fast and simultaneous acquisitions of broadband absorption spectra with up to 0.0056 cm-1 resolution. We demonstrate part-per-billion detection limits in 30 seconds of integration time for various important molecules including methane, ethane, isoprene, and nitrous oxide. Our system enables precise concentration measurements even in gas mixtures that exhibit continuous absorption bands, and it allows detection of molecules at levels below the noise floor via simultaneous analysis of multiple spectral features. This system represents a near real-time, high-resolution, high-bandwidth mid-infrared sp...
Persian Sign Language Recognition Using Radial Distance and Fourier Transform
Directory of Open Access Journals (Sweden)
Bahare Jalilian
2013-11-01
Full Text Available This paper provides a novel hand gesture recognition method to recognize 32 static signs of the Persian Sign Language (PSL alphabets. Accurate hand segmentation is the first and important step in sign language recognition systems. Here, we propose a method for hand segmentation that helps to build a better vision based sign language recognition system. The proposed method is based on YCbCr color space, single Gaussian model and Bayes rule. It detects region of hand in complex background and non-uniform illumination. Hand gesture features are extracted by radial distance and Fourier transform. Finally, the Euclidean distanceis used to compute the similarity between the input signs and all training feature vectors in the database. The system is tested on 480 posture images of the PSL, 15 images for each 32 signs. Experimental results show that our approach is capable to recognize all 32 PSL alphabets with 95.62% recognition rate.
A rheumatoid arthritis study by Fourier transform infrared spectroscopy
Carvalho, Carolina S.; Silva, Ana Carla A.; Santos, Tatiano J. P. S.; Martin, Airton A.; dos Santos Fernandes, Ana Célia; Andrade, Luís E.; Raniero, Leandro
2012-01-01
Rheumatoid arthritis is a systemic inflammatory disease of unknown causes and a new methods to identify it in early stages are needed. The main purpose of this work is the biochemical differentiation of sera between normal and RA patients, through the establishment of a statistical method that can be appropriately used for serological analysis. The human sera from 39 healthy donors and 39 rheumatics donors were collected and analyzed by Fourier Transform Infrared Spectroscopy. The results show significant spectral variations with p<0.05 in regions corresponding to protein, lipids and immunoglobulins. The technique of latex particles, coated with human IgG and monoclonal anti-CRP by indirect agglutination known as FR and CRP, was performed to confirm possible false-negative results within the groups, facilitating the statistical interpretation and validation of the technique.
Lamellar grating optimization for miniaturized fourier transform spectrometers.
Ferhanoglu, Onur; Seren, Hüseyin R; Lüttjohann, Stephan; Urey, Hakan
2009-11-09
Microfabricated Lamellar grating interferometers (LGI) require fewer components compared to Michelson interferotemeters and offer compact and broadband Fourier transform spectrometers (FTS) with good spectral resolution, high speed and high efficiency. This study presents the fundamental equations that govern the performance and limitations of LGI based FTS systems. Simulations and experiments were conducted to demonstrate and explain the periodic nature of the interferogram envelope due to Talbot image formation. Simulations reveal that the grating period should be chosen large enough to avoid Talbot phase reversal at the expense of mixing of the diffraction orders at the detector. Optimal LGI grating period selection depends on a number of system parameters and requires compromises in spectral resolution and signal-to-bias ratio (SBR) of the interferogram within the spectral range of interest. New analytical equations are derived for spectral resolution and SBR of LGI based FTS systems.
Spatially Resolved Fourier Transform Spectroscopy in the Extreme Ultraviolet
Jansen, G S M; Freisem, L; Eikema, K S E; Witte, S
2016-01-01
Coherent extreme ultraviolet (XUV) radiation produced by table-top high-harmonic generation (HHG) sources provides a wealth of possibilities in research areas ranging from attosecond physics to high resolution coherent imaging. However, it remains challenging to fully exploit the coherence of such sources for interferometry and Fourier transform spectroscopy (FTS). This is due to the need for a measurement system that is stable at the level of a wavelength fraction, yet allowing a controlled scanning of time delays. Here we demonstrate XUV interferometry and FTS in the 17-55 nm wavelength range using an ultrastable common-path interferometer suitable for high-intensity laser pulses that drive the HHG process. This approach enables the generation of fully coherent XUV pulse pairs with sub-attosecond timing variation, tunable time delay and a clean Gaussian spatial mode profile. We demonstrate the capabilities of our XUV interferometer by performing spatially resolved FTS on a thin film composed of titanium and...
The RC Circuit: An Approach with Fourier Transforms
Indian Academy of Sciences (India)
2016-11-01
In this article we shall mathematically analyse the Resistor-Capacitor (RC) circuit with the help of Fourier transforms(FT). This very general technique gives us a lot of insight intosolving first order differential equations with source terms dependingon time. In itself, the RC circuit is by far the mostcommonplace entity in modern electronics. But the method ofFT is not the accepted custom for an electronic engineer, whois probably more comfortable working with complex impedancesand phasors while solving problems in network analysis.In fact, what is used much more extensively is the Laplacetransform. But a lot of things, (including the complex impedanceitself, and some insight into complex analysis) can be understoodbetter if we use the FT approach to solve the differentialequations that come up in network analysis. The use of FTcomes smoothly from first principles – precisely what we setout to demonstrate here.
Wide-Field Detected Fourier Transform CARS Microscopy
Duarte, Alex Soares; Schnedermann, Christoph; Kukura, Philipp
2016-11-01
We present a wide-field imaging implementation of Fourier transform coherent anti-Stokes Raman scattering (wide-field detected FT-CARS) microscopy capable of acquiring high-contrast label-free but chemically specific images over the full vibrational ‘fingerprint’ region, suitable for a large field of view. Rapid resonant mechanical scanning of the illumination beam coupled with highly sensitive, camera-based detection of the CARS signal allows for fast and direct hyperspectral wide-field image acquisition, while minimizing sample damage. Intrinsic to FT-CARS microscopy, the ability to control the range of time-delays between pump and probe pulses allows for fine tuning of spectral resolution, bandwidth and imaging speed while maintaining full duty cycle. We outline the basic principles of wide-field detected FT-CARS microscopy and demonstrate how it can be used as a sensitive optical probe for chemically specific Raman imaging.
Microscope system with on axis programmable Fourier transform filtering
Martínez, José Luis; García-Martínez, Pascuala; Moreno, Ignacio
2017-02-01
We propose an on-axis microscope optical system to implement programmable optical Fourier transform image processing operations, taking advantage of phase and polarization modulation of a liquid crystal on silicon (LCOS) display. We use a Hamamatsu spatial light modulator (SLM), free of flickering, which therefore can be tuned to fully eliminate the zero order component of the encoded diffractive filter. This allows the realization of filtering operation on axis (as opposed to other systems in the literature that require operating off axis), therefore making use of the full space bandwidth provided by the SLM. The system is first demonstrated by implementing different optical processing operations based on phase-only blazed gratings such as phase contrast, band-pass filtering, or additive and substractive imaging. Then, a simple Differential interference contrast (DIC) imaging is obtained changing to a polarization modulation scheme, achieved simply by selecting a different incident state of polarization on the incident beam.
Motion saliency detection using a temporal fourier transform
Chen, Zhe; Wang, Xin; Sun, Zhen; Wang, Zhijian
2016-06-01
Motion saliency detection aims at detecting the dynamic semantic regions in a video sequence. It is very important for many vision tasks. This paper proposes a new type of motion saliency detection method, Temporal Fourier Transform, for fast motion saliency detection. Different from conventional motion saliency detection methods that use complex mathematical models or features, variations in the phase spectrum of consecutive frames are identified and extracted as the key to obtaining the location of salient motion. As all the calculation is made on the temporal frequency spectrum, our model is independent of features, background models, or other forms of prior knowledge about scenes. The benefits of the proposed approach are evaluated for various videos where the number of moving objects, illumination, and background are all different. Compared with some the state of the art methods, our method achieves both good accuracy and fast computation.
High-Throughput Screening Using Fourier-Transform Infrared Imaging
Directory of Open Access Journals (Sweden)
Erdem Sasmaz
2015-06-01
Full Text Available Efficient parallel screening of combinatorial libraries is one of the most challenging aspects of the high-throughput (HT heterogeneous catalysis workflow. Today, a number of methods have been used in HT catalyst studies, including various optical, mass-spectrometry, and gas-chromatography techniques. Of these, rapid-scanning Fourier-transform infrared (FTIR imaging is one of the fastest and most versatile screening techniques. Here, the new design of the 16-channel HT reactor is presented and test results for its accuracy and reproducibility are shown. The performance of the system was evaluated through the oxidation of CO over commercial Pd/Al2O3 and cobalt oxide nanoparticles synthesized with different reducer-reductant molar ratios, surfactant types, metal and surfactant concentrations, synthesis temperatures, and ramp rates.
Short-time Fourier transform laser Doppler holography
Atlan, Michael
2012-01-01
We report a demonstration of laser Doppler holography at a sustained acquisition rate of 250 Hz on a 1 Megapixel complementary metal-oxide-semiconductor (CMOS) sensor array and image display at 10 Hz frame rate. The holograms are optically acquired in off-axis configuration, with a frequency-shifted reference beam. Wide-field imaging of optical fluctuations in a 250 Hz frequency band is achieved by turning time-domain samplings to the dual domain via short-time temporal Fourier transformation. The measurement band can be positioned freely within the low radio-frequency spectrum by tuning the frequency of the reference beam in real-time. Video-rate image rendering is achieved by streamline image processing with commodity computer graphics hardware. This experimental scheme is validated by a non-contact vibrometry experiment.
Instrument concept of the imaging Fourier transform spectrometer GLORIA
Directory of Open Access Journals (Sweden)
F. Friedl-Vallon
2014-10-01
Full Text Available The Gimballed Limb Observer for Radiance Imaging of the Atmosphere (GLORIA is an imaging limb emission sounder operating in the thermal infrared region. It is designed to provide measurements of the upper troposphere/lower stratosphere with high spatial and high spectral resolution. The instrument consists of an imaging Fourier transform spectrometer integrated into a gimbal. The assembly can be mounted in the belly pod of the German High Altitude and Long Range research aircraft (HALO and in instrument bays of the Russian M55 Geophysica. Measurements are made in two distinct modes: the chemistry mode emphasises chemical analysis with high spectral resolution, and the dynamics mode focuses on dynamical processes of the atmosphere with very high spatial resolution. In addition, the instrument allows tomographic analyses of air volumes. The first measurement campaigns have shown compliance with key performance and operational requirements.
Optical design of the ATMOS Fourier transform spectrometer
Abel, I. R.; Reynolds, B. R.; Breckinridge, J. B.; Pritchard, J.
1979-01-01
The optical system design of the ATMOS Fourier transform spectrometer to be operated from Spacelab for the measurement of stratospheric trace molecules is described. The design contains features which can achieve the required fringe contrast of 80% and spectral resolution of 0.02/cm over a spectral range of 2-16 microns. In particular, the design is based on the following features which alleviate the usual requirements for alignment precision: (1) 'cat's eye' mirror configuration in the two arms of the interferometer for retroreflection stability, (2) tilt-compensated system of beamsplitter, compensator, and fold mirrors for wavefront directional stability, (3) paraboloidal 'cat's eye' primary mirror for wavefront stability against shear, (4) rotatable compensator for matching chromatic dispersion, and (5) wedged refractive components to avoid channel spectra due to the Fabry-Perot effect.
Calibration of the Geostationary Imaging Fourier Transform Spectrometer (GIFTS)
Best, F. A.; Revercomb, H. E.; Bingham, G. E.; Knuteson, R. O.; Tobin, D. C.; LaPorte, D. D.; Smith, W. L.
2001-01-01
The NASA New Millennium Program's Geostationary Imaging Fourier Transform Spectrometer (GIFTS) requires highly accurate radiometric and spectral calibration in order to carry out its mission to provide water vapor, wind, temperature, and trace gas profiling from geostationary orbit. A calibration concept has been developed for the GIFTS Phase A instrument design. The in-flight calibration is performed using views of two on-board blackbody sources along with cold space. A radiometric calibration uncertainty analysis has been developed and used to show that the expected performance for GIFTS exceeds its top level requirement to measure brightness temperature to better than 1 K. For the Phase A GIFTS design, the spectral calibration is established by the highly stable diode laser used as the reference for interferogram sampling, and verified with comparisons to atmospheric calculations.
A direct digital synthesis chirped pulse Fourier transform microwave spectrometer.
Finneran, Ian A; Holland, Daniel B; Carroll, P Brandon; Blake, Geoffrey A
2013-08-01
Chirped pulse Fourier transform microwave (CP-FTMW) spectrometers have become the instrument of choice for acquiring rotational spectra, due to their high sensitivity, fast acquisition rate, and large bandwidth. Here we present the design and capabilities of a recently constructed CP-FTMW spectrometer using direct digital synthesis (DDS) as a new method for chirped pulse generation, through both a suite of extensive microwave characterizations and deep averaging of the 10-14 GHz spectrum of jet-cooled acetone. The use of DDS is more suited for in situ applications of CP-FTMW spectroscopy, as it reduces the size, weight, and power consumption of the chirp generation segment of the spectrometer all by more than an order of magnitude, while matching the performance of traditional designs. The performance of the instrument was further improved by the use of a high speed digitizer with dedicated signal averaging electronics, which facilitates a data acquisition rate of 2.1 kHz.
A Fourier transform Raman spectrometer with visible laser excitation
Dzsaber, S; Bernáth, B; Gyüre, B; Fehér, T; Kramberger, C; Pichler, T; Simon, F
2014-01-01
We present the development and performance of a Fourier transformation (FT) based Raman spectrometer working with visible laser (532 nm) excitation. It is generally thought that FT-Raman spectrometers are not viable in the visible range where shot-noise limits the detector performance and therein they are outperformed by grating based, dispersive ones. We show that contrary to this common belief, the recent advances of high-performance interference filters makes the FT-Raman design a valid alternative to dispersive Raman spectrometers for samples which do not luminesce. We critically compare the performance of our spectrometer to two dispersive ones: a home-built single channel and a state-of-the-art CCD based instruments. We demonstrate a similar or even better sensitivity than the CCD based dispersive spectrometer particularly when the laser power density is considered. The instrument possesses all the known advantages of the FT principle of spectral accuracy, high throughput, and economic design. We also d...
[Influence of collimation system on static Fourier transform spectrometer].
Jiang, Cheng-Zhi; Liang, Jing-Qiu; Liang, Zhong-Zhu; Sun, Qiang; Wang, Wei-Biao
2014-01-01
Collimation system provides collimated light for the static Fourier-transform spectroscopy (SFTS). Its quality is crucial to the signal to noise ratio (SNR) of SFTS. In the present paper, the physical model of SFTS was established based on the Fresnel diffraction theory by means of numerical software. The influence of collimation system on the SFTS was discussed in detail focusing on the aberrations of collimation lens and the quality of extended source. The results of simulation show that the influences of different kinds of aberrations on SNR take on obvious regularity, and in particular, the influences of off-axis aberrations on SNR are closely related to the location of off-axis point source. Finally the extended source's maximum radius allowed was obtained by simulation, which equals to 0.65 mm. The discussion results will be used for the design of collimation system.
How to tickle spins with a fourier transform NMR spectrometer.
Segawa, Takuya F; Carnevale, Diego; Bodenhausen, Geoffrey
2013-02-01
In the long bygone days of continuous-wave nuclear magnetic resonance (NMR) spectroscopy, a selected transition within a multiplet of a high-resolution spectrum could be irradiated by a highly selective continuous-wave (CW) radio-frequency (rf) field with a very weak amplitude ω(2)/(2π)≤J. This causes splittings of connected transitions, allowing one to map the connectivities of all transitions within the energy-level diagram of the spin system. Such "tickling" experiments stimulated the invention of two-dimensional spectroscopy, but seem to have been forgotten for nearly 50 years. We show that tickling can readily be achieved in homonuclear systems with Fourier transform spectrometers by applying short pulses in the intervals between the sampling points. Extensions to heteronuclear systems are even more straightforward since they can be carried out using very weak CW rf fields.
Indirect Fourier transform in the context of statistical inference.
Muthig, Michael; Prévost, Sylvain; Orglmeister, Reinhold; Gradzielski, Michael
2016-09-01
Inferring structural information from the intensity of a small-angle scattering (SAS) experiment is an ill-posed inverse problem. Thus, the determination of a solution is in general non-trivial. In this work, the indirect Fourier transform (IFT), which determines the pair distance distribution function from the intensity and hence yields structural information, is discussed within two different statistical inference approaches, namely a frequentist one and a Bayesian one, in order to determine a solution objectively From the frequentist approach the cross-validation method is obtained as a good practical objective function for selecting an IFT solution. Moreover, modern machine learning methods are employed to suppress oscillatory behaviour of the solution, hence extracting only meaningful features of the solution. By comparing the results yielded by the different methods presented here, the reliability of the outcome can be improved and thus the approach should enable more reliable information to be deduced from SAS experiments.
OCTAD-S: digital fast Fourier transform spectrometers by FPGA
Iwai, Kazumasa; Kubo, Yûki; Ishibashi, Hiromitsu; Naoi, Takahiro; Harada, Kenichi; Ema, Kenji; Hayashi, Yoshinori; Chikahiro, Yuichi
2017-07-01
We have developed a digital fast Fourier transform spectrometer made of an analog-to-digital converter (ADC) and a field-programmable gate array (FPGA). The base instrument has independent ADC and FPGA modules, which allow us to implement different spectrometers in a relatively easy manner. Two types of spectrometers have been instrumented: one with 4.096 GS/s sampling speed and 2048 frequency channels and the other with 2.048 GS/s sampling speed and 32,768 frequency channels. The signal processing in these spectrometers has no dead time, and the accumulated spectra are recorded in external media every 8 ms. A direct sampling spectroscopy up to 8 GHz is achieved by a microwave track-and-hold circuit, which can reduce the analog receiver in front of the spectrometer. Highly stable spectroscopy with a wide dynamic range was demonstrated in a series of laboratory experiments and test observations of solar radio bursts.
Institute of Scientific and Technical Information of China (English)
陈鹏; 侯朝焕; 梁亦慧; 马晓川
2007-01-01
为满足在数字信号处理器DSP(digital signal processor)上进行离散分数阶傅里叶变换DFRFT(discrete fractional fourier transform) 实时计算的要求,通过对多种DFRFT计算方法进行比较,选择Ozaktas提出的DFRFT快速算法进行基于DSP的详细实现处理.在对该快速算法进行理论分析的基础上,将快速算法的计算过程进行优化配置,并给出完整的计算量统计结果.在保证精度要求的情况下,提出的详细实现方法将快速算法的实数乘法计算量减至最小.工程实际应用表明:该方法满足DSP运算精度和实时性要求.
Adaptive Controller for Compact Fourier Transform Spectrometer with Space Applications
Keymeulen, D.; Yiu, P.; Berisford, D. F.; Hand, K. P.; Carlson, R. W.; Conroy, M.
2014-12-01
Here we present noise mitigation techniques developed as part of an adaptive controller for a very compact Compositional InfraRed Interferometric Spectrometer (CIRIS) implemented on a stand-alone field programmable gate array (FPGA) architecture with emphasis on space applications in high radiation environments such as Europa. CIRIS is a novel take on traditional Fourier Transform Spectrometers (FTS) and replaces linearly moving mirrors (characteristic of Michelson interferometers) with a constant-velocity rotating refractor to variably phase shift and alter the path length of incoming light. The design eschews a monochromatic reference laser typically used for sampling clock generation and instead utilizes constant time-sampling via internally generated clocks. This allows for a compact and robust device, making it ideal for spaceborne measurements in the near-IR to thermal-IR band (2-12 µm) on planetary exploration missions. The instrument's embedded microcontroller is implemented on a VIRTEX-5 FPGA and a PowerPC with the aim of sampling the instrument's detector and optical rotary encoder in order to construct interferograms. Subsequent onboard signal processing provides spectral immunity from the noise effects introduced by the compact design's removal of a reference laser and by the radiation encountered during space flight to destinations such as Europa. A variety of signal processing techniques including resampling, radiation peak removal, Fast Fourier Transform (FFT), spectral feature alignment, dispersion correction and calibration processes are applied to compose the sample spectrum in real-time with signal-to-noise-ratio (SNR) performance comparable to laser-based FTS designs in radiation-free environments. The instrument's FPGA controller is demonstrated with the FTS to characterize its noise mitigation techniques and highlight its suitability for implementation in space systems.
Institute of Scientific and Technical Information of China (English)
Chujun Zheng; Peng Han; Hongsen Chang
2006-01-01
@@ A new one-step four-quadrant spatial phase-shifting Fourier transform digital holography is presented for recording of cosine transform coefficients, because cosine transform is a real-even symmetric Fourier transform. This approach implements four quadrant spatial phase shifting at a time using a special phase mask, which is located in the reference arm, and the phase distributions of its four-quadrants are 0, π/2, π,and 3π/2 respectively. The theoretical analysis and computer simulation results show that cosine transform coefficients of real-valued image can be calculated by capturing single four-quadrant spatial phase-shifting Fourier transform digital hologram.
A new BP Fourier algorithm and its application in English teaching evaluation
Pei, Xuehui; Pei, Guixin
2017-08-01
BP neural network algorithm has wide adaptability and accuracy when used in complicated system evaluation, but its calculation defects such as slow convergence have limited its practical application. The paper tries to speed up the calculation convergence of BP neural network algorithm with Fourier basis functions and presents a new BP Fourier algorithm for complicated system evaluation. First, shortages and working principle of BP algorithm are analyzed for subsequent targeted improvement; Second, the presented BP Fourier algorithm adopts Fourier basis functions to simplify calculation structure, designs new calculation transfer function between input and output layers, and conducts theoretical analysis to prove the efficiency of the presented algorithm; Finally, the presented algorithm is used in evaluating university English teaching and the application results shows that the presented BP Fourier algorithm has better performance in calculation efficiency and evaluation accuracy and can be used in evaluating complicated system practically.
Potential-Field Forward Modeling and Inversion Using 3D Fast Fourier Transforms
Phillips, J. D.; Caratori Tontini, F.; Cocchi, L.
2008-12-01
Although 1D and 2D fast Fourier transforms (FFTs) have long been used for the filtering, interpretation, and modeling of potential-field data, 3D FFTs have not enjoyed similar popularity. This may change with the recent discovery (Caratori Tontini et al., in press, JGR) that simple 3D FFT filters can be used to transform distributions of density (or magnetization) within a box-shaped 3D volume into gravity (or magnetic) fields within the same volume. For example, the continuous 3D Fourier transform of the vertical gravity anomaly Δgz(x,y,z) in a volume is related to the 3D Fourier transform of the density ρ(x,y,z) in the volume by ℑ[Δgz] = i4πG(kz/ | k | 2)ℑ[ρ]; | k | ≠0, (1) where G is the gravitational constant, kx, ky, kz are wavenumbers, and | k | 2 = kx2+ ky2+ kz2. (2) Translating (1) into a digital FFT filtering operation requires careful consideration of the periodicity of the density distribution and the gravity field. Nevertheless, (1) provides a highly efficient way to calculate the vertical gravity anomaly of a 3D density distribution within a few minutes. The calculated gravity anomaly can be sampled at random points or on an arbitrary surface using tri-linear interpolation. An equivalent space- domain calculation of the gravity field on an arbitrary surface can take many hours. The inverse relation to (1) does not appear to offer a practical approach for calculating a reliable density distribution from observed gravity data. This is because the data would have to cover a substantial portion of the model volume, and because the transformation is undefined on the plane kz = 0, where both the denominator of the filter kernel and the Fourier transform of the gravity field are identically zero. Numerical experiments show that the density distribution resulting from the power on the plane kz = 0 represents a classic Parker annihilator. This annihilator can be calculated from the density distribution but not from the gravity field, as would be
2014-09-18
DEVELOPMENT OF IMAGING FOURIER -TRANSFORM SPECTROSCOPY FOR THE CHARACTERIZATION OF TURBULENT JET FLAMES DISSERTATION Jacob L. Harley, Captain, USAF...work of the U.S. Government and is not subject to copyright protection in the United States. AFIT-ENP-DS-14-S-13 DEVELOPMENT OF IMAGING FOURIER -TRANSFORM...DISTRIBUTION UNLIMITED AFIT-ENP-DS-14-S-13 DEVELOPMENT OF IMAGING FOURIER -TRANSFORM SPECTROSCOPY FOR THE CHARACTERIZATION OF TURBULENT JET FLAMES Jacob L
Directory of Open Access Journals (Sweden)
Chiu Shen
2005-01-01
Full Text Available A relatively unknown yet powerful technique, the so-called fractional Fourier transform (FrFT, is applied to SAR along-track interferometry (SAR-ATI in order to estimate moving target parameters. By mapping a target's signal onto a fractional Fourier axis, the FrFT permits a constant-velocity target to be focused in the fractional Fourier domain thereby affording orders of magnitude improvement in SCR. Moving target velocity and position parameters are derived and expressed in terms of an optimum fractional angle and a measured fractional Fourier position , allowing a target to be accurately repositioned and its velocity components computed without actually forming an SAR image. The new estimation algorithm is compared with the matched filter bank approach, showing some of the advantages of the FrFT method. The proposed technique is applied to the data acquired by the two-aperture CV580 airborne radar system configured in its along-track mode. Results show that the method is effective in estimating target velocity and position parameters.
Fourier transform Raman approach to structural correlation in hemoglobin derivatives.
Venkatesh, B; Ramasamy, S; Mylrajan, M; Asokan, R; Manoharan, P T; Rifkind, J M
1999-07-01
In order to obtain information on the structural aspects of hemoglobin (Hb), Fourier transform Raman (FT-R) measurements on various ferrous, ferric derivatives and nickel reconstituted Hb (NiHb) has been made. FT-R spectra for these derivatives were obtained by laser excitation in the near infrared region (NIR) (1064 nm) whereby the wave-number region (600-1700 cm-1) related to both porphyrin ring modes and some globin modes were monitored. Comparison of various modes was made based on previous resonance Raman (RR) results. The wave-number shifts with respect to changes in oxidation state and spin state are very similar to those observed by RR. Additional bands at 1654, 1459, and 1003 cm-1 for deoxyHb and at 1656, 1454, and 1004 cm-1 for oxy Hb can be correlated to globin modes. The shift in the position of these bands for the binding of oxygen can be related to changes in conformation during the transformation. The presence of two distinct sites in NiHb could be monitored by the use of FT-R technique.
National Research Council Canada - National Science Library
van Agthoven, Maria A; Barrow, Mark P; Chiron, Lionel; Coutouly, Marie-Aude; Kilgour, David; Wootton, Christopher A; Wei, Juan; Soulby, Andrew; Delsuc, Marc-André; Rolando, Christian; O’Connor, Peter B
2015-01-01
...) Fourier transform ion cyclotron resonance mass spectrometry. In the resulting 2D mass spectrum, the fragmentation patterns of the radical and protonated species from cholesterol are differentiated...
Zhang, Mingjing; Wen, Ming; Zhang, Zhi-Min; Lu, Hongmei; Liang, Yizeng; Zhan, Dejian
2015-03-01
Retention time shift is one of the most challenging problems during the preprocessing of massive chromatographic datasets. Here, an improved version of the moving window fast Fourier transform cross-correlation algorithm is presented to perform nonlinear and robust alignment of chromatograms by analyzing the shifts matrix generated by moving window procedure. The shifts matrix in retention time can be estimated by fast Fourier transform cross-correlation with a moving window procedure. The refined shift of each scan point can be obtained by calculating the mode of corresponding column of the shifts matrix. This version is simple, but more effective and robust than the previously published moving window fast Fourier transform cross-correlation method. It can handle nonlinear retention time shift robustly if proper window size has been selected. The window size is the only one parameter needed to adjust and optimize. The properties of the proposed method are investigated by comparison with the previous moving window fast Fourier transform cross-correlation and recursive alignment by fast Fourier transform using chromatographic datasets. The pattern recognition results of a gas chromatography mass spectrometry dataset of metabolic syndrome can be improved significantly after preprocessing by this method. Furthermore, the proposed method is available as an open source package at https://github.com/zmzhang/MWFFT2.
[Biological Process Oriented Online Fourier Transform Infrared Spectrometer].
Xie, Fei; Wu, Qiong-shui; Zeng, Li-bo
2015-08-01
An online Fourier Transform Infrared Spectrometer and an ATR (Attenuated Total Reflection) probe, specifically at the application of real time measurement of the reaction substrate concentration in biological processes, were designed. (1) The spectrometer combined the theories of double cube-corner reflectors and flat mirror, which created a kind of high performance interferometer system. The light path folding way was utilized to makes the interferometer compact structure. Adopting double cube-corner reflectors, greatly reduces the influence of factors in the process of moving mirror movement such as rotation, tilt, etc. The parallelogram oscillation flexible support device was utilized to support the moving mirror moves. It cancelled the friction and vibration during mirror moving, and ensures the smooth operation. The ZnSe splitter significantly improved the hardware reliability in high moisture environment. The method of 60° entrance to light splitter improves the luminous flux. (2) An ATR in situ measuring probe with simple structure, large-flux, economical and practical character was designed in this article. The transmission of incident light and the light output utilized the infrared pipe with large diameter and innerplanted-high plating membrane, which conducted for the infrared transmission media of ATR probe. It greatly reduced the energy loss of infrared light after multiple reflection on the inner wall of the light pipe. Therefore, the ATR probe obtained high flux, improved the signal strength, which make the signal detected easily. Finally, the high sensitivity of MCT (Mercury Cadmium Telluride) detector was utilized to realize infrared interference signal collection, and improved the data quality of detection. The test results showed that the system yields the advantages of perfect moisture-proof performance, luminous flux, online measurement, etc. The designed online Fourier infrared spectrometer can real-time measured common reactant substrates
Institute of Scientific and Technical Information of China (English)
Wang Chuandan; Zhang Zhongpei; Li Shaoqian
2007-01-01
The method of FRactional Fourier Transform (FRFT) is introduced to Transform Domain Communication System (TDCS) for signal transforming in the paper after theoretical analysis. The method yields optimal Basis Function (BF) by FRFT with optimal transform angle. The TDCS using the proposed method has wider usable spectrum, stronger robustness and better ability of anti non-stationary jamming than using usual methods, such as Fourier Transform (FT), Auto Regressive (AR), Wavelet Transform (WT), etc. The main simulation results are as follows. First, the Bit Error Rate (BER) Pb is close to theoretical bound of no jamming no matter in single tone or in linear chirp interference. Second, the interference-to-signal ratio J/E is at least 12dB more than that of Direct Spread Spectrum System (DSSS) under the same BER if the spectrum hopping-to-signal ratio is 1:20 in chirp plus hopping interfering. Third, the Eb/No (when estimation difference is 90% between transmitter and receiver) is about 3.5dB or about 0.5dB (when estimation difference is 10% between transmitter and receiver) more than that of theoretical result when no estimation difference under Pb = 10-2.
New Algorithm For Calculating Wavelet Transforms
Directory of Open Access Journals (Sweden)
Piotr Lipinski
2009-04-01
Full Text Available In this article we introduce a new algorithm for computing Discrete Wavelet Transforms (DWT. The algorithm aims at reducing the number of multiplications, required to compute a DWT. The algorithm is general and can be used to compute a variety of wavelet transform (Daubechies and CDF. Here we focus on CDF 9/7 filters, which are used in JPEG2000 compression standard. We show that the algorithm outperforms convolution-based and lifting-based algorithms in terms of number of multiplications.
Comparison of fast discrete wavelet transform algorithms
Institute of Scientific and Technical Information of China (English)
MENG Shu-ping; TIAN Feng-chun; XU Xin
2005-01-01
This paper presents an analysis on and experimental comparison of several typical fast algorithms for discrete wavelet transform (DWT) and their implementation in image compression, particularly the Mallat algorithm, FFT-based algorithm, Short-length based algorithm and Lifting algorithm. The principles, structures and computational complexity of these algorithms are explored in details respectively. The results of the experiments for comparison are consistent to those simulated by MATLAB. It is found that there are limitations in the implementation of DWT. Some algorithms are workable only for special wavelet transform, lacking in generality. Above all, the speed of wavelet transform, as the governing element to the speed of image processing, is in fact the retarding factor for real-time image processing.
Suto, Hiroshi; Yoshida, Jun; Desbiens, Raphael; Kawashima, Takahiro; Kuze, Akihiko
2013-07-10
Microvibrations onboard greenhouse gases observing satellite (GOSAT) cause scan speed variations in the TANSO Fourier transform spectrometer. The associated periodic sampling errors generate ghost features in O2 A-band spectra, where surface pressure and aerosol properties are retrieved to determine the optical path through the atmosphere. A correction algorithm has been developed to re-compute the interferograms at equally spaced sampling intervals. The key is to determine iteratively the amplitude and phase of sinusoidal perturbations with predetermined frequencies to minimize the magnitude of the out-of-band ghosts artifacts after correction of the sampling grid. This correction algorithm drastically reduces errors in retrieved surface pressure and improves agreement with ground-based observations.
An automatic frequency control loop using overlapping DFTs (Discrete Fourier Transforms)
Aguirre, S.
1988-01-01
An automatic frequency control (AFC) loop is introduced and analyzed in detail. The new scheme is a generalization of the well known Cross Product AFC loop that uses running overlapping discrete Fourier transforms (DFTs) to create a discriminator curve. Linear analysis is included and supported with computer simulations. The algorithm is tested in a low carrier to noise ratio (CNR) dynamic environment, and the probability of loss of lock is estimated via computer simulations. The algorithm discussed is a suboptimum tracking scheme with a larger frequency error variance compared to an optimum strategy, but offers simplicity of implementation and a very low operating threshold CNR. This technique can be applied during the carrier acquisition and re-acquisition process in the Advanced Receiver.
Analytical model and spectral correction of vibration effects on Fourier transform spectrometer
Shatalina, Irina; Schmidt, Frederic; Saggin, Bortolino; Gac, Nicolas; Kowalski, Matthieu; Giuranna, Marco
2013-10-01
Sensitivity to mechanical vibrations of Fourier Transform Spectrometers (FTS) is a well-known phenomenon. It is especially critical for FTS devoted to atmospheric studies (like the Planetary Fourier Spectrometer (PFS) onboard Mars Express 2003), as absorption bands for the gases of low concentration are comparable with the generated instrument spectral noise. The adopted techniques for the vibration sensitivity reduction suffer of limitations in practical implementation, leaving residual modulations of the interferogram and the so-called ghosts in the spectra. Moreover as it is often impossible to measure the vibrations during the FTS measurement, the position and magnitude of these ghosts cannot be evaluated. Up to now the adopted ghost reduction techniques are mostly based on the averaging of spectra, because the disturbance phase is randomly distributed. This paper presents an innovative data treatment technique which allows single spectrum correction from distortions of unknown nature. Such a technique would increase the spatial resolution of the mapping process and becomes crucial when the desired information is linked to a particular mapping area associated to an individual spectrum. The full study consists in the explicit analysis of the ghost formation and the post-processing algorithm based on the semiblind deconvolution method - an iterative numerical algorithm of the series of consecutive deconvolutions. The technique was tested on the data from the PFS and the algorithm proved to be consistent according to the selected efficiency criteria (coming from the available general information about the signal spectral shape).
Directory of Open Access Journals (Sweden)
D. Seidl
1999-06-01
Full Text Available Among a variety of spectrogram methods Short-Time Fourier Transform (STFT and Continuous Wavelet Transform (CWT were selected to analyse transients in non-stationary tremor signals. Depending on the properties of the tremor signal a more suitable representation of the signal is gained by CWT. Three selected broadband tremor signals from the volcanos Mt. Stromboli, Mt. Semeru and Mt. Pinatubo were analyzed using both methods. The CWT can also be used to extend the definition of coherency into a time-varying coherency spectrogram. An example is given using array data from the volcano Mt. Stromboli.
High-resolution Fourier-transform spectrometer chip with microphotonic silicon spiral waveguides.
Velasco, Aitor V; Cheben, Pavel; Bock, Przemek J; Delâge, André; Schmid, Jens H; Lapointe, Jean; Janz, Siegfried; Calvo, María L; Xu, Dan-Xia; Florjańczyk, Mirosław; Vachon, Martin
2013-03-01
We report a stationary Fourier-transform spectrometer chip implemented in silicon microphotonic waveguides. The device comprises an array of 32 Mach-Zehnder interferometers (MZIs) with linearly increasing optical path delays between the MZI arms across the array. The optical delays are achieved by using Si-wire waveguides arranged in tightly coiled spirals with a compact device footprint of 12 mm2. Spectral retrieval is demonstrated in a single measurement of the stationary spatial interferogram formed at the output waveguides of the array, with a wavelength resolution of 40 pm within a free spectral range of 0.75 nm. The phase and amplitude errors arising from fabrication imperfections are compensated using a transformation matrix spectral retrieval algorithm.
Kamalian, Morteza; Prilepsky, Jaroslaw E; Le, Son Thai; Turitsyn, Sergei K
2016-08-08
In this work, we introduce the periodic nonlinear Fourier transform (PNFT) method as an alternative and efficacious tool for compensation of the nonlinear transmission effects in optical fiber links. In the Part I, we introduce the algorithmic platform of the technique, describing in details the direct and inverse PNFT operations, also known as the inverse scattering transform for periodic (in time variable) nonlinear Schrödinger equation (NLSE). We pay a special attention to explaining the potential advantages of the PNFT-based processing over the previously studied nonlinear Fourier transform (NFT) based methods. Further, we elucidate the issue of the numerical PNFT computation: we compare the performance of four known numerical methods applicable for the calculation of nonlinear spectral data (the direct PNFT), in particular, taking the main spectrum (utilized further in Part II for the modulation and transmission) associated with some simple example waveforms as the quality indicator for each method. We show that the Ablowitz-Ladik discretization approach for the direct PNFT provides the best performance in terms of the accuracy and computational time consumption.
Calibration of the Herschel SPIRE Fourier Transform Spectrometer
Swinyard, B M; Hopwood, R; Valtchanov, I; Lu, N; Fulton, T; Benielli, D; Imhof, P; Marchili, N; Baluteau, J -P; Bendo, G J; Ferlet, M; Griffin, M J; Lim, T L; Makiwa, G; Naylor, D A; Orton, G S; Papageorgiou, A; Pearson, C P; Schulz, B; Sidher, S D; Spencer, L D; van der Wiel, M H D; Wu, R
2014-01-01
The Herschel SPIRE instrument consists of an imaging photometric camera and an imaging Fourier Transform Spectrometer (FTS), both operating over a frequency range of 450-1550 GHz. In this paper, we briefly review the FTS design, operation, and data reduction, and describe in detail the approach taken to relative calibration (removal of instrument signatures) and absolute calibration against standard astronomical sources. The calibration scheme assumes a spatially extended source and uses the Herschel telescope as primary calibrator. Conversion from extended to point-source calibration is carried out using observations of the planet Uranus. The model of the telescope emission is shown to be accurate to within 6% and repeatable to better than 0.06% and, by comparison with models of Mars and Neptune, the Uranus model is shown to be accurate to within 3%. Multiple observations of a number of point-like sources show that the repeatability of the calibration is better than 1%, if the effects of the satellite absolu...
Fourier transform infrared absorption spectroscopy of jet-cooled radicals
Rohrs, Henry W.; Wickham-Jones, C. Tom; Ellison, G. Barney; Berry, David; Argrow, Brian M.
1995-03-01
We describe an experiment that couples a high-resolution Fourier transform spectrometer (FTS) to a supersonic jet of radicals. A 1-mm-i.d. cylindrical SiC nozzle is resistively heated to 1500 K in order to decompose organic precursors and generate expansions of jet-cooled radicals. We have used this apparatus to pyrolyze alkyl nitrites to make alkoxy and nitric oxide radicals. The residence time of radicals in this hot nozzle is roughly 20 μs RONO→ΔRO+NO. We use the FTS to detect the IR absorption of the product NO (ν0=1876.1 cm-1) at resolutions as fine as 0.005 cm-1 FWHM. We observe the product NO from the pyrolysis of CH3CH2ONO to be rotationally cooled to roughly 50 K. The IR spectra indicate that the optical path length is about 3/4 cm and that the nitrites pyrolyze to produce approximately 1014 NO radicals cm-3 some 9 mm downstream from the nozzle. Our spectrometer is capable of detecting an absorption signal of 0.1% over a bandwidth of 100 cm-1 at 0.005 cm-1 resolution. Depending on the infrared cross section of the radical, this implies that we are able to monitor diatomic radical densities of roughly 5×1012 cm-3 (quantum state)-1.
External Second Gate-Fourier Transform Ion Mobility Spectrometry.
Energy Technology Data Exchange (ETDEWEB)
Tarver, Edward E., III
2005-01-01
Ion mobility spectrometry (IMS) is recognized as one of the most sensitive and versatile techniques for the detection of trace levels of organic vapors. IMS is widely used for detecting contraband narcotics, explosives, toxic industrial compounds and chemical warfare agents. Increasing threat of terrorist attacks, the proliferation of narcotics, Chemical Weapons Convention treaty verification as well as humanitarian de-mining efforts has mandated that equal importance be placed on the analysis time as well as the quality of the analytical data. (1) IMS is unrivaled when both speed of response and sensitivity has to be considered. (2) With conventional (signal averaging) IMS systems the number of available ions contributing to the measured signal to less than 1%. Furthermore, the signal averaging process incorporates scan-to-scan variations decreasing resolution. With external second gate Fourier Transform ion mobility spectrometry (FT-IMS), the entrance gate frequency is variable and can be altered in conjunction with other data acquisition parameters to increase the spectral resolution. The FT-IMS entrance gate operates with a 50% duty cycle and so affords a 7 to 10-fold increase in sensitivity. Recent data on high explosives are presented to demonstrate the parametric optimization in sensitivity and resolution of our system.
Transmission fourier transform Raman spectroscopy of pharmaceutical tablet cores.
Pelletier, Michael J; Larkin, Peter; Santangelo, Matthew
2012-04-01
Transmission Fourier transform (FT) Raman spectroscopy of pharmaceutical tablet cores is demonstrated using traditional, unmodified commercial instrumentation. The benefits of improved precision over backscattering Raman spectroscopy due to increased sample volume are demonstrated. Self-absorption effects on analyte band ratios and sample probe volume are apparent, however. A survey of near-infrared (NIR) absorption spectra in the FT-Raman spectral range (approximately 0 to 3500 wavenumber shift from 1064 nm, or 1064 to 1700 nm) of molecules with a wide range of NIR-active functional groups shows that although absorption at the laser wavelength (1064 nm) is relatively small, some regions of the Raman spectrum coincide with NIR absorbances of 0.5 per cm or greater. Fortunately, the pharmaceutically important regions of the Raman shift spectrum from 0 to 600 cm(-1) and from 1400 to 1900 cm(-1) exhibit low self-absorption for most organic materials. A statistical analysis of transmission FT-Raman noise in spectra collected from different regions of a pharmaceutical tablet provides insight into both spectral distortion and reduced sampling volume caused by self-absorption.
Spin Glass Field Theory with Replica Fourier Transforms
Pimentel, Iveta R.; De Dominicis, Cirano
We develop a field theory for spin glasses using Replica Fourier Transforms (RFT). We present the formalism for the case of replica symmetry and the case of replica symmetry breaking on an ultrametric tree, with the number of replicas n and the number of replica symmetry breaking steps R generic integers. We show how the RFT applied to the two-replica fields allows to construct a new basis which block-diagonalizes the four-replica mass-matrix, into the replicon, anomalous and longitudinal modes. The eigenvalues are given in terms of the mass RFT and the propagators in the RFT space are obtained by inversion of the block-diagonal matrix. The formalism allows to express any i-replica vertex in the new RFT basis and hence enables to perform a standard perturbation expansion. We apply the formalism to calculate the contribution of the Gaussian fluctuations around the Parisi's solution for the free-energy of an Ising spin glass.
Online Botnet Detection Based on Incremental Discrete Fourier Transform
Directory of Open Access Journals (Sweden)
Xiaocong Yu
2010-05-01
Full Text Available Botnet detection has attracted lots of attention since botnet attack is becoming one of the most serious threats on the Internet. But little work has considered the online detection. In this paper, we propose a novel approach that can monitor the botnet activities in an online way. We define the concept of “feature streams” to describe raw network traffic. If some feature streams show high similarities, the corresponding hosts will be regarded as suspected bots which will be added into the suspected bot hosts set. After activity analysis, bot hosts will be confirmed as soon as possible. We present a simple method by computing the average Euclidean distance for similarity measurement. To avoid huge calculation among feature streams, classical Discrete Fourier Transform (DFT technique is adopted. Then an incremental calculation of DFT coefficients is introduced to obtain the optimal execution time. The experimental evaluations show that our approach can detect both centralized and distributed botnet activities successfully with high efficiency and low false positive rate.
SAR-based vibrometry using the fractional Fourier transform
Campbell, Justin B.; Wang, Qi; Ade-Bello, Jelili; Caudana, Humberto; Trujillo, Nicole B.; Bhatta, Ishwor; Dunkel, Ralf; Atwood, Thomas; Doerry, Armin; Gerstle, Walter H.; Santhanam, Balu; Hayat, Majeed M.
2015-05-01
A fundamental assumption when applying Synthetic Aperture Radar (SAR) to a ground scene is that all targets are motionless. If a target is not stationary, but instead vibrating in the scene, it will introduce a non-stationary phase modulation, termed the micro-Doppler effect, into the returned SAR signals. Previously, the authors proposed a pseudosubspace method, a modification to the Discrete Fractional Fourier Transform (DFRFT), which demonstrated success for estimating the instantaneous accelerations of vibrating objects. However, this method may not yield reliable results when clutter in the SAR image is strong. Simulations and experimental results have shown that the DFRFT method can yield reliable results when the signal-to-clutter ratio (SCR) > 8 dB. Here, we provide the capability to determine a target's frequency and amplitude in a low SCR environment by presenting two methods that can perform vibration estimations when SCR < 3 dB. The first method is a variation and continuation of the subspace approach proposed previously in conjunction with the DFRFT. In the second method, we employ the dual-beam SAR collection architecture combined with the extended Kalman filter (EKF) to extract information from the returned SAR signals about the vibrating target. We also show the potential for extending this SAR-based capability to remotely detect and classify objects housed inside buildings or other cover based on knowing the location of vibrations as well as the vibration histories of the vibrating structures that house the vibrating objects.
Improved Fast Fourier Transform Based Method for Code Accuracy Quantification
Energy Technology Data Exchange (ETDEWEB)
Ha, Tae Wook; Jeong, Jae Jun [Pusan National University, Busan (Korea, Republic of); Choi, Ki Yong [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2015-10-15
The capability of the proposed method is discussed. In this study, the limitations of the FFTBM were analyzed. The FFTBM produces quantitatively different results due to its frequency dependence. Because the problem is intensified by including a lot of high frequency components, a new method using a reduced cut-off frequency was proposed. The results of the proposed method show that the shortcomings of FFTBM are considerably relieved. Among them, the fast Fourier transform based method (FFTBM) introduced in 1990 has been widely used to evaluate a code uncertainty or accuracy. Prosek et al., (2008) identified its drawbacks, the so-called 'edge effect'. To overcome the problems, an improved FFTBM by signal mirroring (FFTBM-SM) was proposed and it has been used up to now. In spite of the improvement, the FFTBM-SM yielded different accuracy depending on the frequency components of a parameter, such as pressure, temperature and mass flow rate. Therefore, it is necessary to reduce the frequency dependence of the FFTBMs. In this study, the deficiencies of the present FFTBMs are analyzed and a new method is proposed to mitigate its frequency dependence.
Analysis of ovarian tumor pathology by Fourier Transform Infrared Spectroscopy
Directory of Open Access Journals (Sweden)
Mehrotra Ranjana
2010-12-01
Full Text Available Abstract Background Ovarian cancer is the second most common cancer among women and the leading cause of death among gynecologic malignancies. In recent years, infrared (IR spectroscopy has gained attention as a simple and inexpensive method for the biomedical study of several diseases. In the present study infrared spectra of normal and malignant ovarian tissues were recorded in the 650 cm-1 to 4000 cm-1 region. Methods Post surgical tissue samples were taken from the normal and tumor sections of the tissue. Fourier Transform Infrared (FTIR data on twelve cases of ovarian cancer with different grades of malignancy from patients of different age groups were analyzed. Results Significant spectral differences between the normal and the ovarian cancerous tissues were observed. In particular changes in frequency and intensity in the spectral region of protein, nucleic acid and lipid vibrational modes were observed. It was evident that the sample-to-sample or patient-to-patient variations were small and the spectral differences between normal and diseased tissues were reproducible. Conclusion The measured spectroscopic features, which are the spectroscopic fingerprints of the tissues, provided the important differentiating information about the malignant and normal tissues. The findings of this study demonstrate the possible use of infrared spectroscopy in differentiating normal and malignant ovarian tissues.
Two-dimensional Fourier transform ESR correlation spectroscopy
Gorcester, Jeff; Freed, Jack H.
1988-04-01
We describe our pulsed two-dimensional Fourier transform ESR experiment and demonstrate its applicabilty for the double resonance of motionally narrowed nitroxides. Multiple pulse irradiation of the entire nitroxide spectrum enables the correlation of two precessional periods, allowing observation of cross correlations between hyperfine lines introduced by magnetization transfer in the case of a three-pulse experiment (2D ELDOR), or coherence transfer in the case of a two-pulse experiment (COSY). Cross correlations are revealed by the presence of cross peaks which connect the autocorrelation lines appearing along the diagonal ω1=ω2. The amplitudes of these cross peaks are determined by the rates of magnetization transfer in the 2D ELDOR experiment. The density operator theory for the experiment is outlined and applied to the determination of Heisenberg exchange (HE) rates in 2,2,6,6-tetramethyl-4-piperidone-N-oxyl-d15 (PD-tempone) dissolved in toluene-d8. The quantitative accuracy of this experiment is established by comparison with the HE rate measured from the dependence of the spin echo T2 on nitroxide concentration.
Screening cervical lesions with Fourier transform infrared spectroscopy
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
The screening results were reported based on the Fourier transform infrared spectroscopy (FTIR) analysis of the samples of exfoliated cervical cells from 354 women. Their spectra can be sorted into two types based on the emerging or not of the absorption bands near 970 cm-1 and 1 170 cm-1: T1 (83.1%) type without emerging, and T2 (16.9%) type with obviously emerging. All of the samples assigned to T1 were cytologically diagnosed as normal or within normal limits (PapⅠ). 28.9% and 71.1% of samples exhibiting T2 profile, were cytologically evaluated as Pap Ⅰand abnormal respectively. 3 women in the abnormal group were diagnosed as to have cervical cells with changes associated with high grade of inflammation, cervical scar and cervical erosion. Furthermore, based on the progressive change of the relative intensities of the absorption bands, both T1 and T2 profiles can be categorized into 6 subtypes. The observed heterogeneous spectra and the progressive changes in the absorption frequencies and the relative intensities exhibit features suggestive of the progressive process of cervical lesion. The FTIR method has the potential to complement the cytological smear for large-volume screening of cervical lesions.
Chiral Process Monitoring Using Fourier Transform Microwave Spectroscopy
Neill, Justin L.; Muckle, Matt; Pate, Brooks
2017-06-01
We present the application of Fourier transform microwave (FTMW) spectroscopy in monitoring the chiral purity of components in a reaction mixture. This is of particular interest due to the increasing use of continuous pharmaceutical manufacturing processes, in which a number of attributes (including the chiral purity of the product) can change on short time scales. Therefore, new techniques that can accomplish this measurement rapidly are desired. The excellent specificity of FTMW spectroscopy, coupled with newly developed techniques for measuring enantiomeric excess in a mixture, have motivated this work. In collaboration with B. Frank Gupton (Virginia Commonwealth University), we are testing this application first with the synthesis of artemisinin. Artemisinin, a common drug for malaria treatment, is of high global health interest and subject to supply shortages, and therefore a strong candidate for continuous manufacturing. It also has moderately high molecular weight (282 amu) and seven chiral centers, making it a good candidate to test the capabilities of FTMW spectroscopy. Using a miniature cavity-enhanced FTMW spectrometer design, we aim to demonstrate selective component quantification in the reaction mixture. Future work that will be needed to fully realize this application will be discussed. R.D. Suenram, J.U. Grabow, A.Zuban, and I.Leonov, Rev. Sci. Instrum. 70, 2127 (1999).
Continued Development of a Planetary Imaging Fourier Transform Spectrometer (PIFTS)
Sromovsky, L. A.
2002-01-01
This report describes continued efforts to evaluate a breadboard of a Planetary Imaging Fourier Transform Spectrometer (PIFTS). The PIFTS breadboard was developed under prior PIDDP funding. That effort is described in the final report for NASA Grant NAG5-6248 and in two conference papers (Sromovsky et al. 2000; Revercomb et al. 2000). The PIFTS breadboard was designed for near-IR (1-5.2 micrometer imaging of planetary targets with spectral resolving powers of several hundred to several thousand, using an InSb detector array providing at least 64x64 pixels imaging detail. The major focus of the development effort was to combine existing technologies to produce a small and low power design compatible with a very low mass flyable instrument. The objective of this grant (NAG5-10729) was further characterization of the breadboard performance, including intercomparisons with the highly accurate non-imaging Advanced Emitted Radiance Interferometer (AERI) (Revercomb et al. 1994; Best et al. 1997).
Geosynchronous Imaging Fourier Transform Spectrometer (GIFTS): Imaging and Tracking Capability
Zhou, D. K.; Larar, A. M.; Liu, Xu; Reisse, R. A.; Smith, W. L.; Revercomb, H. E.; Bingham, G. E.; Zollinger, L. J.; Tansock, J. J.; Huppi, Ronald J.
2007-01-01
The geosynchronous-imaging Fourier transform spectrometer (GIFTS) engineering demonstration unit (EDU) is an imaging infrared spectrometer designed for atmospheric soundings. It measures the infrared spectrum in two spectral bands (14.6 to 8.8 microns, 6.0 to 4.4 microns) using two 128 128 detector arrays with a spectral resolution of 0.57/cm with a scan duration of approx. 11 seconds. From a geosynchronous orbit, the instrument will have the capability of taking successive measurements of such data to scan desired regions of the globe, from which atmospheric status, cloud parameters, wind field profiles, and other derived products can be retrieved. The GIFTS EDU provides a flexible and accurate testbed for the new challenges of the emerging hyperspectral era. The EDU ground-based measurement experiment, held in Logan, Utah during September 2006, demonstrated its extensive capabilities and potential for geosynchronous and other applications (e.g., Earth observing environmental measurements). This paper addresses the experiment objectives and overall performance of the sensor system with a focus on the GIFTS EDU imaging capability and proof of the GIFTS measurement concept.
Fourier transform ion cyclotron resonance mass spectrometry: a primer.
Marshall, A G; Hendrickson, C L; Jackson, G S
1998-01-01
This review offers an introduction to the principles and generic applications of FT-ICR mass spectrometry, directed to readers with no prior experience with the technique. We are able to explain the fundamental FT-ICR phenomena from a simplified theoretical treatment of ion behavior in idealized magnetic and electric fields. The effects of trapping voltage, trap size and shape, and other nonidealities are manifested mainly as perturbations that preserve the idealized ion behavior modified by appropriate numerical correction factors. Topics include: effect of ion mass, charge, magnetic field, and trapping voltage on ion cyclotron frequency; excitation and detection of ICR signals; mass calibration; mass resolving power and mass accuracy; upper mass limit(s); dynamic range; detection limit, strategies for mass and energy selection for MSn; ion axialization, cooling, and remeasurement; and means for guiding externally formed ions into the ion trap. The relation of FT-ICR MS to other types of Fourier transform spectroscopy and to the Paul (quadrupole) ion trap is described. The article concludes with selected applications, an appendix listing accurate fundamental constants needed for ultrahigh-precision analysis, and an annotated list of selected reviews and primary source publications that describe in further detail various FT-ICR MS techniques and applications.
Single beam Fourier transform digital holographic quantitative phase microscopy
Energy Technology Data Exchange (ETDEWEB)
Anand, A., E-mail: arun-nair-in@yahoo.com; Chhaniwal, V. K.; Mahajan, S.; Trivedi, V. [Optics Laboratory, Applied Physics Department, Faculty of Technology and Engineering, M.S. University of Baroda, Vadodara 390001 (India); Faridian, A.; Pedrini, G.; Osten, W. [Institut für Technische Optik, Universität Stuttgart, Pfaffenwaldring 9, 70569 Stuttgart (Germany); Dubey, S. K. [Siemens Technology and Services Pvt. Ltd, Corporate Technology—Research and Technology Centre, Bangalore 560100 (India); Javidi, B. [Department of Electrical and Computer Engineering, U-4157, University of Connecticut, Storrs, Connecticut 06269-2157 (United States)
2014-03-10
Quantitative phase contrast microscopy reveals thickness or height information of a biological or technical micro-object under investigation. The information obtained from this process provides a means to study their dynamics. Digital holographic (DH) microscopy is one of the most used, state of the art single-shot quantitative techniques for three dimensional imaging of living cells. Conventional off axis DH microscopy directly provides phase contrast images of the objects. However, this process requires two separate beams and their ratio adjustment for high contrast interference fringes. Also the use of two separate beams may make the system more vulnerable to vibrations. Single beam techniques can overcome these hurdles while remaining compact as well. Here, we describe the development of a single beam DH microscope providing whole field imaging of micro-objects. A hologram of the magnified object projected on to a diffuser co-located with a pinhole is recorded with the use of a commercially available diode laser and an arrayed sensor. A Fourier transform of the recorded hologram directly yields the complex amplitude at the image plane. The method proposed was investigated using various phase objects. It was also used to image the dynamics of human red blood cells in which sub-micrometer level thickness variation were measurable.
Fourier transform optical profilometry using fiber optic Lloyd's mirrors.
Kart, Türkay; Kösoğlu, Gülşen; Yüksel, Heba; İnci, Mehmet Naci
2014-12-10
A fiber optic Lloyd's mirror assembly is used to obtain various optical interference patterns for the detection of 3D rigid body shapes. Two types of fiber optic Lloyd's systems are used in this work. The first consists of a single-mode optical fiber and a highly reflecting flat mirror to produce bright and dark strips. The second is constructed by locating a single-mode optical fiber in a v-groove, which is formed by two orthogonal flat mirrors to allow the generation of square-type interference patterns for the desired applications. The structured light patterns formed by these two fiber Lloyd's techniques are projected onto 3D objects. Fringe patterns are deformed due to the object's surface topography, which are captured by a digital CCD camera and processed with a Fourier transform technique to accomplish 3D surface topography of the object. It is demonstrated that the fiber-optic Lloyd's technique proposed in this work is more compact, more stable, and easier to configure than other existing surface profilometry systems, since it does not include any high-cost optical tools such as aligners, couplers, or 3D stages. The fringe patterns are observed to be more robust against environmental disturbances such as ambient temperature and vibrations.
Fourier Transform Infrared Spectroscopy and Photoacoustic Spectroscopy for Saliva Analysis.
Mikkonen, Jopi J W; Raittila, Jussi; Rieppo, Lassi; Lappalainen, Reijo; Kullaa, Arja M; Myllymaa, Sami
2016-09-01
Saliva provides a valuable tool for assessing oral and systemic diseases, but concentrations of salivary components are very small, calling the need for precise analysis methods. In this work, Fourier transform infrared (FT-IR) spectroscopy using transmission and photoacoustic (PA) modes were compared for quantitative analysis of saliva. The performance of these techniques was compared with a calibration series. The linearity of spectrum output was verified by using albumin-thiocyanate (SCN(-)) solution at different SCN(-) concentrations. Saliva samples used as a comparison were obtained from healthy subjects. Saliva droplets of 15 µL were applied on the silicon sample substrate, 6 drops for each specimen, and dried at 37 ℃ overnight. The measurements were carried out using an FT-IR spectrometer in conjunction with an accessory unit for PA measurements. The findings with both transmission and PA modes mirror each other. The major bands presented were 1500-1750 cm(-1) for proteins and 1050-1200 cm(-1) for carbohydrates. In addition, the distinct spectral band at 2050 cm(-1) derives from SCN(-) anions, which is converted by salivary peroxidases to hypothiocyanate (OSCN(-)). The correlation between the spectroscopic data with SCN(-) concentration (r > 0.990 for transmission and r = 0.967 for PA mode) was found to be significant (P < 0.01), thus promising to be utilized in future applications.
Multi-channel sampling theorems for band-limited signals with fractional Fourier transform
Institute of Scientific and Technical Information of China (English)
2008-01-01
Multi-channel sampling for band-limited signals is fundamental in the theory of multi-channel parallel A/D environment and multiplexing wireless communication environment. As the fractional Fourier transform has been found wide applications in signal processing fields, it is necessary to consider the multi-channel sampling theorem based on the fractional Fourier transform. In this paper, the multi-channel sampling theorem for the fractional band-limited signal is firstly proposed, which is the generalization of the well-known sampling theorem for the fractional Fourier transform. Since the periodic nonuniformly sampled signal in the fractional Fourier domain has valuable applications, the reconstruction expression for the periodic nonuniformly sampled signal has been then obtained by using the derived multi-channel sampling theorem and the specific space-shifting and phase-shifting properties of the fractional Fourier transform. Moreover, by designing different fractional Fourier filters, we can obtain reconstruction methods for other sampling strategies.
Rajput, Sudheesh K.; Nishchal, Naveen K.
2017-04-01
We propose a novel security scheme based on the double random phase fractional domain encoding (DRPE) and modified Gerchberg-Saxton (G-S) phase retrieval algorithm for securing two images simultaneously. Any one of the images to be encrypted is converted into a phase-only image using modified G-S algorithm and this function is used as a key for encrypting another image. The original images are retrieved employing the concept of known-plaintext attack and following the DRPE decryption steps with all correct keys. The proposed scheme is also used for encryption of two color images with the help of convolution theorem and phase-truncated fractional Fourier transform. With some modification, the scheme is extended for simultaneous encryption of gray-scale and color images. As a proof-of-concept, simulation results have been presented for securing two gray-scale images, two color images, and simultaneous gray-scale and color images.
Localization Operators and an Uncertainty Principle for the Discrete Short Time Fourier Transform
Directory of Open Access Journals (Sweden)
Carmen Fernández
2014-01-01
Full Text Available Localization operators in the discrete setting are used to obtain information on a signal f from the knowledge on the support of its short time Fourier transform. In particular, the extremal functions of the uncertainty principle for the discrete short time Fourier transform are characterized and their connection with functions that generate a time-frequency basis is studied.
An Introduction to Fast Fourier Transforms through the Study of Oscillating Reactions.
Eastman, M. P.; And Others
1986-01-01
Discusses an experiment designed to introduce students to the basic principles of the fast Fourier transform and Fourier smoothing through transformation of time-dependent optical absorption data from an oscillating reaction. Uses the Belousov-Zhabotinskii reaction. Describes the experimental setup and data analysis techniques.
Quantization-Based Digital Audio Watermarking in Discrete Fourier Transform Domain
Directory of Open Access Journals (Sweden)
Senbin Yang
2010-04-01
Full Text Available To explore the principle and performances of Quantization Index Modulation (QIM watermarking algorithm, the realization schemes of this algorithm in Discrete Fourier Transform (DFT domain are classified into three types according to the differences of quantizer parameters, and then the illustrative diagrams of these schemes are given, so the properties of transparency, robustness and capacity of each scheme are concluded. The scheme with best distortion-robustness trade-off is found on that basis. The more efficient embedding and extracting formulas of this scheme are given, and the performances are researched by theoretical analysis rather than computer simulation. The conclusions show that the transparency is in proportion to the square of quantization step and small DFT coefficient leads to poor transparency. The robustness to Additive White Gaussian Noise (AWGN only relates to the quantization step and the algorithm is susceptible to amplitude scale and resampling attacks. The possible capacity is Fo/2 bits per second, which can satisfy various watermarking applications. To improve the robustness, an adaptive quantization algorithm based on masking properties of the Human Auditory System (HAS is proposed at the end of this paper, and the algorithm is evaluated in the analog channel environment and its robustness is proved by the results.
Huang, Fengzhen; Yuan, Yan; Li, Jingzhen; Cao, Jun
2015-08-01
During the temporally and spatially modulated Fourier transform imaging spectrometer push-broom scanning process, the motion state of the spectrometer platform can vary. Thus, the target interferogram obtained from the image sequence deviates from the ideal interferogram obtained using high platform stability. The recovered target spectrum will not reflect the true target characteristics. We adopted target tracking to acquire the target position in the image sequence via a proposed kernel regression, with a relative deviation method for determining the target intensities, and the recovery of the spectrogram using the nonuniform fast Fourier transform algorithm. We tested our algorithm on simulated and experimentally obtained aerial images and, from comparison with accurate spectrograms, demonstrate the effectiveness of the proposed method.
A Fourier transform infrared trace gas analyser for atmospheric applications
Directory of Open Access Journals (Sweden)
D. W. T. Griffith
2012-05-01
Full Text Available Concern in recent decades about human impacts on Earth's climate has led to the need for improved and expanded measurement capabilities for greenhouse gases in the atmosphere. In this paper we describe in detail an in situ trace gas analyser based on Fourier Transform Infrared (FTIR spectroscopy that is capable of simultaneous and continuous measurements of carbon dioxide (CO_{2}, methane (CH_{4}, carbon monoxide (CO, nitrous oxide (N_{2}O and ^{13}C in CO_{2} in air with high precision and accuracy. Stable water isotopes can also be measured in undried airstreams. The analyser is automated and allows unattended operation with minimal operator intervention. Precision and accuracy meet and exceed the compatibility targets set by the World Meteorological Organisation – Global Atmosphere Watch Programme for baseline measurements in the unpolluted troposphere for all species except ^{13}C in CO_{2}.
The analyser is mobile and well suited to fixed sites, tower measurements, mobile platforms and campaign-based measurements. The isotopic specificity of the optically-based technique and analysis allows application of the analyser in isotopic tracer experiments, for example ^{13}C in CO_{2} and ^{15}N in N_{2}O. We review a number of applications illustrating use of the analyser in clean air monitoring, micrometeorological flux and tower measurements, mobile measurements on a train, and soil flux chamber measurements.
Fourier Transform Spectrometer measurements of Atmospheric Carbon Dioxide and Methane
Kivi, Rigel; Heikkinen, Pauli; Chen, Huilin; Hatakka, Juha; Laurila, Tuomas
2016-04-01
Ground based remote sensing measurements of column CO2 and CH4 using Fourier Transform Spectrometers (FTS) within the Total Carbon Column Observing Network (TCCON) are known for high precision and accuracy. These measurements are performed at various locations globally and they have been widely used in carbon cycle studies and validation of space born measurements. The relevant satellite missions include the Orbiting Carbon Observatory-2 (OCO-2) by the National Aeronautics and Space Administration (NASA); the SCanning Imaging Absorption SpectroMeter for Atmospheric CHartographY (SCIAMACHY) by the European Space Agency (ESA); the Greenhouse gases Observing SATellite (GOSAT) by the Japan Aerospace Exploration Agency (JAXA) and the upcoming Sentinel-5 Precursor mission, which is an ESA mission and scheduled for launch in 2016. Results of the column CO2 and CH4 measurements at Sodankylä in northern Finland (at 67.4° N, 26.6° E) are reported in this study. The measurements have been performed on regular basis since the beginning of the program in early 2009. We also present evaluation of the data quality of the ground based measurements and comparisons with the available satellite based retrievals. In case of comparisons between the GOSAT and ground based retrievals of CO2 and CH4 no significant biases were found. Sodankylä is one of the northernmost stations in the TCCON network. However, the data coverage has been relatively good thanks to the progress towards automation of the FTS measurement system. At Sodankylä the retrievals have been also compared with the balloon borne AirCore measurements at the site. AirCore sampling system is directly related to the World Meteorological Organization in situ trace gas measurement scales. The balloon platform allows sampling in both stratosphere and troposphere, which is a benefit, compared to the aircraft in situ measurements.
Continuously tunable optical multidimensional Fourier-transform spectrometer.
Dey, P; Paul, J; Bylsma, J; Deminico, S; Karaiskaj, D
2013-02-01
A multidimensional optical nonlinear spectrometer (MONSTR) is a robust, ultrastable platform consisting of nested and folded Michelson interferometers that can be actively phase stabilized. The MONSTR provides output pulses for nonlinear excitation of materials and phase-stabilized reference pulses for heterodyne detection of the induced signal. This platform generates a square of identical laser pulses that can be adjusted to have arbitrary time delays between them while maintaining phase stability. This arrangement is ideal for performing coherent optical experiments, such as multidimensional Fourier-transform spectroscopy. The present work reports on overcoming some important limitations on the original design of the MONSTR apparatus. One important advantage of the MONSTR is the fact that it is a closed platform, which provides the high stability. Once the optical alignment is performed, it is desirable to maintain the alignment over long periods of time. The previous design of the MONSTR was limited to a narrow spectral range defined by the optical coating of the beam splitters. In order to achieve tunability over a broad spectral range the internal optics needed to be changed. By using broadband coated and wedged beam splitters and compensator plates, combined with modifications of the beam paths, continuous tunability can be achieved from 520 nm to 1100 nm without changing any optics or performing alignment of the internal components of the MONSTR. Furthermore, in order to achieve continuous tunability in the spectral region between 520 nm and 720 nm, crucially important for studies on numerous biological molecules, a single longitudinal mode laser at 488.5 nm was identified and used as a metrology laser. The shorter wavelength of the metrology laser as compared to the usual HeNe laser has also increased the phase stability of the system. Finally, in order to perform experiments in the reflection geometry, a simple method to achieve active phase stabilization
Calculation of Fresnel diffraction from 1D phase step by discrete Fourier transform
Aalipour, Rasoul
2017-01-01
When a part of an optical wave-front experiences a sharp change in its phase, Fresnel diffraction becomes appreciable. Sharp change in phase occurs as a wave-front strikes with a phase step. The intensity distributions of diffraction patterns of the phase step is formulated by applying Fresnel-Kirchhoff integral. For while the incident light on the step is coherent, the Fresnel-Kirchhoff integral can be solved by using familiar Fresnel integrals. But, when the incident light is partially coherent, one can not express the diffraction integral as the Fresnel integrals and the problem is summarized in solving some unusual integrals. In this report, we propose Fourier transform method for solving the Fresnel-Kirchhoff integral. In this regard we use discrete Fourier transform method and calculate Fresnel diffraction from the 1D phase step by FFT-based algorithms. This method does not have any restriction on the coherence and profile shape of the incident light. We show that the method have appropriate solutions for coherent and partially coherent lights. For the case of the coherent light illumination of the step, the obtained results are in good agreement with the calculated results by using the Fresnel integrals in reported literatures.
Directory of Open Access Journals (Sweden)
Qiu Bo
2008-01-01
Full Text Available Binaural cue coding (BCC is an efficient technique for spatial audio rendering by using the side information such as interchannel level difference (ICLD, interchannel time difference (ICTD, and interchannel correlation (ICC. Of the side information, the ICTD plays an important role to the auditory spatial image. However, inaccurate estimation of the ICTD may lead to the audio quality degradation. In this paper, we develop a novel ICTD estimation algorithm based on the nonuniform discrete Fourier transform (NDFT and integrate it with the BCC approach to improve the decoded auditory image. Furthermore, a new subjective assessment method is proposed for the evaluation of auditory image widths of decoded signals. The test results demonstrate that the NDFT-based scheme can achieve much wider and more externalized auditory image than the existing BCC scheme based on the discrete Fourier transform (DFT. It is found that the present technique, regardless of the image width, does not deteriorate the sound quality at the decoder compared to the traditional scheme without ICTD estimation.
Eltagoury, Yomna M.; Sabry, Yasser M.; Khalil, Diaa A.
2016-03-01
In this work, we present a novel architecture for Fourier transform spectrometers based on cascaded low-finesse FP interferometers. One of the interferometers has fixed path length while the second is a scanning one using a relatively large stroke electrostatic comb-drive actuator. The fixed interferometer results in a spectrum modulation and, hence, a shifted version of the interferogram away from the point of the zero spacing between the two mirrors. The shifted interferogram can then be used with the Fourier transform algorithm to obtain the spectrum of the measured light. This cascaded FP configuration results in a simple arrangement of mirrors on a line, which makes it much tolerant to misalignment errors. The proposed configuration is implemented using the MEMS DRIE technology on an SOI wafer with a simple MEMS process flow without metallization or dielectric coating of the vertical optical surface. The fabricated compact structure is measured with both a laser source with narrow spectrum at 1550 nm and a wide spectrum source composed of an SLED and the ASE of a semiconductor optical amplifier source. The obtained results validate the concept of the new configuration.
Directory of Open Access Journals (Sweden)
Bo Qiu
2008-05-01
Full Text Available Binaural cue coding (BCC is an efficient technique for spatial audio rendering by using the side information such as interchannel level difference (ICLD, interchannel time difference (ICTD, and interchannel correlation (ICC. Of the side information, the ICTD plays an important role to the auditory spatial image. However, inaccurate estimation of the ICTD may lead to the audio quality degradation. In this paper, we develop a novel ICTD estimation algorithm based on the nonuniform discrete Fourier transform (NDFT and integrate it with the BCC approach to improve the decoded auditory image. Furthermore, a new subjective assessment method is proposed for the evaluation of auditory image widths of decoded signals. The test results demonstrate that the NDFT-based scheme can achieve much wider and more externalized auditory image than the existing BCC scheme based on the discrete Fourier transform (DFT. It is found that the present technique, regardless of the image width, does not deteriorate the sound quality at the decoder compared to the traditional scheme without ICTD estimation.
Broadband Mid-Infrared Comb-Resolved Fourier Transform Spectroscopy
Lee, Kevin; Mills, Andrew; Mohr, Christian; Jiang, Jie; Fermann, Martin; Maslowski, Piotr
2014-06-01
We report on a comb-resolved, broadband, direct-comb spectroscopy system in the mid-IR and its application to the detection of trace gases and molecular line shape analysis. By coupling an optical parametric oscillator (OPO), a 100 m multipass cell, and a high-resolution Fourier transform spectrometer (FTS), sensitive, comb-resolved broadband spectroscopy of dilute gases is possible. The OPO has radiation output at 3.1-3.7 and 4.5-5.5 μm. The laser repetition rate is scanned to arbitrary values with 1 Hz accuracy around 417 MHz. The comb-resolved spectrum is produced with an absolute frequency axis depending only on the RF reference (in this case a GPS disciplined oscillator), stable to 1 part in 10^9. The minimum detectable absorption is 1.6x10-6 wn Hz-1/2. The operating range of the experimental setup enables access to strong fundamental transitions of numerous molecular species for applications based on trace gas detection such as environmental monitoring, industrial gas calibration or medical application of human breath analysis. In addition to these capabilities, we show the application for careful line shape analysis of argon-broadened CO band spectra around 4.7 μm. Fits of the obtained spectra clearly illustrate the discrepancy between the measured spectra and the Voigt profile (VP), indicating the need to include effects such as Dicke narrowing and the speed-dependence of the collisional width and shift in the line shape model, as was shown in previous cw-laser studies. In contrast to cw-laser based experiments, in this case the entire spectrum (˜ 250 wn) covering the whole P and R branches can be measured in 16 s with 417 MHz resolution, decreasing the acquisition time by orders of magnitude. The parallel acquisition allows collection of multiple lines simultaneously, removing the correlation of possible temperature and pressure drifts. While cw-systems are capable of measuring spectra with higher precision, this demonstration opens the door for fast
Fast Fourier Transform Chlorine Nuclear Quadrupole Resonance Spectroscopy.
D'Iorio, Marie
A nuclear quadrupole resonance spectrometer operating in the frequency range 1-40 MHz was updated for fast Fourier transform spectroscopy and coupled to a Nicolet 1180 computer and data acquisition system. It was used with a low temperature cryostat for studies shown down to liquid helium temperature and with a high pressure/low temperature system for studies down to liquid nitrogen temperature and up to six kilobars. The study of the ('35)Cl NQR spectrum of K(,2)OsCl(,6) at 298 K and 77 K revealed the presence of a satellite associated with the nearest neighbour chlorines to H('+) ion impurities located at vacant octahedral sties. This result is in agreement with the predictions of a point charge model calculation. A residence time for the H('+) ion was deduced and is consistent with the result obtained from dielectric measurements. A detailed study of the ('35)Cl NQR frequency in K(,2)ReCl(,6) was performed in the temperature range 85 - 130K where two structural phase transitions occur, and at pressures from 1 to 2643 bars. A number of unusual features were revealed and discussed as the possible signature of incommensurate behavior. The primary effect of the pressure was to alter the temperatures at which the phase transitions occurred. Contrary to the behavior expected, the transition temperature for the antiferrorotative transition has a negative pressure coefficient. The spin-lattice and spin-spin relaxation times for the ('35)Cl and ('37)Cl isotopes of the one dimensional XY system, PrCl(,3), were measured at 4.2K. The spin-lattice relaxation is exponential and dominated by magnetic dipole -dipole interactions. The spin-spin relaxation is non-exponential and dominated by electric quadrupolar interactions arising from the coupling of the electric dipole moment at the praseodymium site and the quadrupole moment of the chlorine ion. The temperature dependence of the spin-spin relaxation time was investigated. At 17.4 K both magnetic dipolar and electric
Institute of Scientific and Technical Information of China (English)
CAO Gan; TAN Zhong-wen; LIANG Ji-nan; LONG Yong-hui; ZHOU Xue-qiu
2003-01-01
With the technique of Fourier transform near infrared (FT-NIR) spectroscopy, the calibration models for quantitative analysis of sucrose and polarization in sugarcane juice were developed by using transmission mode and calibrating with partial least square (PIS) algorithm. The determination coefficients (R2)of the predicted models for sucrose and polarization in juice were 0. 9980 and 0. 9979 respectively; the root mean square errors of cross validation (RMSECV) were 0. 143 and 0. 155% for sucrose and polarization in juice respectively. The predictive errors measured by FT-NIR were close to those by routine laboratory methods. The results demonstrated that the FT-NIR methods had high accuracy and they were able to replace the routine laboratory analysis. It was also demonstrated that as a rapid and accurate measurement, the FT-NIR technique had potential applications in quality control of mill sugarcane, establishment of payment system based on sugarcane quality, and selection of clones in sugarcane breeding.
Accelerating the 2-point and 3-point galaxy correlation functions using Fourier transforms
Slepian, Zachary
2015-01-01
Though Fourier Transforms (FTs) are a common technique for finding correlation functions, they are not typically used in computations of the anisotropy of the two-point correlation function (2PCF) about the line of sight in wide-angle surveys because the line-of-sight direction is not constant on the Cartesian grid. Here we show how FTs can be used to compute the multipole moments of the anisotropic 2PCF. We also show how FTs can be used to accelerate the 3PCF algorithm of Slepian & Eisenstein (2015). In both cases, these FT methods allow one to avoid the computational cost of pair counting, which scales as the square of the number density of objects in the survey. With the upcoming large datasets of DESI, Euclid, and LSST, FT techniques will therefore offer an important complement to simple pair or triplet counts.
Detection of Left-Sided and Right-Sided Hearing Loss via Fractional Fourier Transform
Directory of Open Access Journals (Sweden)
Shuihua Wang
2016-05-01
Full Text Available In order to detect hearing loss more efficiently and accurately, this study proposed a new method based on fractional Fourier transform (FRFT. Three-dimensional volumetric magnetic resonance images were obtained from 15 patients with left-sided hearing loss (LHL, 20 healthy controls (HC, and 14 patients with right-sided hearing loss (RHL. Twenty-five FRFT spectrums were reduced by principal component analysis with thresholds of 90%, 95%, and 98%, respectively. The classifier is the single-hidden-layer feed-forward neural network (SFN trained by the Levenberg–Marquardt algorithm. The results showed that the accuracies of all three classes are higher than 95%. In all, our method is promising and may raise interest from other researchers.
Choi, Heejin; Wadduwage, Dushan; Matsudaira, Paul T; So, Peter T C
2014-10-01
A depth resolved hyperspectral imaging spectrometer can provide depth resolved imaging both in the spatial and the spectral domain. Images acquired through a standard imaging Fourier transform spectrometer do not have the depth-resolution. By post processing the spectral cubes (x, y, λ) obtained through a Sagnac interferometer under uniform illumination and structured illumination, spectrally resolved images with depth resolution can be recovered using structured light illumination algorithms such as the HiLo method. The proposed scheme is validated with in vitro specimens including fluorescent solution and fluorescent beads with known spectra. The system is further demonstrated in quantifying spectra from 3D resolved features in biological specimens. The system has demonstrated depth resolution of 1.8 μm and spectral resolution of 7 nm respectively.
Kluger, Robert; Smith, Brian L; Park, Hyungjun; Dailey, Daniel J
2016-11-01
Recent technological advances have made it both feasible and practical to identify unsafe driving behaviors using second-by-second trajectory data. Presented in this paper is a unique approach to detecting safety-critical events using vehicles' longitudinal accelerations. A Discrete Fourier Transform is used in combination with K-means clustering to flag patterns in the vehicles' accelerations in time-series that are likely to be crashes or near-crashes. The algorithm was able to detect roughly 78% of crasjavascript:void(0)hes and near-crashes (71 out of 91 validated events in the Naturalistic Driving Study data used), while generating about 1 false positive every 2.7h. In addition to presenting the promising results, an implementation strategy is discussed and further research topics that can improve this method are suggested in the paper.
A known-plaintext heuristic attack on the Fourier plane encryption algorithm
Gopinathan, Unnikrishnan; Monaghan, David S.; Naughton, Thomas J.; Sheridan, John T.
2006-04-01
The Fourier plane encryption algorithm is subjected to a known-plaintext attack. The simulated annealing heuristic algorithm is used to estimate the key, using a known plaintext-ciphertext pair, which decrypts the ciphertext with arbitrarily low error. The strength of the algorithm is tested by using this estimated key to decrypt a different ciphertext which was also encrypted using the same original key. We assume that the plaintext is amplitude-encoded real-valued image, and analyze only the mathematical algorithm rather than a real optical system that can be more secure. The Fourier plane encryption algorithm is found to be susceptible to a known-plaintext heuristic attack.
2014-10-16
1 Extracting micro-Doppler radar signatures from rotating targets using Fourier- Bessel Transform and Time-Frequency analysis P. Suresh1,T...kvenkataramanaiah@sssihl.edu.in Abstract In this paper, we report the efficiency of Fourier Bessel transform and time-frequency based method in conjunction with...decomposed into stationary and non-stationary components using Fourier Bessel transform in conjunction with the fractional Fourier transform. The
Large-scale analytical Fourier transform of photomask layouts using graphics processing units
Sakamoto, Julia A.
2015-10-01
Compensation of lens-heating effects during the exposure scan in an optical lithographic system requires knowledge of the heating profile in the pupil of the projection lens. A necessary component in the accurate estimation of this profile is the total integrated distribution of light, relying on the squared modulus of the Fourier transform (FT) of the photomask layout for individual process layers. Requiring a layout representation in pixelated image format, the most common approach is to compute the FT numerically via the fast Fourier transform (FFT). However, the file size for a standard 26- mm×33-mm mask with 5-nm pixels is an overwhelming 137 TB in single precision; the data importing process alone, prior to FFT computation, can render this method highly impractical. A more feasible solution is to handle layout data in a highly compact format with vertex locations of mask features (polygons), which correspond to elements in an integrated circuit, as well as pattern symmetries and repetitions (e.g., GDSII format). Provided the polygons can decompose into shapes for which analytical FT expressions are possible, the analytical approach dramatically reduces computation time and alleviates the burden of importing extensive mask data. Algorithms have been developed for importing and interpreting hierarchical layout data and computing the analytical FT on a graphics processing unit (GPU) for rapid parallel processing, not assuming incoherent imaging. Testing was performed on the active layer of a 392- μm×297-μm virtual chip test structure with 43 substructures distributed over six hierarchical levels. The factor of improvement in the analytical versus numerical approach for importing layout data, performing CPU-GPU memory transfers, and executing the FT on a single NVIDIA Tesla K20X GPU was 1.6×104, 4.9×103, and 3.8×103, respectively. Various ideas for algorithm enhancements will be discussed.
Directory of Open Access Journals (Sweden)
T. Ge
1995-01-01
Full Text Available A semianalytical algorithm is proposed for the solutions and their stability of a piecewise nonlinear system. The conventional harmonic balance method is modified by the introduction of Toeplitz Jacobian matrices (TJM and by the alternative applications of fast Fourier transformation (FFT and its inverse. The TJM/FFT method substantially reduces the amount of computation and circumvents the necessary numerical differentiation for the Jacobian. An arc-length algorithm and a branch switching procedure are incorporated so that the secondary branches can be independently traced. Oscillators with piecewise nonlinear characteristics are taken as illustrative examples. Flip, fold, and Hopf bifurcations are of interest.
Fourier transforms of spherical distributions on compact symmetric spaces
Olafsson, Gestur; Schlichtkrull, Henrik
2008-01-01
In our previous articles "A local Paley-Wiener theorem for compact symmetric spaces", Adv. Math. 218 (2008), 202--215, and "Fourier series on compact symmetric spaces" (submitted) we studied Fourier series on a compact symmetric space M=U/K. In particular, we proved a Paley-Wiener type theorem for the smooth functions on M, which have sufficiently small support and are K-invariant, respectively K-finite. In this article we extend those results to K-invariant distributions on M. We show that t...
Fourier Transform Infrared Spectroscopy: Part II. Advantages of FT-IR.
Perkins, W. D.
1987-01-01
This is Part II in a series on Fourier transform infrared spectroscopy (FT-IR). Described are various advantages of FT-IR spectroscopy including energy advantages, wavenumber accuracy, constant resolution, polarization effects, and stepping at grating changes. (RH)
Energy Technology Data Exchange (ETDEWEB)
Patino, A [Universidad Technologica de Bolivar, Cartagena de Indias (Colombia); Durand, P-E; Fogret, E; Pellat-Finet, P, E-mail: alberto.patino-vanegas@univ-ubs.fr [Laboratoire de mathematiques et applications des mathematiques, Universite de Bretagne Sud, B P 92116, 56321 Lorient cedex (France)
2011-01-01
According to a scalar theory of diffraction, light propagation can be expressed by two-dimensional fractional order Fourier transforms. Since the fractional Fourier transform of a chirp function is a Dirac distribution, focusing a light beam is optically achieved by using a diffractive screen whose transmission function is a two-dimensional chirp function. This property is applied to designing Fresnel microlenses, and the orders of the involved Fourier fractional transforms depend on diffraction distances as well as on emitter and receiver radii of curvature. If the emitter is astigmatic (with two principal radii of curvature), the diffraction phenomenon involves two one-dimensional fractional Fourier transforms whose orders are different. This degree of freedom allows us to design microlenses that can focus astigmatic Gaussian beams, as produced by a line-shaped laser diode source.
Xi, Jiaxin; Liu, Ning
2017-09-01
Vibration characteristic of timing chain system is very important for an engine. In this study, we used a bush roller chain drive system as an example to explain how to use mulitybody dynamic techniques and short-time Fourier transform to investigate vibration characteristics of timing chain system. Multibody dynamic simulation data as chain tension force and external excitation sources curves were provided for short-time Fourier transform study. The study results of short-time Fourier transform illustrate that there are two main vibration frequency domain of timing chain system, one is the low frequency vibration caused by crankshaft sprocket velocity and camshaft sprocket torque. Another is vibration around 1000Hz lead by hydraulic tensioner. Hence, short-time Fourier transform method is useful for basic research of vibration characteristics for timing chain system.
Cageao, R.; Sander, S.; Blavier, J.; Jiang, Y.; Nemtchinov, V.
2000-01-01
A compact, high resolution Fourier-transform spectrometer for atmospheric near ultraviolet spectroscopy has been installed at the Jet Propulsion Laboratory's Table Mountain Facility (34.4N, 117.7 W, elevation 2290m).
The Fourier Transform in Chemistry. Part 1. Nuclear Magnetic Resonance: Introduction.
King, Roy W.; Williams, Kathryn R.
1989-01-01
Using fourier transformation methods in nuclear magnetic resonance has made possible increased sensitivity in chemical analysis. This article describes these methods as they relate to magnetization, the RF magnetic field, nuclear relaxation, the RF pulse, and free induction decay. (CW)
Fourier transform of delayed fluorescence as an indicator of herbicide concentration.
Guo, Ya; Tan, Jinglu
2014-12-21
It is well known that delayed fluorescence (DF) from Photosystem II (PSII) of plant leaves can be potentially used to sense herbicide pollution and evaluate the effect of herbicides on plant leaves. The research of using DF as a measure of herbicides in the literature was mainly conducted in time domain and qualitative correlation was often obtained. Fourier transform is often used to analyze signals. Viewing DF signal in frequency domain through Fourier transform may allow separation of signal components and provide a quantitative method for sensing herbicides. However, there is a lack of an attempt to use Fourier transform of DF as an indicator of herbicide. In this work, the relationship between the Fourier transform of DF and herbicide concentration was theoretically modelled and analyzed, which immediately yielded a quantitative method to measure herbicide concentration in frequency domain. Experiments were performed to validate the developed method.
Scargle, Jeffrey D.; Way, M. J.; Gazis, P. G.
2017-01-01
We demonstrate the effectiveness of a relatively straightforward analysis of the complex 3D Fourier transform of galaxy coordinates derived from redshift surveys. Numerical demonstrations of this approach are carried out on a volume-limited sample of the Sloan Digital Sky Survey redshift survey. The direct unbinned transform yields a complex 3D data cube quite similar to that from the Fast Fourier Transform of finely binned galaxy positions. In both cases, deconvolution of the sampling window function yields estimates of the true transform. Simple power spectrum estimates from these transforms are roughly consistent with those using more elaborate methods. The complex Fourier transform characterizes spatial distributional properties beyond the power spectrum in a manner different from (and we argue is more easily interpreted than) the conventional multipoint hierarchy. We identify some threads of modern large-scale inference methodology that will presumably yield detections in new wider and deeper surveys.
Building a symbolic computer algebra toolbox to compute 2D Fourier transforms in polar coordinates.
Dovlo, Edem; Baddour, Natalie
2015-01-01
The development of a symbolic computer algebra toolbox for the computation of two dimensional (2D) Fourier transforms in polar coordinates is presented. Multidimensional Fourier transforms are widely used in image processing, tomographic reconstructions and in fact any application that requires a multidimensional convolution. By examining a function in the frequency domain, additional information and insights may be obtained. The advantages of our method include: •The implementation of the 2D Fourier transform in polar coordinates within the toolbox via the combination of two significantly simpler transforms.•The modular approach along with the idea of lookup tables implemented help avoid the issue of indeterminate results which may occur when attempting to directly evaluate the transform.•The concept also helps prevent unnecessary computation of already known transforms thereby saving memory and processing time.
A Novel Algorithm of Network Trade Customer Classification Based on Fourier Basis Functions
Directory of Open Access Journals (Sweden)
Li Xinwu
2013-11-01
Full Text Available Learning algorithm of neural network is always an important research contents in neural network theory research and application field, learning algorithm about the feed-forward neural network has no satisfactory solution in particular for its defects in calculation speed. The paper presents a new Fourier basis functions neural network algorithm and applied it to classify network trade customer. First, 21 customer classification indicators are designed, based on characteristics and behaviors analysis of network trade customer, including customer characteristics type variables and customer behaviors type variables,; Second, Fourier basis functions is used to improve the calculation flow and algorithm structure of original BP neural network algorithm to speed up its convergence and then a new Fourier basis neural network model is constructed. Finally the experimental results show that the problem of convergence speed can been solved, and the accuracy of the customer classification are ensured when the new algorithm is used in network trade customer classification practically.
Automotive FMCW Radar-enhanced Range Estimation via a Local Resampling Fourier Transform
Directory of Open Access Journals (Sweden)
Cailing Wang
2016-02-01
Full Text Available In complex traffic scenarios, more accurate measurement and discrimination for an automotive frequency-modulated continuous-wave (FMCW radar is required for intelligent robots, driverless cars and driver-assistant systems. A more accurate range estimation method based on a local resampling Fourier transform (LRFT for a FMCW radar is developed in this paper. Radar signal correlation in the phase space sees a higher signal-noise-ratio (SNR to achieve more accurate ranging, and the LRFT - which acts on a local neighbour as a refinement step - can achieve a more accurate target range. The rough range is estimated through conditional pulse compression (PC and then, around the initial rough estimation, a refined estimation through the LRFT in the local region achieves greater precision. Furthermore, the LRFT algorithm is tested in numerous simulations and physical system experiments, which show that the LRFT algorithm achieves a more precise range estimation than traditional FFT-based algorithms, especially for lower bandwidth signals.
Directory of Open Access Journals (Sweden)
Shengxin Wang
2016-06-01
Full Text Available Pathological tremor is an approximately rhythmic movement and considerably affects patients’ daily living activities. Biomechanical loading and functional electrical stimulation are proposed as potential alternatives for canceling the pathological tremor. However, the performance of suppression methods is associated with the separation of tremor from the recorded signals. In this literature, an algorithm incorporating a fast Fourier transform augmented with a sliding convolution window, an interpolation procedure, and a damping module of the frequency is presented to isolate tremulous components from the measured signals and estimate the instantaneous tremor frequency. Meanwhile, a mechanism platform is designed to provide the simulation tremor signals with different degrees of voluntary movements. The performance of the proposed algorithm and existing procedures is compared with simulated signals and experimental signals collected from patients. The results demonstrate that the proposed solution could detect the unknown dominant frequency and distinguish the tremor components with higher accuracy. Therefore, this algorithm is useful for actively compensating tremor by functional electrical stimulation without affecting the voluntary movement.
The Design of Lens Imaging System by Means of Fractional Fourier Transform
Institute of Scientific and Technical Information of China (English)
CHEN Jiannong; XU Qiang; D.R.Selviah
2002-01-01
The relation between the 2nd fractional Fourier transform and the imaging process of an optical system is discussed. By changing the coordinate scales of the input plane in respect to the magnification of the optical imaging system, the fractional Fourier transform can be a powerful tool in designing specific imaging system. The Gaussian imaging formula of single lens is obtained by using the tool. Finally the procedures are generalized for designing a double-lens imaging system through an example.
Institute of Scientific and Technical Information of China (English)
CHEN Lin-Fei; ZHAO Dao-Mu
2006-01-01
@@ We propose a new method to add different images together by optical implementation that is realized by the multi-exposure based on fractional Fourier transform hologram. Partial image fusion is proposed and realized by this method. Multiple images encryption can also be implemented by the multi-exposure of the hologram based on fractional Fourier transform. Computer simulations prove that this method is valid.
OTDM-to-WDM Conversion of Complex Modulation Formats by Time-Domain Optical Fourier Transformation
DEFF Research Database (Denmark)
Palushani, Evarist; Richter, T.; Ludwig, R.
2012-01-01
We demonstrate the utilization of the optical Fourier transform technique for serial-to-parallel conversion of 64×10-GBd OTDM data tributaries with complex modulation formats into 50-GHz DWDM grid without loss of phase and amplitude information.......We demonstrate the utilization of the optical Fourier transform technique for serial-to-parallel conversion of 64×10-GBd OTDM data tributaries with complex modulation formats into 50-GHz DWDM grid without loss of phase and amplitude information....
Time-Domain Optical Fourier Transformation for OTDM-DWDM and DWDM-OTDM Conversion
DEFF Research Database (Denmark)
Mulvad, Hans Christian Hansen; Palushani, Evarist; Galili, Michael
2011-01-01
Applications of time-domain optical Fourier transformation (OFT) in ultra-high-speed optical time-division multiplexed systems (OTDM) are reviewed, with emphasis on the recent demonstrations of OFT-based conversion between the OTDM and DWDM formats.......Applications of time-domain optical Fourier transformation (OFT) in ultra-high-speed optical time-division multiplexed systems (OTDM) are reviewed, with emphasis on the recent demonstrations of OFT-based conversion between the OTDM and DWDM formats....
Energy Technology Data Exchange (ETDEWEB)
Zheng, Y. [Pennsylvania State Univ., University Park, PA (United States)]|[Lawrence Berkeley Lab., CA (United States); Shirley, D.A. [Pennsylvania State Univ., University Park, PA (United States)
1995-02-01
The authors show by Fourier analyses of experimental data, with no further treatment, that the positions of all the strong peaks in Fourier transforms of angle-resolved photoemission extended fine structure (ARPEFS) from adsorbed surfaces can be explicitly predicted from a trial structure with an accuracy of about {+-} 0.3 {angstrom} based on a single-scattering cluster model together with the concept of a strong backscattering cone, and without any additional analysis. This characteristic of ARPEFS Fourier transforms can be developed as a simple method for determining the structures of adsorbed surfaces to an accuracy of about {+-} 0.1 {angstrom}.
Image Registration Based on Fourier-Mellin Transform%利用Fourier-Mellin变换的遥感图像自动配准
Institute of Scientific and Technical Information of China (English)
林卉; 梁亮; 杜培军; 孙华生
2012-01-01
提出了一种利用Fourier-Mellin变换的遥感图像配准方法。首先,进行Fourier变换求取频谱能量值并进行高通滤波,将滤波后的能量转换成对数极坐标,通过计算互功率谱,运用相位相关技术得到比例系数和旋转角,两幅图像按照得到的参数进行旋转缩放变换得到变换图像;然后,进行相位相关运算得到平移量,作平移变换;最终叠加显示,可以得到配准图像。实验结果表明,该算法具有很好的有效性和可靠性。%The purpose of image registration is to remove inconsistencies in geometry between the matched registration image and the reference image, including translation, rotation and scaling transform, which is the necessary premise for image contrast, data fusion, transform analysis and target recognition. A new kind of remote sensing image registration, which is called Fourier-Mellin transform method is put forward. Firstly, Fourier transform is per- formed to get frequency spectrum power for the reference image and the matched image re- spectively. Next, high-pass filtering is conducted with regard to their energy spectrum. Then, energy after filtering is converted into log-polar coordinate formation. In the case,mu- tual power spectrum can be computed adopting phase correlation technique to obtain their ro- tation angle and scale factor correspondingly. Lastly, transform image may be gotten by these parameters . And again, for reference image, high-pass filtering is performed to reduce background noise and frequency aliasing interference in the transformation process. Then, phase correlation calculation may achieve translation value, another transform image can be gotten through translation transform. Finally, registration image may gain by the two ima- ges＇ superposition. The experimental results show that the algorithm is efficiency and relia- bility.
Luo, David; Kudenov, Michael W
2016-05-16
Systematic phase errors in Fourier transform spectroscopy can severely degrade the calculated spectra. Compensation of these errors is typically accomplished using post-processing techniques, such as Fourier deconvolution, linear unmixing, or iterative solvers. This results in increased computational complexity when reconstructing and calibrating many parallel interference patterns. In this paper, we describe a new method of calibrating a Fourier transform spectrometer based on the use of artificial neural networks (ANNs). In this way, it is demonstrated that a simpler and more straightforward reconstruction process can be achieved at the cost of additional calibration equipment. To this end, we provide a theoretical model for general systematic phase errors in a polarization birefringent interferometer. This is followed by a discussion of our experimental setup and a demonstration of our technique, as applied to data with and without phase error. The technique's utility is then supported by comparison to alternative reconstruction techniques using fast Fourier transforms (FFTs) and linear unmixing.
Directory of Open Access Journals (Sweden)
Robert W. Johnson
2013-06-01
Full Text Available The properties of the Gabor and Morlet transforms are examined with respect to the Fourier analysis of discretely sampled data. Forward and inverse transform pairs based on a fixed window with uniform sampling of the frequency axis can satisfy numerically the energy and reconstruction theorems; however, transform pairs based on a variable window or nonuniform frequency sampling in general do not. Instead of selecting the shape of the window as some function of the central frequency, we propose constructing a single window with unit energy from an arbitrary set of windows that is applied over the entire frequency axis. By virtue of using a fixed window with uniform frequency sampling, such a transform satisfies the energy and reconstruction theorems. The shape of the window can be tailored to meet the requirements of the investigator in terms of time/frequency resolution. The algorithm extends naturally to the case of nonuniform signal sampling without modification beyond identification of the Nyquist interval.
Product Summability Transform of Conjugate Series of Fourier Series
Directory of Open Access Journals (Sweden)
Vishnu Narayan Mishra
2012-01-01
Full Text Available A known theorem, Nigam (2010 dealing with the degree of approximation of conjugate of a signal belonging to Lipξ(t-class by (E,1(C,1 product summability means of conjugate series of Fourier series has been generalized for the weighted W(Lr,ξ(t, (r≥1,(t>0-class, where ξ(t is nonnegative and increasing function of t, by En1Cn1~ which is in more general form of Theorem 2 of Nigam and Sharma (2011.
Automated initial guess in digital image correlation aided by Fourier-Mellin transform
Pan, Bing; Wang, Yuejiao; Tian, Long
2017-01-01
The state-of-the-art digital image correlation (DIC) method using iterative spatial-domain cross correlation, e.g., the inverse-compositional Gauss-Newton algorithm, for full-field displacement mapping requires an initial guess of deformation, which should be sufficiently close to the true value to ensure a rapid and accurate convergence. Although various initial guess approaches have been proposed, automated, robust, and fast initial guess remains to be a challenging task, especially when large rotation occurs to the deformed images. An integrated scheme, which combines the Fourier-Mellin transform-based cross correlation (FMT-CC) for seed point initiation with a reliability-guided displacement tracking (RGDT) strategy for the remaining points, is proposed to provide accurate initial guess for DIC calculation, even in the presence of large rotations. By using FMT-CC algorithm, the initial guess of the seed point can be automatically and accurately determined between pairs of interrogation subsets with up to ±180 deg of rotation even in the presence of large translation. Then the initial guess of the rest of the calculation points can be accurately predicted by the robust RGDT scheme. The robustness and effectiveness of the present initial guess approach are verified by numerical simulation tests and real experiment.
Designing A Re-Configurable Fractional Fourier Transform Architecture Using Systolic Array
Directory of Open Access Journals (Sweden)
Anal Acharya
2010-11-01
Full Text Available FRFT (Fractional Fourier Transforms algorithm, which has been derived from DFT, computes the angular domains within the time and frequency domains. This algorithm is increasingly used in the field of signal filtering, quantum mechanics and optical physics. In this paper we develop an efficient, systolic, re-configurable architecture for a particular type of FRFT called MA-CDFRFT (Multi Angle Centered Discrete FRFT. The benefit of this particular type of FRFT is that it computes all the signal components within equally spaced angles. Systolic architecture is used for this computation as it has certain advantages over the other forms like simplicity, regularity, concurrency and computation intensive The resultant product so developed should meet the challenges of today's market like marketable and cheap along with meeting customer demands. This calls for the architecture to be re-configurable. Re-configurable computer consist of a standard processor and an array of re-configurable hardware. The main processor would control the behavior of the re-configurable hardware. The re-configurable hardware would then be tailored to perform a specific task, such as image processing or pattern matching applications, as if it was built to perform this task exclusively.
Digital watermarking for still image based on discrete fractional fourier transform
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Presents a digital watermarking technique based on discrete fractional Fourier transform(DFRFT), discusses the transformation of the original image by DFRFT, and the modification of DFRFT coefficients of the original image by the information of watermark, and concludes from experimental results that the proposed tech nique is robust to lossy compression attack.
A Graphical Presentation to Teach the Concept of the Fourier Transform
Besalu, E.
2006-01-01
A study was conducted to visualize the reason why the Fourier transform technique is useful to detect the originating frequencies of a complicated superposition of waves. The findings reveal that students respond well when instructors adapt pictorial presentation to show how the time-domain function is transformed into the frequency domain.
Fourier and Schur-Weyl transforms applied to XXX Heisenberg magnet
Jakubczyk, P.; Lulek, T.; Jakubczyk, D.; Lulek, B.
2010-03-01
Similarities and differences between Fourier and Schur-Weyl transforms have been discussed in the context of a one-dimensional Heisenberg magnetic ring with N nodes. We demonstrate that main difference between them correspond to another partitioning of the Hilbert space of the magnet. In particular, we point out that application of the quantum Fourier transform corresponds to splitting of the Hilbert space of the model into subspaces associated with the orbits of the cyclic group, whereas, the Schur-Weyl transform corresponds to splitting into subspaces associated with orbits of the symmetric group.
Safari, M J; Afarideh, H; Jamili, S; Bayat, E
2016-01-01
A Discrete Fourier Transform Method (DFTM) for discrimination between the signal of neutrons and gamma rays in organic scintillation detectors is presented. The method is based on the transformation of signals into the frequency domain using the sine and cosine Fourier transforms in combination with the discrete Fourier transform. The method is largely benefited from considerable differences that usually is available between the zero-frequency components of sine and cosine and the norm of the amplitude of the DFT for neutrons and gamma-ray signals. Moreover, working in frequency domain naturally results in considerable suppression of the unwanted effects of various noise sources that is expected to be effective in time domain methods. The proposed method could also be assumed as a generalized nonlinear weighting method that could result in a new class of pulse shape discrimination methods, beyond definition of the DFT. A comparison to the traditional Charge Integration Method (CIM), as well as the Frequency G...
Rejection of Linear FM Interference in DSSS System Based on Fractional Fourier Transform
Institute of Scientific and Technical Information of China (English)
QI Lin; TAO Ran; ZHOU Si-yong
2005-01-01
A new method for the rejection of linear frequency modulation (LFM) interference in direct sequence spread spectrum (DSSS) system based on the fractional Fourier transform is proposed, and the configuration of the receiver with an interference exciser is also presented. Based on the property that the fractional Fourier transform of a signal is equivalent to rotating the signal in the time-frequency plane, the received signal is transform into a certain fractional Fourier domain, this transform will result in the least spectrum overlap between the signal and interference. Then, a narrowband filter is exploited to extract most of the interference energy. The performance analyses show that remarkable improvements in signal-to-noise ratio (SNR) and biterror-ratio (BER) are obtained.
Institute of Scientific and Technical Information of China (English)
杨雪; 李学友; 李家国; 马骏; 张力; 杨健; 杜全叶
2014-01-01
快速傅里叶变换（FFT ）是遥感影像处理的基础方法，随着高光谱、高空间和高时间分辨率遥感影像获取能力的提升，如何利用快速傅里叶变换技术快速有效地处理巨幅遥感影像是当前遥感影像处理技术中的重要环节和研究热点。傅里叶变换算法FFT是基本的图像处理算法之一，该算法可进行遥感影像的条带噪声去除、影像压缩和影像配准处理等多种用途。CUFFT函数库是NVIDIA 公司提供的基于GPU 的FFT算法库，FFTW是由MIT科学实验室计算机组在PC平台上开发的基于CPU 的FFT 算法，是目前在基于CPU的运行速度最快的FFT算法函数库，这两种实现共有的问题是当可用内存或显存的容量小于图像容量时，就会出现内存或显存溢出。针对这种问题，提出了一种基于GPU 和分块技术的巨幅遥感影像快速傅里叶变换（huge remote fast Fourier transform ，HRFFT ）算法。通过对CUDA的CUFFT函数库中的FFT算法进行改进，解决了巨幅图像内存或显存溢出的问题，并结合 HJ-1A卫星的CCD影像，通过实验与其他算法进行了对比，证明了该方法的合理性。在实际应用中，利用本文提出的 HRFFT算法，改善了影像处理的效果，提高了遥感影像的质量，同时加快了影像处理的速度，节省了计算时间，取得了较好的效果。%Fast Fourier transforms (FFT ) is a basic approach to remote sensing image processing .With the improvement of capacity of remote sensing image capture with the features of hyperspectrum ,high spatial res-olution and high temporal resolution ,how to use FFT technology to efficiently process huge remote sensing image becomes the critical step and research hot spot of current image processing technology .FFT algorithm , one of the basic algorithms of image processing ,can be used for stripe noise removal ,image compression ,im-age registration ,etc .in processing remote
Does the Entorhinal Cortex use the Fourier Transform?
Directory of Open Access Journals (Sweden)
Jeff eOrchard
2013-12-01
Full Text Available Some neurons in the entorhinal cortex (EC fire bursts when the animal occupies locations organized in a hexagonal grid pattern in their spatial environment. Place cells have also been observed, firing bursts only when the animal occupies a particular region of the environment. Both of these types of cells exhibit theta-cycle modulation, firing bursts in the 4-12Hz range. Grid cells fire bursts of action potentials that precess with respect to the theta cycle, a phenomenon dubbed "theta precession". Various models have been proposed to explain these phenomena, and how they relate to navigation. Among the most promising are the oscillator interference models. The bank-of-oscillators model proposed by Welday et al. (2011 exhibits all these features. However, their simulations are based on theoretical oscillators, and not implemented entirely with spiking neurons. We extend their work in a number of ways. First, we place the oscillators in a frequency domain and reformulate the model in terms of Fourier theory. Second, this perspective suggests a division of labour for implementing spatial maps: position, versus map layout. The animal's position is encoded in the phases of the oscillators, while the spatial map shape is encoded implicitly in the weights of the connections between the oscillators and the read-out nodes. Third, it reveals that the oscillator phases all need to conform to a linear relationship across the frequency domain. Fourth, we implement a partial model of the EC using spiking leaky integrate-and-fire (LIF neurons. Fifth, we devise new coupling mechanisms, enlightened by the global phase constraint, and show they are capable of keeping spiking neural oscillators in consistent formation. Our model demonstrates place cells, grid cells, and phase precession. The Fourier model also gives direction for future investigations, such as integrating sensory feedback to combat drift, or explaining why grid cells exist at all.
Parallel algorithms for the spectral transform method
Energy Technology Data Exchange (ETDEWEB)
Foster, I.T. [Argonne National Lab., IL (United States); Worley, P.H. [Oak Ridge National Lab., TN (United States)
1994-04-01
The spectral transform method is a standard numerical technique for solving partial differential equations on a sphere and is widely used in atmospheric circulation models. Recent research has identified several promising algorithms for implementing this method on massively parallel computers; however, no detailed comparison of the different algorithms has previously been attempted. In this paper, we describe these different parallel algorithms and report on computational experiments that we have conducted to evaluate their efficiency on parallel computers. The experiments used a testbed code that solves the nonlinear shallow water equations or a sphere; considerable care was taken to ensure that the experiments provide a fair comparison of the different algorithms and that the results are relevant to global models. We focus on hypercube- and mesh-connected multicomputers with cut-through routing, such as the Intel iPSC/860, DELTA, and Paragon, and the nCUBE/2, but also indicate how the results extend to other parallel computer architectures. The results of this study are relevant not only to the spectral transform method but also to multidimensional FFTs and other parallel transforms.
An improved model for whole genome phylogenetic analysis by Fourier transform.
Yin, Changchuan; Yau, Stephen S-T
2015-10-07
DNA sequence similarity comparison is one of the major steps in computational phylogenetic studies. The sequence comparison of closely related DNA sequences and genomes is usually performed by multiple sequence alignments (MSA). While the MSA method is accurate for some types of sequences, it may produce incorrect results when DNA sequences undergone rearrangements as in many bacterial and viral genomes. It is also limited by its computational complexity for comparing large volumes of data. Previously, we proposed an alignment-free method that exploits the full information contents of DNA sequences by Discrete Fourier Transform (DFT), but still with some limitations. Here, we present a significantly improved method for the similarity comparison of DNA sequences by DFT. In this method, we map DNA sequences into 2-dimensional (2D) numerical sequences and then apply DFT to transform the 2D numerical sequences into frequency domain. In the 2D mapping, the nucleotide composition of a DNA sequence is a determinant factor and the 2D mapping reduces the nucleotide composition bias in distance measure, and thus improving the similarity measure of DNA sequences. To compare the DFT power spectra of DNA sequences with different lengths, we propose an improved even scaling algorithm to extend shorter DFT power spectra to the longest length of the underlying sequences. After the DFT power spectra are evenly scaled, the spectra are in the same dimensionality of the Fourier frequency space, then the Euclidean distances of full Fourier power spectra of the DNA sequences are used as the dissimilarity metrics. The improved DFT method, with increased computational performance by 2D numerical representation, can be applicable to any DNA sequences of different length ranges. We assess the accuracy of the improved DFT similarity measure in hierarchical clustering of different DNA sequences including simulated and real datasets. The method yields accurate and reliable phylogenetic trees
Windhari, Ayuty; Handayani, Gunawan
2015-04-01
The 3D inversion gravity anomaly to estimate topographical density using a matlab source code from gridded data provided by Parker Oldenburg algorithm based on fast Fourier transform was computed. We extend and improved the source code of 3DINVERT.M invented by Gomez Ortiz and Agarwal (2005) using the relationship between Fourier transform of the gravity anomaly and the sum of the Fourier transform from the topography density. We gave density contrast between the two media to apply the inversion. FFT routine was implemented to construct amplitude spectrum to the given mean depth. The results were presented as new graphics of inverted topography density, the gravity anomaly due to the inverted topography and the difference between the input gravity data and the computed ones. It terminates when the RMS error is lower than pre-assigned value used as convergence criterion or until maximum of iterations is reached. As an example, we used the matlab program on gravity data of Banten region, Indonesia.
Xu, Daguang; Huang, Yong; Kang, Jin U
2014-06-16
We implemented the graphics processing unit (GPU) accelerated compressive sensing (CS) non-uniform in k-space spectral domain optical coherence tomography (SD OCT). Kaiser-Bessel (KB) function and Gaussian function are used independently as the convolution kernel in the gridding-based non-uniform fast Fourier transform (NUFFT) algorithm with different oversampling ratios and kernel widths. Our implementation is compared with the GPU-accelerated modified non-uniform discrete Fourier transform (MNUDFT) matrix-based CS SD OCT and the GPU-accelerated fast Fourier transform (FFT)-based CS SD OCT. It was found that our implementation has comparable performance to the GPU-accelerated MNUDFT-based CS SD OCT in terms of image quality while providing more than 5 times speed enhancement. When compared to the GPU-accelerated FFT based-CS SD OCT, it shows smaller background noise and less side lobes while eliminating the need for the cumbersome k-space grid filling and the k-linear calibration procedure. Finally, we demonstrated that by using a conventional desktop computer architecture having three GPUs, real-time B-mode imaging can be obtained in excess of 30 fps for the GPU-accelerated NUFFT based CS SD OCT with frame size 2048(axial) × 1,000(lateral).
Method of local pointed function reduction of original shape in Fourier transformation
Dosch, H
2002-01-01
The method for analytical reduction of the original shape in the one-dimensional Fourier transformation by the fourier image modulus is proposed. The basic concept of the method consists in the presentation of the model shape in the form of the local peak functions sum. The eigenfunctions, generated by the linear differential equations with the polynomial coefficients, are selected as the latter ones. This provides for the possibility of managing the Fourier transformation without numerical integration. This reduces the reverse task to the nonlinear regression with a small number of the evaluated parameters and to the numerical or asymptotic study on the model peak functions - the eigenfunctions of the differential tasks and their fourier images
Locke, Jonathan; White, Paul R
2011-10-01
The analysis of cetacean vocalizations is considered using Fourier-based techniques that employ chirp functions in their decomposition. In particular, the paper considers a short-time methods based on the fractional Fourier transform for detecting frequency modulated narrow-band signals, such as dolphin whistles, and compares this to the classical short-time Fourier methods. The fractional Fourier technique explored computes transforms associated with a range of chirp rates and automatically selects the rate for the final analysis. This avoids the need for prior knowledge of signal's chirp rate. An analysis is presented that details the performance of both methods as signal detectors and allows one to determine their detection thresholds. These thresholds are then used to measure the detectability of synthetic signals. This principle is then extended to measure performance on a set of recordings of narrow-band vocalizations from a range of cetacean species.
Fourier and Hadamard transform spectrometers - A limited comparison. II
Harwit, M.; Tai, M. H.
1977-01-01
A mathematical approach was used to compare interferometric spectrometers and Hadamard transform spectrometers. The principle results are reported, noting that the simple Hadamard spectrometer encodes more efficiently than a Michelson interferometer which, in turn, encodes less efficiently than is usually acknowledged. Hirschfeld's (1977) major objections to these findings are discussed, although it is noted that none of his objections is supported by evidence.
On Analog of Fourier Transform in Interior of the Light Cone
Directory of Open Access Journals (Sweden)
Tatyana Shtepina
2014-01-01
Full Text Available We introduce an analog of Fourier transform Fhρ in interior of light cone that commutes with the action of the Lorentz group. We describe some properties of Fhρ, namely, its action on pseudoradial functions and functions being products of pseudoradial function and space hyperbolic harmonics. We prove that Fhρ-transform gives a one-to-one correspondence on each of the irreducible components of quasiregular representation. We calculate the inverse transform too.
Fast Algorithm for Computing the Discrete Hartley Transform of Type-II
Directory of Open Access Journals (Sweden)
Mounir Taha Hamood
2016-06-01
Full Text Available The generalized discrete Hartley transforms (GDHTs have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT algorithm for the fast calculation of the GDHT of type-II (DHT-II is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.
Improved FHT Algorithms for Fast Computation of the Discrete Hartley Transform
Directory of Open Access Journals (Sweden)
M. T. Hamood
2013-05-01
Full Text Available In this paper, by using the symmetrical properties of the discrete Hartley transform (DHT, an improved radix-2 fast Hartley transform (FHT algorithm with arithmetic complexity comparable to that of the real-valued fast Fourier transform (RFFT is developed. It has a simple and regular butterfly structure and possesses the in-place computation property. Furthermore, using the same principles, the development can be extended to more efficient radix-based FHT algorithms. An example for the improved radix-4 FHT algorithm is given to show the validity of the presented method. The arithmetic complexity for the new algorithms are computed and then compared with the existing FHT algorithms. The results of these comparisons have shown that the developed algorithms reduce the number of multiplications and additions considerably.
Products of multiple Fourier series with application to the multiblade transformation
Kunz, D. L.
1981-01-01
A relatively simple and systematic method for forming the products of multiple Fourier series using tensor like operations is demonstrated. This symbolic multiplication can be performed for any arbitrary number of series, and the coefficients of a set of linear differential equations with periodic coefficients from a rotating coordinate system to a nonrotating system is also demonstrated. It is shown that using Fourier operations to perform this transformation make it easily understood, simple to apply, and generally applicable.
Fast and Parallel Spectral Transform Algorithms for Global Shallow Water Models
Jakob, Ruediger
1993-01-01
This dissertation examines spectral transform algorithms for the solution of the shallow water equations on the sphere and studies their implementation and performance on shared memory vector multiprocessors. Beginning with the standard spectral transform algorithm in vorticity divergence form and its implementation in the Fortran based parallel programming language Force, two modifications are researched. First, the transforms and matrices associated with the meridional derivatives of the associated Legendre functions are replaced by corresponding operations with the spherical harmonic coefficients. Second, based on the fast Fourier transform and the fast multipole method, a lower complexity algorithm is derived that uses fast transformations between Legendre and interior Fourier nodes, fast surface spherical truncation and a fast spherical Helmholtz solver. The first modification is fully implemented, and comparative performance data are obtained for varying resolution and number of processes, showing a significant storage saving and slightly reduced execution time on a Cray Y -MP 8/864. The important performance parameters for the spectral transform algorithm and its implementation on vector multiprocessors are determined and validated with the measured performance data. The second modification is described at the algorithmic level, but only the novel fast surface spherical truncation algorithm is implemented. This new multipole algorithm has lower complexity than the standard algorithm, and requires asymptotically only order N ^2log N operations per time step for a grid with order N^2 points. Because the global shallow water equations are similar to the horizontal dynamical component of general circulation models, the results can be applied to spectral transform numerical weather prediction and climate models. In general, the derived algorithms may speed up the solution of time dependent partial differential equations in spherical geometry. A performance model
Fractional Fourier transform-based optical encryption with treble random phase-encoding
Xin, Yi; Tao, Ran; Wang, Yue
2008-03-01
We propose a new architecture of optical encryption technique using the fractional Fourier transform with three statistically independent random phase masks. Compared with the existing double-phase encoding method in the fractional Fourier-domain, the proposed extra phase mask in the last fractional Fourier domain makes the architecture symmetrical, and additive processing to the encrypted image can be turned into complex stationary white noise after decryption, and enlarge the key space without any degradation of its robustness to blind decryption. This property can be utilized to improve the quality of the recover image. Simulation results have verified the validity.
Generating bit reversed numbers for calculating fast fourier transform
Digital Repository Service at National Institute of Oceanography (India)
Suresh, T.
(6) x (7)). Calculation of FFT becomes a difficult task for computation with input data in natural order and without reordering. Thus an efficient method of reordering is required for FFT calculation. We review a few methods of generating bit... with each successive stage. Other algorithms that depend on the efficient use of swapping data from an array are given in Buneman (1986) Evans (1987) and Walker (1990). Swapping of data is the most widely used method for reordering in FFT calculation. A...
Directory of Open Access Journals (Sweden)
A. Kleinert
2014-12-01
Full Text Available The Gimballed Limb Observer for Radiance Imaging of the Atmosphere (GLORIA is an imaging Fourier transform spectrometer that is capable of operating on various high-altitude research aircraft. It measures the atmospheric emission in the thermal infrared spectral region in limb and nadir geometry. GLORIA consists of a classical Michelson interferometer combined with an infrared camera. The infrared detector has a usable area of 128 × 128 pixels, measuring up to 16 384 interferograms simultaneously. Imaging Fourier transform spectrometers impose a number of challenges with respect to instrument calibration and algorithm development. The optical setup with extremely high optical throughput requires the development of new methods and algorithms for spectral and radiometric calibration. Due to the vast amount of data there is a high demand for scientifically intelligent optimisation of the data processing. This paper outlines the characterisation and processing steps required for the generation of radiometrically and spectrally calibrated spectra. Methods for performance optimisation of the processing algorithm are presented. The performance of the data processing and the quality of the calibrated spectra are demonstrated for measurements collected during the first deployments of GLORIA on aircraft.
Institute of Scientific and Technical Information of China (English)
吴春旺; 韩阳; 邓志姣; 李虹轶; 陈平形; 李承祖
2011-01-01
We propose a theoretical scheme for realizing the general conditional phase shift gate of charge qubits situated in a high-Q superconducting transmission line resonator. The phase shifting angle can be tuned from 0 to 27r by simply adjusting the qubit-resonator detuning and the interaction time. Based on this gate proposal, we give a detailed procedure to implement the three-qubit quantum Fourier transform with circuit quantum eleetrodynamics （QED）. A careful analysis of the decoherence sources shows that the algorithm can be achieved with a high fidelity using current circuit QED techniques.
Adaptive motion mapping in pancreatic SBRT patients using Fourier transforms
Jones, Bernard L; Miften, Moyed
2015-01-01
Recent studies suggest that 4DCT is unable to accurately measure respiratory-induced pancreatic tumor motion. In this work, we assessed the daily motion of pancreatic tumors treated with SBRT, and developed adaptive strategies to predict and account for this motion. The daily motion trajectory of pancreatic tumors during CBCT acquisition was calculated using a model which reconstructs the instantaneous 3D position in each 2D CBCT projection image. We developed a metric (termed "Spectral Coherence," SC) based on the Fourier frequency spectrum of motion in the SI direction, and analyzed the ability of SC to predict motion-based errors and classify patients according to motion characteristics. The amplitude of daily motion exceeded the predictions of pre-treatment 4DCT imaging by an average of 3.0 mm, 2.3 mm, and 3.5 mm in the AP, LR, and SI directions. SC was correlated with daily motion differences and tumor dose coverage. In a simulated adaptive protocol, target margins were adjusted based on SC, resulting in...
Grid-Based Fourier Transform Phase Contrast Imaging
Tahir, Sajjad
Low contrast in x-ray attenuation imaging between different materials of low electron density is a limitation of traditional x-ray radiography. Phase contrast imaging offers the potential to improve the contrast between such materials, but due to the requirements on the spatial coherence of the x-ray beam, practical implementation of such systems with tabletop (i.e. non-synchrotron) sources has been limited. One recently developed phase imaging technique employs multiple fine-pitched gratings. However, the strict manufacturing tolerances and precise alignment requirements have limited the widespread adoption of grating-based techniques. In this work, we have investigated a technique recently demonstrated by Bennett et al. that utilizes a single grid of much coarser pitch. Our system consisted of a low power 100 microm spot Mo source, a CCD with 22 microm pixel pitch, and either a focused mammography linear grid or a stainless steel woven mesh. Phase is extracted from a single image by windowing and comparing data localized about harmonics of the grid in the Fourier domain. A Matlab code was written to perform the image processing. For the first time, the effects on the diffraction phase contrast and scattering amplitude images of varying grid types and periods, and of varying the window function type used to separate the harmonics, and the window widths, were investigated. Using the wire mesh, derivatives of the phase along two orthogonal directions were obtained and new methods investigated to form improved phase contrast images.
Mesh-based phase contrast Fourier transform imaging
Tahir, Sajjad; Bashir, Sajid; MacDonald, C. A.; Petruccelli, Jonathan C.
2017-04-01
Traditional x-ray radiography is limited by low attenuation contrast in materials of low electron density. Phase contrast imaging offers the potential to improve the contrast between such materials, but due to the requirements on the spatial coherence of the x-ray beam, practical implementation of such systems with tabletop (i.e. non-synchrotron) sources has been limited. One phase imaging technique employs multiple fine-pitched gratings. However, the strict manufacturing tolerances and precise alignment requirements have limited the widespread adoption of grating-based techniques. In this work, we have investigated a recently developed technique that utilizes a single grid of much coarser pitch. Our system consisted of a low power 100 μm spot Mo source, a CCD with 22 μm pixel pitch, and either a focused mammography linear grid or a stainless steel woven mesh. Phase is extracted from a single image by windowing and comparing data localized about harmonics of the mesh in the Fourier domain. The effects on the diffraction phase contrast and scattering amplitude images of varying grid types and periods, and of varying the width of the window function used to separate the harmonics were investigated. Using the wire mesh, derivatives of the phase along two orthogonal directions were obtained and combined to form improved phase contrast images.
Libpsht - algorithms for efficient spherical harmonic transforms
Reinecke, Martin
2010-01-01
Libpsht (or "library for Performant Spherical Harmonic Transforms") is a collection of algorithms for efficient conversion between spatial-domain and spectral-domain representations of data defined on the sphere. The package supports transforms of scalars as well as spin-1 and spin-2 quantities, and can be used for a wide range of pixelisations (including HEALPix, GLESP and ECP). It will take advantage of hardware features like multiple processor cores and floating-point vector operations, if available. Even without this additional acceleration, the employed algorithms are among the most efficient (in terms of CPU time as well as memory consumption) currently being used in the astronomical community. The library is written in strictly standard-conforming C90, ensuring portability to many different hard- and software platforms, and allowing straightforward integration with codes written in various programming languages like C, C++, Fortran, Python etc. Libpsht is distributed under the terms of the GNU General ...
Functional differential equations for the q-Fourier transform of q-Gaussians
Energy Technology Data Exchange (ETDEWEB)
Umarov, S [Department of Mathematics, Tufts University, Medford, MA (United States); Queiros, S M Duarte, E-mail: sdqueiro@gmail.co [Unilever R and D Port Sunlight, Quarry Road East, Wirral, CH63 3JW (United Kingdom)
2010-02-05
In this paper the question 'is the q-Fourier transform of a q-Gaussian a q'-Gaussian (with some q') up to a constant factor?' is studied for the whole range of q in (- infty, 3). This question is connected with applicability of the q-Fourier transform in the study of limit processes in nonextensive statistical mechanics. Using the functional differential equation approach we prove that the answer is affirmative if and only if 1 <= q < 3, excluding two particular cases of q < 1, namely q=1/2 and q=2/3. Complementarily, we discuss some applications of the q-Fourier transform to nonlinear partial differential equations such as the porous medium equation.
Image encryption based on the reality-preserving multiple-parameter fractional Fourier transform
Lang, Jun
2012-05-01
In recent years, a number of methods have been proposed in the literature for the encryption of two-dimensional information by using the fractional Fourier transform, but most of their encryptions are complex values and need digital hologram technique to record information, which is inconvenient for digital transmission. In this paper, we propose a new approach for image encryption based on the real-valuedness and decorrelation property of the reality-preserving multiple-parameter fractional Fourier transform in order to meet the requirements of the secure image transmission. In the proposed scheme, the original and encrypted images are respectively in the spatial domain and the reality-preserving multiple-parameter fractional Fourier transformed domain determined by the encryption keys. Numerical simulations are performed to demonstrate that the proposed method is reliable and more robust to blind decryption than several existing methods.
Inversion of Fourier Transforms by Means of Scale-Frequency Series
Directory of Open Access Journals (Sweden)
Nassar H. S. Haidar
2014-01-01
Full Text Available We report on inversion of the Fourier transform when the frequency variable can be scaled in a variety of different ways that improve the resolution of certain parts of the frequency domain. The corresponding inverse Fourier transform is shown to exist in the form of two dual scale-frequency series. Upon discretization of the continuous scale factor, this Fourier transform series inverse becomes a certain nonharmonic double series, a discretized scale-frequency (DSF series. The DSF series is also demonstrated, theoretically and practically, to be rate-optimizable with respect to its two free parameters, when it satisfies, as an entropy maximizer, a pertaining recursive nonlinear programming problem incorporating the entropy-based uncertainty principle.
Atomic Gaussian type orbitals and their Fourier transforms via the Rayleigh expansion
Yükçü, Niyazi
2016-03-01
Gaussian type orbitals (GTOs), which are one of the types of exponential type orbitals (ETOs), are used usually as basis functions in the multi-center atomic and molecular integrals to better understand physical and chemical properties of matter. In the Fourier transform method (FTM), basis functions have not simplicity to make mathematical operations, but their Fourier transforms are easier to use. In this work, with the help of FTM, Rayleigh expansion and some properties of unnormalized GTOs, we present new mathematical results for the Fourier transform of GTOs in terms of Laguerre polynomials, hypergeometric and Whittaker functions. Physical and analytical properties of GTOs are discussed and some numerical results have been given in a table. Finally, we compare our mathematical results with the other known literature results by using a computer program and details of evaluation are presented.
Munoz, R. M. (Inventor)
1974-01-01
An input analog signal to be frequency analyzed is separated into N number of simultaneous analog signal components each identical to the original but delayed relative to the original by a successively larger time delay. The separated and delayed analog components are combined together in a suitable number of adders and attenuators in accordance with at least one component product of the continuous Fourier transform and analog signal matrices to separate the analog input signal into at least one of its continuous analog frequency components of bandwidth 1/N times the bandwidth of the original input signal. The original analog input signal can be reconstituted by combining the separate analog frequency components in accordance with the component products of the continuous Fourier transform and analog frequency component matrices. The continuous Fourier transformation is useful for spectrum analysis, filtering, transfer function synthesis, and communications.
van Agthoven, Maria A.; Barrow, Mark P.; Chiron, Lionel; Coutouly, Marie-Aude; Kilgour, David; Wootton, Christopher A.; Wei, Juan; Soulby, Andrew; Delsuc, Marc-André; Rolando, Christian; O'Connor, Peter B.
2015-12-01
Two-dimensional Fourier transform ion cyclotron resonance mass spectrometry is a data-independent analytical method that records the fragmentation patterns of all the compounds in a sample. This study shows the implementation of atmospheric pressure photoionization with two-dimensional (2D) Fourier transform ion cyclotron resonance mass spectrometry. In the resulting 2D mass spectrum, the fragmentation patterns of the radical and protonated species from cholesterol are differentiated. This study shows the use of fragment ion lines, precursor ion lines, and neutral loss lines in the 2D mass spectrum to determine fragmentation mechanisms of known compounds and to gain information on unknown ion species in the spectrum. In concert with high resolution mass spectrometry, 2D Fourier transform ion cyclotron resonance mass spectrometry can be a useful tool for the structural analysis of small molecules.
Fourier-transform spectroscopy: new methods and applications: introduction by the feature editors.
Traub, W A; Winkel, R J; Goldman, A
1996-06-01
We are pleased to introduce this special issue of papers on Fourier-transform spectroscopy, which grew out of a recent topical meeting sponsored by the Optical Society of America. The topical meeting welcomed all researchers who practice the art of Fourier-transform spectroscopy in the laboratory, in the atmosphere, and in space. The power and the wide applicability of Fourier-transform spectroscopy unite these fields with a common mathematical and instrumental bond. The meeting probed each of these areas in depth, bringing out new ideas for instrumentation, analysis, and applications. There was a strong sentiment at the meeting that the quality of papers and posters was exceptionally high and that it would be important for future progress in the field to have the results of this meeting captured in print. This special issue is the fruit of that effort.
3-D superposition for radiotherapy treatment planning using fast Fourier transforms.
Murray, D C; Hoban, P W; Metcalfe, P E; Round, W H
1989-09-01
Currently used radiotherapy treatment planning algorithms based on effective path length or scatter function methods do not model electron ranging from photon interaction sites. The superposition (or convolution) technique does model this effect, which is especially important at higher (linear accelerator) energies since the electron range is significant. Another advantage of this method is that it is conceptually simple and models the physical processes directly, rather than using empirically derived methods. A major disadvantage of superposition lies in the large amount of computer time required to generate a plan, especially in three dimensions. To help solve this problem, superposition using an invariant dose spread array (kernel) can be achieved by performing a convolution in Fourier space using fast Fourier transforms (FFTs). A method for 3 dimensional calculation of dose using FFTs is presented. Dose spread arrays are calculated using the EGS Monte Carlo code, and convolved with the TERMA (total energy released per unit mass). In both cases a 10 MV nominal beam energy is modelled by a 10 component spectrum, which is compared to the result obtained using monochromatic energy only (3.0 MeV at the surface). The FFT technique is shown to be significantly faster than standard convolution for medium to large TERMA and dose spread array sizes. The method is shown to be highly accurate for small fields in homogeneous media. For larger fields the central axis depth dose is accurate but the profile shape in the penumbral region becomes slightly distorted. This is because photons incident near the beam edges are not parallel to the cartesian coordinate system used as the convolution framework. However, this effect is sufficiently small to indicate that the convolution method is suitable for use in routine treatment planning.
Goodman, Roe W
2016-01-01
This textbook for undergraduate mathematics, science, and engineering students introduces the theory and applications of discrete Fourier and wavelet transforms using elementary linear algebra, without assuming prior knowledge of signal processing or advanced analysis.It explains how to use the Fourier matrix to extract frequency information from a digital signal and how to use circulant matrices to emphasize selected frequency ranges. It introduces discrete wavelet transforms for digital signals through the lifting method and illustrates through examples and computer explorations how these transforms are used in signal and image processing. Then the general theory of discrete wavelet transforms is developed via the matrix algebra of two-channel filter banks. Finally, wavelet transforms for analog signals are constructed based on filter bank results already presented, and the mathematical framework of multiresolution analysis is examined.
Fourier Domain Decoding Algorithm of Non-Binary LDPC codes for Parallel Implementation
Kasai, Kenta
2010-01-01
For decoding non-binary low-density parity check (LDPC) codes, logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing quantization effects of SP algorithm in conjunction with FFT. Since FFT is not applicable in the logarithm domain, the computations required at check nodes in the Log-SP algorithms are computationally intensive. What is worth, check nodes usually have higher degree than variable nodes. As a result, most of the time for decoding is used for check node computations, which leads to a bottleneck effect. In this paper, we propose a Log-SP algorithm in the Fourier domain. With this algorithm, the role of variable nodes and check nodes are switched. The intensive computations are spread over lower-degree variable nodes, which can be efficiently calculated in parallel. Furthermore, we develop a fast calculation method for the estimated bits and syndromes in the Fourier domain.
q-Extension of Mehta's eigenvectors of the finite Fourier transform for q, a root of unity
Energy Technology Data Exchange (ETDEWEB)
Atakishiyeva, Mesuma K [Facultad de Ciencias, Universidad Autonoma del Estado de Morelos, CP 62250 Cuernavaca, Morelos (Mexico); Atakishiyev, Natig M [Instituto de Matematicas, Unidad Cuernavaca Universidad Nacional Autonoma de Mexico, AP 273-3 Admon 3, Cuernavaca, Morelos 62251 (Mexico); Koornwinder, Tom H [Korteweg-de Vries Institute, University of Amsterdam, PO Box 94248, 1090 GE Amsterdam (Netherlands)], E-mail: mesuma@servm.fc.uaem.mx, E-mail: natig@matcuer.unam.mx, E-mail: T.H.Koornwinder@uva.nl
2009-10-30
It is shown that the continuous q-Hermite polynomials for q, a root of unity, have simple transformation properties with respect to the classical Fourier transform. This result is then used to construct q-extended eigenvectors of the finite Fourier transform in terms of these polynomials.
Directory of Open Access Journals (Sweden)
Sarunya Kanjanawattana
2017-07-01
Full Text Available Image classification plays a vital role in many areas of study, such as data mining and image processing; however, serious problems collectively referred to as the course of dimensionality have been encountered in previous studies as factors that reduce system performance. Furthermore, we also confront the problem of different graph characteristics even if graphs belong to same types. In this study, we propose a novel method of graph-type classification. Using our approach, we open up a new solution of high-dimensional images and address problems of different characteristics by converting graph images to one dimension with a discrete Fourier transformation and creating numeric datasets using wavelet and Hough transformations. Moreover, we introduce a new classifier, which is a combination between artificial neuron networks (ANNs and support vector machines (SVMs, which we call ANNSVM, to enhance accuracy. The objectives of our study are to propose an effective graph-type classification method that includes finding a new data representative used for classification instead of two-dimensional images and to investigate what features make our data separable. To evaluate the method of our study, we conducted five experiments with different methods and datasets. The input dataset we focused on was a numeric dataset containing wavelet coefficients and outputs of a Hough transformation. From our experimental results, we observed that the highest accuracy was provided using our method with Coiflet 1, which achieved a 0.91 accuracy.
DEFF Research Database (Denmark)
Guan, Pengyu; Røge, Kasper Meldgaard; Kjøller, Niels-Kristian;
2015-01-01
We propose a novel all-optical WDM regeneration scheme for DPSK signals based on optical Fourier transformation and phase sensitive amplification. Phase regeneration of a WDM signal consisting of 4x10-Gbit/s phase noise degraded DPSK channels is demonstrated for the first time.......We propose a novel all-optical WDM regeneration scheme for DPSK signals based on optical Fourier transformation and phase sensitive amplification. Phase regeneration of a WDM signal consisting of 4x10-Gbit/s phase noise degraded DPSK channels is demonstrated for the first time....
Change of Scale Formulas for Wiener Integrals Related to Fourier-Feynman Transform and Convolution
Directory of Open Access Journals (Sweden)
Bong Jin Kim
2014-01-01
Full Text Available Cameron and Storvick discovered change of scale formulas for Wiener integrals of functionals in Banach algebra S on classical Wiener space. Yoo and Skoug extended these results for functionals in the Fresnel class F(B and in a generalized Fresnel class FA1,A2 on abstract Wiener space. We express Fourier-Feynman transform and convolution product of functionals in S as limits of Wiener integrals. Moreover we obtain change of scale formulas for Wiener integrals related to Fourier-Feynman transform and convolution product of these functionals.
The Pegg-Barnett phase operator and the discrete Fourier transform
Perez-Leija, Armando; Andrade-Morales, Luis A.; Soto-Eguibar, Francisco; Szameit, Alexander; Moya-Cessa, Héctor M.
2016-04-01
In quantum mechanics the position and momentum operators are related to each other via the Fourier transform. In the same way, here we show that the so-called Pegg-Barnett phase operator can be obtained by the application of the discrete Fourier transform to the number operators defined in a finite-dimensional Hilbert space. Furthermore, we show that the structure of the London-Susskind-Glogower phase operator, whose natural logarithm gives rise to the Pegg-Barnett phase operator, is contained in the Hamiltonian of circular waveguide arrays. Our results may find applications in the development of new finite-dimensional photonic systems with interesting phase-dependent properties.
Interferometric time delay correction for Fourier transform spectroscopy in the extreme ultraviolet
Meng, Yijian; Zhang, Chunmei; Marceau, Claude; Naumov, A. Yu.; Corkum, P. B.; Villeneuve, D. M.
2016-09-01
We demonstrate a Fourier transform spectrometer in the extreme ultraviolet (XUV) spectrum using a high-harmonic source, with wavelengths as short as 32 nm. The femtosecond infrared laser source is divided into two separate foci in the same gas jet to create two synchronized XUV sources. An interferometric method to determine the relative delay between the two sources is shown to improve the accuracy of the delay time, with corrections of up to 200 asec required. By correcting the time base before the Fourier transform, the frequency resolution is improved by up to an order of magnitude.
Estimation of structural modal parameters by fourier transform with an optimal window
Institute of Scientific and Technical Information of China (English)
ZHU Hong-ping; WAN Xin-hua
2005-01-01
An adaptive Fourier Transform (FT) with an optimal window has been proposed for the time-frequency analysis of nonstationary time series. The method allows for a good estimation of both frequency and amplitude of the spectrum and can be easily applied to the general case of time-varying signals. The evaluation of the proposed approach has been performed on measured time-varying signals from a suspension bridge model and a steel frame model whose data have the typical non-stationary characteristics. The numerical results show that the proposed approach can overcome some of the difficulties encountered in the classic Fourier transform technique and can achieve higher computation accuracy.
DWDM-TO-OTDM Conversion by Time-Domain Optical Fourier Transformation
DEFF Research Database (Denmark)
Mulvad, Hans Christian Hansen; Hu, Hao; Galili, Michael
2011-01-01
We propose DWDM-OTDM conversion by time-domain optical Fourier transformation. Error-free conversion of a 16×10 Gbit/s 50 GHz-spacing DWDM data signal to a 160 Gbit/s OTDM signal with a 2.1 dB average penalty is demonstrated.......We propose DWDM-OTDM conversion by time-domain optical Fourier transformation. Error-free conversion of a 16×10 Gbit/s 50 GHz-spacing DWDM data signal to a 160 Gbit/s OTDM signal with a 2.1 dB average penalty is demonstrated....
DEFF Research Database (Denmark)
Hu, Hao; Kong, Deming; Palushani, Evarist
2013-01-01
We demonstrate transmission of a 1.28-Tbaud Nyquist-OTDM signal over a record distance of 100 km with detection by time-domain optical Fourier transformation followed by FEC decoding, resulting in error-free performance for all tributaries.......We demonstrate transmission of a 1.28-Tbaud Nyquist-OTDM signal over a record distance of 100 km with detection by time-domain optical Fourier transformation followed by FEC decoding, resulting in error-free performance for all tributaries....
DEFF Research Database (Denmark)
Guan, Pengyu; Da Ros, Francesco; Lillieholm, Mads
2016-01-01
We demonstrate simultaneous phase regeneration of 16-WDM DPSK channels using optical Fourier transformation and a single phase-sensitive amplifier. The BERs of 16-WDM×10-Gbit/s phase noise degraded DPSK signals are improved by 0.4-1.3 orders of magnitude......We demonstrate simultaneous phase regeneration of 16-WDM DPSK channels using optical Fourier transformation and a single phase-sensitive amplifier. The BERs of 16-WDM×10-Gbit/s phase noise degraded DPSK signals are improved by 0.4-1.3 orders of magnitude...
Weighting iterative Fourier transform algorithm of the kinoform synthesis.
Kuzmenko, Alexander V
2008-05-15
Two object-dependent filters (an amplitude and a phase filter) are used in the object plane on the iterative calculation of a kinoform instead of a single (phase) filter as usual. The amplitude filter is a system of weight coefficients that vary in the process of iterations and control the amplitude of an input object. The advantages of the proposed method over other ones are confirmed by computer-based experiments. It is found that the method is most efficient for binary objects.
Wang, Yunxin; Wang, Dayong; Zhao, Jie; Li, Yan; Meng, Puhui; Wan, Yuhong; Jiang, Zhuqing
2010-08-01
The number of cells is commonly employed to describe the cell viability and the status of cell culture in a certain extent. An automatic and non-invasive detecting method for the status analysis of cell culture is developed based on digital holography microscopy (DHM) technology. Digital holographic imaging can retrieve quantitative information of object wavefront by the numerical reconstruction from a single digital hologram recorded by a detector such as CCD or CMOS camera, which is especially suitable for the morphology detection of the transparent or semi-transparent cells. In this contribution, the lensless Fourier transform (LFT) based holography configuration is designed for cell imaging without prestaining, and the amplitude and phase of living cells can be reconstructed by digital reconstruction and phase unwrapped algorithms. Then the image filtering and segmentation are combined for the automatic evaluation of the level of confluency. In imaging experiments, the culture status of the cervical cancer cell TZMbl is detected, and the results demonstrate that digital holography microscopy provides a feasible non-invasive method for monitoring the living cell culture.
Mackanos, Mark A.; Hargrove, John; Wolters, Rolf; Du, Christine B.; Friedland, Shai; Soetikno, Roy M.; Contag, Christopher H.; Arroyo, May R.; Crawford, James M.; Wang, Thomas D.
2009-07-01
Fourier transform infrared (FTIR) spectroscopy is sensitive to the molecular composition of tissue and has the potential to identify premalignant tissue (dysplasia) as an adjunct to endoscopy. We demonstrate collection of mid-infrared absorption spectra with a silver halide (AgCl0.4Br0.6) optical fiber and use spectral preprocessing to identify optimal subranges that classify colonic mucosa as normal, hyperplasia, or dysplasia. We collected spectra (n=83) in the 950 to 1800 cm-1 regime on biopsy specimens obtained from human subjects (n=37). Subtle differences in the magnitude of the absorbance peaks at specific wave numbers were observed. The best double binary algorithm for distinguishing normal-versus-dysplasia and hyperplasia-versus-dysplasia was determined from an exhaustive search of spectral intervals and preprocessing techniques. Partial least squares discriminant analysis was used to classify the spectra using a leave-one-subject-out cross-validation strategy. The results were compared with histology reviewed independently by two gastrointestinal pathologists. The optimal thresholds identified resulted in an overall sensitivity, specificity, accuracy, and positive predictive value of 96%, 92%, 93%, and 82%, respectively. These results indicated that mid-infrared absorption spectra collected remotely with an optical fiber can be used to identify colonic dysplasia with high accuracy, suggesting that continued development of this technique for the early detection of cancer is promising.
Vuiblet, Vincent; Fere, Michael; Gobinet, Cyril; Birembaut, Philippe; Piot, Olivier; Rieu, Philippe
2016-08-01
Renal interstitial fibrosis and interstitial active inflammation are the main histologic features of renal allograft biopsy specimens. Fibrosis is currently assessed by semiquantitative subjective analysis, and color image analysis has been developed to improve the reliability and repeatability of this evaluation. However, these techniques fail to distinguish fibrosis from constitutive collagen or active inflammation. We developed an automatic, reproducible Fourier-transform infrared (FTIR) imaging-based technique for simultaneous quantification of fibrosis and inflammation in renal allograft biopsy specimens. We generated and validated a classification model using 49 renal biopsy specimens and subsequently tested the robustness of this classification algorithm on 166 renal grafts. Finally, we explored the clinical relevance of fibrosis quantification using FTIR imaging by comparing results with renal function at 3 months after transplantation (M3) and the variation of renal function between M3 and M12. We showed excellent robustness for fibrosis and inflammation classification, with >90% of renal biopsy specimens adequately classified by FTIR imaging. Finally, fibrosis quantification by FTIR imaging correlated with renal function at M3, and the variation in fibrosis between M3 and M12 correlated well with the variation in renal function over the same period. This study shows that FTIR-based analysis of renal graft biopsy specimens is a reproducible and reliable label-free technique for quantifying fibrosis and active inflammation. This technique seems to be more relevant than digital image analysis and promising for both research studies and routine clinical practice.
Big data in reciprocal space: Sliding fast Fourier transforms for determining periodicity
Energy Technology Data Exchange (ETDEWEB)
Vasudevan, Rama K., E-mail: rvv@ornl.gov; Belianinov, Alex; Baddorf, Arthur P.; Tselev, Alexander; Jesse, S. [Center for Nanophase Materials Sciences, Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831 (United States); Institute for Functional Imaging of Materials, Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831 (United States); Gianfrancesco, Anthony G. [UT/ORNL Bredesen Center, University of Tennessee, Knoxville, Tennessee 37996 (United States); Kalinin, Sergei V. [Center for Nanophase Materials Sciences, Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831 (United States); Institute for Functional Imaging of Materials, Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831 (United States); UT/ORNL Bredesen Center, University of Tennessee, Knoxville, Tennessee 37996 (United States)
2015-03-02
Significant advances in atomically resolved imaging of crystals and surfaces have occurred in the last decade allowing unprecedented insight into local crystal structures and periodicity. Yet, the analysis of the long-range periodicity from the local imaging data, critical to correlation of functional properties and chemistry to the local crystallography, remains a challenge. Here, we introduce a Sliding Fast Fourier Transform (FFT) filter to analyze atomically resolved images of in-situ grown La{sub 5/8}Ca{sub 3/8}MnO{sub 3} (LCMO) films. We demonstrate the ability of sliding FFT algorithm to differentiate two sub-lattices, resulting from a mixed-terminated surface. Principal Component Analysis and Independent Component Analysis of the Sliding FFT dataset reveal the distinct changes in crystallography, step edges, and boundaries between the multiple sub-lattices. The implications for the LCMO system are discussed. The method is universal for images with any periodicity, and is especially amenable to atomically resolved probe and electron-microscopy data for rapid identification of the sub-lattices present.
Menke, Jan; Helms, Gunther; Larsen, Jörg
2010-01-01
The purpose of this experimental study was to evaluate whether the effective k-space coverage of MR images can in principle be viewed after multidimensional Fourier transform back to k-space. A water-soaked sponge phantom providing homogeneous k-space pattern was imaged with different standard MR sequences, utilizing elliptic acquisitions, partial-Fourier acquisitions and elliptic filtering as imaging examples. The resulting MR images were Fourier-transformed to the spatial frequency domain (the k-space) to visualize their effective k-space coverage. These frequency domain images are named "backtransformed k-space images." For a quantitative assessment, the sponge phantom was imaged with three-dimensional partial-Fourier sequences while varying the partial acquisition parameters in slice and phase direction. By linear regression analysis, the k-space coverage as expected from the sequence menu parameters was compared to the effective k-space coverage as observed in the backtransformed k-space images. The k-space coverage of elliptic and partial-Fourier acquisitions became visible in the backtransformed k-space images, as well as the effect of elliptic filtering. The expected and the observed k-space coverage showed a highly significant correlation (r=.99, PFourier-transforming MR images of a sponge phantom back to k-space. This method could be used for several purposes including sequence parameter optimization, basic imaging research, and to enhance a visual understanding of k-space, especially in three-dimensional MR imaging.
Fourier Transform Near Infrared Spectrometry: Using Interferograms To Determine Chemical Composition
Hoy, R. M.; McClure, W. Fred
1989-12-01
Previous research conducted in this laboratory has demonstrated several advantages accrued by transforming near infrared spectra from the wavelength domain to the Fourier domain. Those advantages include: [1] smoothing wavelength domain data without loss of end points, [2] correcting for particle size phenomena encountered in solid sample analyses by simply omitting the mean term Fourier coefficient from the "retransformation process", [3] minimizing the multicollinearity problem prevalent in wavelength space, [4] generating wavelength-space derivatives from Fourier space without loss of end points, [5] performing band enhancements via Fourier self-deconvolution, [6] identifying sample type using Fourier vectors, [7] estimating chemical composition using only the first few Fourier coefficients, [8] cutting of computer storage requirements by more than 96%, [9] cutting of calibration time by more than 96%, hence [10] reducing the drudgery of maintaining calibrations. That the first 12 Fourier coefficients contain sufficient information to determine chemical constituents in many products has turned out to be a major advantage leading us to understand that the chemical absorption information in the wavelength spectrum of a sample obtained with an interferometer was also present in the interferogram.
[The application of Fourier transform infrared technology in biomedical sphere].
Zhang, Xiao-qing; Xu, Zhi; Ling, Xiao-feng; Xu, Yi-zhuang; Wu, Jin-guang
2010-01-01
The authors systemically reviewed the development of FTIR technology and its innovative advances during the past fifty years. FTIR technique was once abandoned after initial exploration in biomedical fields, which could not confirm its reliability and credibility. After technological innovation and refined numerical analysis methods, FTIR technique has been applied to a wide range of fields, from single cellular to the complex biomedical tissue components. Nowadays, mature and advanced FTIR technology, such as FTIR microspectrometer and FTIR imaging system, with the aid of pattern recognition and tissue microarray, greatly facilitated the large parallel scale investigation of molecular structure. The recent development of FTIR spectroscopic imaging has enhanced our capability to examine, on a microscopic scale, the spatial distribution of vibrational spectroscopic signatures of materials spanning the physical and biomedical disciplines. The integration of instrumentation development, theoretical analyses to provide guidelines for imaging practice, novel data processing algorithms, and the introduction of the technique to new fields. FTIR technique has helped analyze the complex components of bile stones, which persisted to be a vexing problem and causing high death rate in China. Besides, FTIR technology could provide reliable information in discriminating benign and malignancy. It has been used in detecting thyroid nodules, mammary gland, gastrointestinal tract, cardiovascular and prostate diseases, and parotid gland tissue in combination with ATR detecting device, and has broad clinical application prospects. Till now, FTIR technology has achieved the fast and accurate diagnosis for freshly dissected tissues such as discriminating thyroid carcinoma from nodular goiter intraoperatively. However, further investigations need to be done in this sphere to achieve greater accomplishments.
Fully phase-encrypted memory using cascaded extended fractional Fourier transform
Nishchal, Naveen Kumar; Joseph, Joby; Singh, Kehar
2004-08-01
In this paper, we implement a fully phase-encrypted memory system using cascaded extended fractional Fourier transform (FRT). We encrypt and decrypt a two-dimensional image obtained from an amplitude image. The full phase image to be encrypted is fractional Fourier transformed three times and random phase masks are placed in the two intermediate planes. Performing the FRT three times increases the key size, at an added complexity of one more lens. The encrypted image is holographically recorded in a photorefractive crystal and is then decrypted by generating through phase conjugation, the conjugate of the encrypted image. A lithium niobate crystal has been used as a phase contrast filter to reconstruct the decrypted phase image, alleviating the need of alignment in the Fourier plane making the system rugged.
Directory of Open Access Journals (Sweden)
Fedotov A.
2017-02-01
Full Text Available The article proposes a method of mathematical simulation of electrical machines with thyristor exciters on the basis of the local Fourier transform. The present research demonstrates that this method allows switching from a variable structure model to a constant structure model. Transition from the continuous variables to the discrete variables is used. The numerical example is given in the paper.
Fedotov, A.; Fedotov, E.; Bahteev, K.
2017-02-01
The article proposes a method of mathematical simulation of electrical machines with thyristor exciters on the basis of the local Fourier transform. The present research demonstrates that this method allows switching from a variable structure model to a constant structure model. Transition from the continuous variables to the discrete variables is used. The numerical example is given in the paper.
Dool, T.C. van den; Hamelinck, R.F.M.M.; Kruizinga, B.; Gielesen, W.L.M.; Braam, B.C.; Nijenhuis, J.R.; Loix, N.; Luyckx, S.; Loon, D. van; Kooijman, P.P.; Swinyard, B.M.
2010-01-01
TNO, together with its partners Micromega and SRON, have designed a cryogenic scanning mechanism for use in the SAFARI Fourier Transform Spectrometer (FTS) on board of the SPICA mission. The optics of the FTS scanning mechanism (FTSM) consists of two back-to-back cat's-eyes. The optics are mounted
Subpixel translation of MEMS measured by discrete fourier transform analysis of CCD images
Yamahata, C.; Sarajlic, Edin; Stranczl, M.; Krijnen, Gijsbertus J.M.; Gijs, M.A.M.
2011-01-01
We present a straightforward method for measuring in-plane linear displacements of microelectromechanical systems (MEMS) with subnanometer resolution. The technique is based on Fourier transform analysis of a video recorded with a Charge-Coupled Device (CCD) camera attached to an optical microscope
Shifting and Variational Properties for Fourier-Feynman Transform and Convolution
Directory of Open Access Journals (Sweden)
Byoung Soo Kim
2015-01-01
Full Text Available Shifting, scaling, modulation, and variational properties for Fourier-Feynman transform of functionals in a Banach algebra S are given. Cameron and Storvick's translation theorem can be obtained as a corollary of our result. We also study shifting, scaling, and modulation properties for the convolution product of functionals in S.
Subpixel translation of MEMS measured by discrete fourier transform analysis of CCD images
Yamahata, C.; Sarajlic, E.; Stranczl, M.; Krijnen, G.J.M.; Gijs, M.A.M.
2011-01-01
We present a straightforward method for measuring in-plane linear displacements of microelectromechanical systems (MEMS) with subnanometer resolution. The technique is based on Fourier transform analysis of a video recorded with a Charge-Coupled Device (CCD) camera attached to an optical microscope
Wiedermann, Guenter; Jennings, D. E.; Hanel, R. H.; Kunde, V. G.; Moseley, S. H.
1989-01-01
A postdispersion system for astronomical observations with Fourier transform spectrometers in the thermal infrared has been developed which improves the sensitivity of radiation noise limited observations by reducing the spectral range incident on the detector. Special attention is given to the first-generation blocked impurity band detector. Planetary, solar, and stellar observations are reported.
Barbu, I.M.
2008-01-01
This thesis describes, the use of a Fourier Transform Ion Cyclotron (FTICR) mass spectrometer in the study of biological samples with, imaging mass spectrometry (MS). To achieve this goal experiments were performed on an in-house modified FTICR-MS instrument (for which special acquisition software w
VUV Fourier-transform absorption study of the Lyman and Werner bands in D-2
Lange, de A.; Dickenson, G.D.; Salumbides, E.J.; Ubachs, W.M.G.; Oliveira, de N.; Joyeux, D.; Nahon, L.
2012-01-01
An extensive survey of the D-2 absorption spectrum has been performed with the high-resolution VUV Fourier-transform spectrometer employing synchrotron radiation. The frequency range of 90 000-119 000 cm (1) covers the full depth of the potential wells of the B (1)Sigma(+)(u), B' 1 Sigma(+)(u), and
Dool, T.C. van den; Hamelinck, R.F.M.M.; Kruizinga, B.; Gielesen, W.L.M.; Braam, B.C.; Nijenhuis, J.R.; Loix, N.; Luyckx, S.; Loon, D. van; Kooijman, P.P.; Swinyard, B.M.
2010-01-01
TNO, together with its partners Micromega and SRON, have designed a cryogenic scanning mechanism for use in the SAFARI Fourier Transform Spectrometer (FTS) on board of the SPICA mission. The optics of the FTS scanning mechanism (FTSM) consists of two back-to-back cat's-eyes. The optics are mounted o
Fourier Transform Moire Deflectometry for Measuring the 3-D Temperature Field
Institute of Scientific and Technical Information of China (English)
MA Li; WANG Ming; LIU Song; QI Xiaopin
2000-01-01
Fourier transform evaluation of fringe phase is applied to Moire deflectometry. 3-D gas temperature distribution for a given layer is reconstructed by optical tomography. The results show that the high-precise and automatic measurement for the 3-D gas temperature field can be realized by this technique.
Fourier transform spectroscopy around 3 microns with a broad difference frequency comb
Meek, Samuel A; Guelachvili, Guy; Hänsch, Theodor W; Picqué, Nathalie
2013-01-01
We characterize a new mid-infrared frequency comb generator based on difference frequency generation around 3.2 microns. High power per comb mode (>10-7 W/mode) is obtained over a broad spectral span (>700 nm). The source is used for direct absorption spectroscopy with a Michelson-based Fourier transform interferometer.
DEFF Research Database (Denmark)
Guan, Pengyu; Da Ros, Francesco; Lillieholm, Mads
2016-01-01
We demonstrate simultaneous phase regeneration of 16-WDM DPSK channels using optical Fourier transformation and a single phase-sensitive amplifier. The BERs of 16-WDM×10-Gbit/s phase noise degraded DPSK signals are improved by 0.4-1.3 orders of magnitude...
The Fourier transform solution for the Green's function of monoenergetic neutron transport theory
Ganapol, Barry D.
2014-01-01
Nearly 45 years ago, Ken Case published his seminal paper on the singular eigenfunction solution for the Green's function of the monoenergetic neutron transport equation with isotropic scattering. Previously, the solution had been obtained by Fourier transform. While it is apparent the two had to be equivalent, a convincing equivalence proof for general anisotropic scattering remained a challenge until now.
The Kinetics of Mo(Co)6 Substitution Monitored by Fourier Transform Infrared Spectrophotometry.
Suslick, Kenneth S.; And Others
1987-01-01
Describes a physical chemistry experiment that uses Fourier transform (FTIR) spectrometers and microcomputers as a way of introducing students to the spectral storage and manipulation techniques associated with digitized data. It can be used to illustrate FTIR spectroscopy, simple kinetics, inorganic mechanisms, and Beer's Law. (TW)
Directory of Open Access Journals (Sweden)
Percival Almoro
1998-12-01
Full Text Available Microscopic deformations on the surface of a circular diaphragm were measured using double exposure holographic interferometry and Fourier transform method (FTM. The three-dimensional surface deformations were successfully visualized by applying FTM to holographic interferogram analysis. The minimum surface displacement measured was 0.317 µm. This was calibrated via the Michelson interferometry technique.
Nonuniform fast Fourier transform method for numerical diffraction simulation on tilted planes.
Xiao, Yu; Tang, Xiahui; Qin, Yingxiong; Peng, Hao; Wang, Wei; Zhong, Lijing
2016-10-01
The method, based on the rotation of the angular spectrum in the frequency domain, is generally used for the diffraction simulation between the tilted planes. Due to the rotation of the angular spectrum, the interval between the sampling points in the Fourier domain is not even. For the conventional fast Fourier transform (FFT)-based methods, a spectrum interpolation is needed to get the approximate sampling value on the equidistant sampling points. However, due to the numerical error caused by the spectrum interpolation, the calculation accuracy degrades very quickly as the rotation angle increases. Here, the diffraction propagation between the tilted planes is transformed into a problem about the discrete Fourier transform on the uneven sampling points, which can be evaluated effectively and precisely through the nonuniform fast Fourier transform method (NUFFT). The most important advantage of this method is that the conventional spectrum interpolation is avoided and the high calculation accuracy can be guaranteed for different rotation angles, even when the rotation angle is close to π/2. Also, its calculation efficiency is comparable with that of the conventional FFT-based methods. Numerical examples as well as a discussion about the calculation accuracy and the sampling method are presented.
Our presentation will focus on continuing efforts to examine secondary cell wall development in cotton fibers using infrared Spectroscopy. Cotton fibers harvested at 18, 20, 24, 28, 32, 36 and 40 days after flowering were examined using attenuated total reflection Fourier transform-infrared (ATR FT-...
Soil science research is increasingly applying Fourier transform infrared (FTIR) spectroscopy for analysis of soil organic matter (SOM). However, the compositional complexity of soils and the dominance of the mineral component can limit spectroscopic resolution of SOM and other minor components. The...
Teaching Stable Two-Mirror Resonators through the Fractional Fourier Transform
Moreno, Ignacio; Garcia-Martinez, Pascuala; Ferreira, Carlos
2010-01-01
We analyse two-mirror resonators in terms of their fractional Fourier transform (FRFT) properties. We use the basic ABCD ray transfer matrix method to show how the resonator can be regarded as the cascade of two propagation-lens-propagation FRFT systems. Then, we present a connection between the geometric properties of the resonator (the g…
DEFF Research Database (Denmark)
Uceda Otero, E. P.; Eliel, G. S. N.; Fonseca, E. J. S.
2013-01-01
In this work we have used Fourier transform infrared (FTIR) / vibrational absorption (VA) spectroscopy to study two cancer cell lines: the Henrietta Lacks (HeLa) human cervix carcinoma and 5637 human bladder carcinoma cell lines. Our goal is to experimentally investigate biochemical changes and d...
The Relationship between Tsallis Statistics, the Fourier Transform, and Nonlinear Coupling
Nelson, Kenric P
2008-01-01
Tsallis statistics (or q-statistics) in nonextensive statistical mechanics is a one-parameter description of correlated states. In this paper we use a translated entropic index: $1 - q \\to q$ . The essence of this translation is to improve the mathematical symmetry of the q-algebra and make q directly proportional to the nonlinear coupling. A conjugate transformation is defined $\\hat q \\equiv \\frac{{- 2q}}{{2 + q}}$ which provides a dual mapping between the heavy-tail q-Gaussian distributions, whose translated q parameter is between $ - 2 < q < 0$, and the compact-support q-Gaussians, between $0 < q < \\infty $ . This conjugate transformation is used to extend the definition of the q-Fourier transform to the domain of compact support. A conjugate q-Fourier transform is proposed which transforms a q-Gaussian into a conjugate $\\hat q$ -Gaussian, which has the same exponential decay as the Fourier transform of a power-law function. The nonlinear statistical coupling is defined such that the conjugate ...
A simple denoising algorithm using wavelet transform
Roy, M F; Kulkarni, B D; Sanderson, J; Rhodes, M; Stappen, M; Roy, Manojit; Sanderson, John; Rhodes, Martin; Stappen, Michel vander
1999-01-01
We have presented a new and alternative algorithm for noise reduction using the methods of discrete wavelet transform and numerical differentiation of the data. In our method the threshold for reducing noise comes out automatically. The algorithm has been applied to three model flow systems - Lorenz, Autocatalator, and Rossler systems - all evolving chaotically. The method is seen to work quite well for a wide range of noise strengths, even as large as 10% of the signal level. We have also applied the method successfully to noisy time series data obtained from the measurement of pressure fluctuations in a fluidized bed, and also to that obtained by conductivity measurement in a liquid surfactant experiment. In all the illustrations we have been able to observe that there is a clean separation in the frequencies covered by the differentiated signal and white noise.
An intersection algorithm based on transformation
Institute of Scientific and Technical Information of China (English)
CHEN Xiao-xia; YONG Jun-hai; CHEN Yu-jian
2006-01-01
How to obtain intersection of curves and surfaces is a fundamental problem in many areas such as computer graphics,CAD/CAM,computer animation,and robotics.Especially,how to deal with singular cases,such as tangency or superposition,is a key problem in obtaining intersection results.A method for solving the intersection problem based on the coordinate transformation is presented.With the Lagrange multiplier method,the minimum distance between the center of a circle and a quadric surface is given as well.Experience shows that the coordinate transformation could significantly simplify the method for calculating intersection to the tangency condition.It can improve the stability of the intersection of given curves and surfaces in singularity cases.The new algorithm is applied in a three dimensional CAD software (GEMS),produced by Tsinghua University.
Image fusion algorithm using nonsubsampled contourlet transform
Xiao, Yang; Cao, Zhiguo; Wang, Kai; Xu, Zhengxiang
2007-11-01
In this paper, a pixel-level image fusion algorithm based on Nonsubsampled Contourlet Transform (NSCT) has been proposed. Compared with Contourlet Transform, NSCT is redundant, shift-invariant and more suitable for image fusion. Each image from different sensors could be decomposed into a low frequency image and a series of high frequency images of different directions by multi-scale NSCT. For low and high frequency images, they are fused based on local-contrast enhancement and definition respectively. Finally, fused image is reconstructed from low and high frequency fused images. Experiment demonstrates that NSCT could preserve edge significantly and the fusion rule based on region segmentation performances well in local-contrast enhancement.
Li, Su
2016-01-01
The multiple fundamental frequency detection problem and the source separation problem from a single-channel signal containing multiple oscillatory components and a nonstationary noise are both challenging tasks. To extract the fetal electrocardiogram (ECG) from a single-lead maternal abdominal ECG, we face both challenges. In this paper, we propose a novel method to extract the fetal ECG signal from the single channel maternal abdominal ECG signal, without any additional measurement. The algorithm is composed of three main ingredients. First, the maternal and fetal heart rates are estimated by the de-shape short time Fourier transform, which is a recently proposed nonlinear time-frequency analysis technique; second, the beat tracking technique is applied to accurately obtain the maternal and fetal R peaks; third, the maternal and fetal ECG waveforms are established by the nonlocal median. The algorithm is evaluated on a simulated fetal ECG signal database ({\\em fecgsyn} database), and tested on two real data...
A New LFM-Signal Detector Based on Fractional Fourier Transform
Directory of Open Access Journals (Sweden)
Yin Zhiping
2010-01-01
Full Text Available A new LFM-signal detector formulated by the integration of the 4th-power modulus of the fractional Fourier transform is proposed. It has similar performance to the modulus square detector of Radon-ambiguity transform because of the equivalence relationship between them. But the new detector has much lower computational complexity in the case that the number of the searching angles is far less than the length of the signal. Moreover, it is proved that the new detector can be generalized to the integration of the nth-power ( modulus of the fractional Fourier transform via mathematical derivation. Computer simulation results have confirmed the effectiveness of the proposed detector in LFM-signal detection.
A New LFM-Signal Detector Based on Fractional Fourier Transform
Directory of Open Access Journals (Sweden)
Zhiping Yin
2010-01-01
Full Text Available A new LFM-signal detector formulated by the integration of the 4th-power modulus of the fractional Fourier transform is proposed. It has similar performance to the modulus square detector of Radon-ambiguity transform because of the equivalence relationship between them. But the new detector has much lower computational complexity in the case that the number of the searching angles is far less than the length of the signal. Moreover, it is proved that the new detector can be generalized to the integration of the nth-power (2
The Fractional Fourier Transform and Its Application to Energy Localization Problems
Directory of Open Access Journals (Sweden)
ter Morsche Hennie G
2003-01-01
Full Text Available Applying the fractional Fourier transform (FRFT and the Wigner distribution on a signal in a cascade fashion is equivalent to a rotation of the time and frequency parameters of the Wigner distribution. We presented in ter Morsche and Oonincx, 2002, an integral representation formula that yields affine transformations on the spatial and frequency parameters of the -dimensional Wigner distribution if it is applied on a signal with the Wigner distribution as for the FRFT. In this paper, we show how this representation formula can be used to solve certain energy localization problems in phase space. Examples of such problems are given by means of some classical results. Although the results on localization problems are classical, the application of generalized Fourier transform enlarges the class of problems that can be solved with traditional techniques.
Perspective: The first ten years of broadband chirped pulse Fourier transform microwave spectroscopy
Park, G. Barratt; Field, Robert W.
2016-05-01
Since its invention in 2006, the broadband chirped pulse Fourier transform spectrometer has transformed the field of microwave spectroscopy. The technique enables the collection of a ≥10 GHz bandwidth spectrum in a single shot of the spectrometer, which allows broadband, high-resolution microwave spectra to be acquired several orders of magnitude faster than what was previously possible. We discuss the advantages and challenges associated with the technique and look back on the first ten years of chirped pulse Fourier transform spectroscopy. In addition to enabling faster-than-ever structure determination of increasingly complex species, the technique has given rise to an assortment of entirely new classes of experiments, ranging from chiral sensing by three-wave mixing to microwave detection of multichannel reaction kinetics. However, this is only the beginning. Future generations of microwave experiments will make increasingly creative use of frequency-agile pulse sequences for the coherent manipulation and interrogation of molecular dynamics.
Fractional Fourier transform for partially coherent beam in spatial-frequency domain
Institute of Scientific and Technical Information of China (English)
Cai Yang-Jian; Lin Qiang
2004-01-01
By using Fourier transform and the tensor analysis method, the fractional Fourier transform (FRT) in the spatialfrequency domain for partially coherent beams is derived. Based on the FRT in the spatial-frequency domain, an analytical transform formula is derived for a partially coherent twisted anisotropic Gaussian-Schell model (GSM) beam passing through the FRT system. The connections between the FRT formula and the generalized diffraction integral formulae for partially coherent beams through an aligned optical system and a misaligned optical system in the spatialfrequency domain are discussed, separately. By using the derived formula, the intensity distribution of partially coherent twisted anisotropic GSM beams in the FRT plane are studied in detail. The formula derived provide a convenient tool for analysing and calculating the FRTs of the partially coherent beams in spatial-frequency domain.