A method for accelerating fast Fourier transform (FFT) based on field programmable gate array is provided. A sequence requiring N-point FFT is decomposed equally into 4 subsequences. The 4 subsequences are processed through 4 parallel FFT intellectual property (IP) cores. Finally, an arithmetic operation is performed on the processed data and twiddle factor data pre-stored in a memory to obtain a result of the N-point FFT of an original sequence. An FFT decomposition module, a twiddle factor storage module, and an operation processing module are provided. Through the processing method, a time delay consumed by an N-point FFT operation can be reduced, and excellent application value can be achieved in a high-speed digital signal processing system.

It discloses a serial FFT-based low-power MFCC speech feature extraction circuit, and belongs to the technical field of calculation, reckoning or counting. The circuit is oriented toward the field of intelligence, and is adapted to a hardware circuit design by optimizing an MFCC algorithm, and a serial FFT algorithm and an approximation operation on a multiplication are fully used, thereby greatly reducing a circuit area and power. The entire circuit includes a preprocessing module, a framing and windowing module, an FFT module, a Mel filtration module, and a logarithm and DCT module. The improved FFT algorithm uses a serial pipeline manner to process data, and a time of an audio frame is effectively utilized, thereby reducing a storage area and operation frequency of the circuit under the condition of meeting an output requirement.

Apparatuses, systems, and techniques to perform a fast Fourier transform operation. In at least one embodiment, a fast Fourier transform operation is performed based on one or more parameters, wherein the one or more parameters indicate information about one or more operands of the fast Fourier transform.

Disclosed is a method of generating a functional singularity at a point or collection of points. The method may include determining a relationship between one or more parameters associated with a physical structure and a spatial gradient of field values of at least one of electromagnetic energy, sound energy, particle beam, or water waves manipulated by the physical structure, configuring, according to the relationship, the spatial gradient of field values to represent a functional singularity at a point, performing backpropagation using the spatial gradient of field values to obtain design parameters corresponding to values for the one or more parameters that achieve the functional singularity at the point, and producing a physical structure having the design parameters.

A modal superposition method using a response dependent non-linear mode concept for a vibration analysis of non-linear engineering structures is provided. The modal superposition method is provided to find steady state response of non-linear systems in frequency domain. The modal superposition method is used in many mechanical structures, especially in design of aerospace and automotive structures, defense industry platforms, steam and gas turbines and mechanical structures containing non-linear forces such as gas turbine engines and jet engines.

It is presented a method for enabling allocation of resources for a plurality of hosts. The method is performed by a server (1) and comprises identifying (S100) a service running on one or more of the plurality of hosts, determining (S140) a stretch factor for a recurring load pattern for the service running on the one or more of the plurality of hosts, and storing (S150) the identified service together with the determined stretch factor. It is also presented a server, a computer program and a computer program product.

There are provided methods and apparatus for performing modified cosine transformation (MDCT) with an analysis/synthesis windowing function, using an analysis windowing function having a meandering portion which passes a linear function in correspondence of at least four points.

There are provided methods and apparatus for performing modified cosine transformation (MDCT) with an analysis/synthesis windowing function, using an analysis windowing function having a meandering portion which passes a linear function in correspondence of at least four points.

The disclosure describes various aspects of techniques for using global interactions in efficient quantum circuit constructions. More specifically, this disclosure describes ways to use a global entangling operator to efficiently implement circuitry common to a selection of important quantum algorithms. The circuits may be constructed with global Ising entangling gates (e.g., global Mølmer-Sørenson gates or GMS gates) and arbitrary addressable single-qubit gates. Examples of the types of circuits that can be implemented include stabilizer circuits, Toffoli-4 gates, Toffoli-n gates, quantum Fourier transformation (QTF) circuits, and quantum Fourier adder (QFA) circuits. In certain instances, the use of global operations can substantially improve the entangling gate count.

The disclosure describes various aspects of techniques for using global interactions in efficient quantum circuit constructions. More specifically, this disclosure describes ways to use a global entangling operator to efficiently implement circuitry common to a selection of important quantum algorithms. The circuits may be constructed with global Ising entangling gates (e.g., global Mølmer-Sørenson gates or GMS gates) and arbitrary addressable single-qubit gates. Examples of the types of circuits that can be implemented include stabilizer circuits, Toffoli-4 gates, Toffoli-n gates, quantum Fourier transformation (QTF) circuits, and quantum Fourier adder (QFA) circuits. In certain instances, the use of global operations can substantially improve the entangling gate count.