Radar Data Access Using Shuffle LUTs for Non-Contiguous FFT Input
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In MIMO radar systems, rearranging Doppler spectrum data before performing FFT operations is inefficient and slows down signal processing due to non-contiguous memory storage of Doppler spectrum data from different transmitters.
Innovation Solution
A shuffle lookup table (LUT) is used to guide data retrieval from non-contiguous memory locations based on Doppler offsets, combined with a wraparound mechanism to efficiently fetch data for FFT operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If Doppler spectrum data from different transmitters is stored in non-contiguous memory locations according to Doppler offsets, then data storage efficiency is improved, but data access time increases due to non-contiguous memory access
Solution Approach 1:
The patent pre-calculates and stores the non-contiguous memory addresses in a lookup table before data processing. This preliminary action allows the system to directly access pre-computed addresses during FFT operations, eliminating the need for real-time address calculation and reducing data access time despite non-contiguous memory storage
Solution Approach 2:
The patent introduces a lookup table as an intermediary between the non-contiguous memory storage and the FFT processing unit. This intermediary structure stores the mapping between logical data indices and physical memory addresses, enabling efficient data retrieval without direct complex address calculation during signal processing
2Reliability
If data is rearranged before FFT operations to handle non-contiguous memory storage, then data processing correctness is improved, but processing speed decreases
Solution Approach 1:
The patent pre-calculates the correct data arrangement pattern and stores it in a lookup table before FFT operations. This preliminary preparation ensures data processing correctness is maintained while avoiding time-consuming data rearrangement during actual FFT execution, thus preserving processing speed
3Productivity
If a lookup table is used to store indicators of locations in non-contiguous memory, then data access efficiency is improved, but memory usage increases
Solution Approach 1:
The patent optimizes the lookup table by storing only the necessary address offset parameters rather than complete addresses. This parameter optimization reduces the memory footprint of the lookup table while maintaining data access efficiency, as the offsets can be combined with base addresses to generate full memory addresses during runtime
Data Source
AI summary
Systems, mechanisms and methods are provided to facilitate access of data scattered or non-uniformly located within a region of memory for further processing. In an example, a lookup table (LUT) stores indicators of locations in a data structure, relative to a start index that is updated after each iteration, from which data elements are to be retrieved. Counter circuitry increments for a first iteration from the start index to a first value to provide count values to the LUT for the first iteration, increments after the first iteration to update the start index for a second iteration, and increments from the updated start index to the first value to provide count values to the LUT for the second iteration. Logic circuitry provides, for each count value provided to the LUT, an address from which the corresponding data element is to be retrieved.