Data processing apparatus and method for saving memory space

Abstract

The invention discloses a data processing device used for saving storage space, which comprises a memory module, a bit-reverse module, a comparison module and a regulation module, wherein the memory module is used for saving each data required to be reordered and each reordered data; the bit-reverse module is used for obtaining an index value of each data required to be reordered, and can carrying out bit-reverse operation to each reordered data, so as to obtain a corresponding new index value; the comparison module is used for comparing the index value of each data with the corresponding new index value, so as to obtain a comparative result; and the regulation module is used for exchanging respective corresponding data of the index value and the corresponding new index value which are compared in the memory module only when the comparative result is determined to accord with a predetermined condition, and keeping the corresponding data of the index value in the memory module invariant when the comparative result is determined not to accord with the predetermined condition. By adopting the device, the storage space can be saved during the operation, and the processing efficiency of the operation is improved. Meanwhile, the invention discloses a data processing method for saving the storage space.

Description

technical field [0001] The invention relates to the field of computers, in particular to a data processing device and method for saving storage space. Background technique [0002] The Fast Fourier Transform Algorithm (FFT) operation is the core operation in the signal processing process, it provides spectrum analysis, convolution and correlation, digital filter design and implementation, power spectrum calculation, transfer function modeling and graph Provides fast computing methods for image processing and other tasks. Under the existing technology, FFT operations include two types: the first one performs butterfly operation on the input data, and then reorders the output results of the butterfly operation; and the second type first reorders the input data, and then reorders The result performs a butterfly operation. [0003] The following takes the first FFT operation as an example for description. [0004] refer to Figure 1A As shown, when the FFT operation is perfor...

AI Technical Summary

Problems solved by technology

[0010] To sum up, using the existing method to perform FFT operation will occupy a large amount of storage space. For example, in order to obtain the sequential output results of the input N numbers after FFT operation, it is necessary to open up 2×N storage units; at the same time, using the existing The FFT operation of the method will reduce the processing efficiency. For example, in the reordering process, some data storage units do not need to be adjusted, but they will also be read and written once, resulting in too frequent data read and write operations, increasing The time required for the FFT operation

Images