FFT Circuit Grouping Data for Accuracy

The patent segments the FFT computation process into multiple stages, with each stage performing partial FFT operations on subsets of data. This segmentation allows different data representations (including effective bit and group index) to be assigned to different groups, enabling accurate representation of both large and small values without uniform scaling, thus resolving the contradiction between reducing bitwidth and maintaining computation accuracy.

The patent applies local quality by assigning different data representations to different groups of data based on their local characteristics. Instead of uniformly scaling all data to cover the maximum value, each group can have its own effective bit width and exponent, allowing small values in certain groups to be preserved with adequate precision while still representing large values in other groups, thus preventing complete loss of smaller data.

The patent implements dynamic data representation where the effective bit width and group indices are determined based on the actual data distribution characteristics. The system dynamically adjusts the number of groups and their respective parameters rather than using a fixed complex structure, allowing accurate computation while adapting the circuit complexity to the actual needs of the data being processed.