Radar Doppler Data Access With Shuffle LUTs and Wraparound
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
Implementing a shuffle lookup table (LUT) to guide data retrieval from non-contiguous memory locations and a wraparound mechanism to handle addresses outside the valid memory range, allowing efficient data fetching and processing using multi-dimensional data access mechanisms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If Doppler spectrum data from different transmitters is stored in non-contiguous memory locations, then memory storage efficiency is improved, but data access time increases and processing speed decreases
Solution Approach 1:
The patent divides the Doppler spectrum data from multiple transmitters into separate non-contiguous memory regions, with each transmitter's data stored in its own designated location. This segmentation allows parallel access to different transmitter data without interference, improving overall processing throughput despite the non-contiguous layout.
Solution Approach 2:
The patent introduces a memory address calculation mechanism that acts as an intermediary between the processor and non-contiguous memory locations. This intermediary automatically computes the correct addresses for scattered data elements, transparently handling the complexity of non-contiguous access and eliminating manual data rearrangement overhead.
2Stability of the object's composition
If Doppler spectrum data is rearranged before FFT operations, then data continuity is improved, but processing time increases
Solution Approach 1:
The patent performs preliminary organization of Doppler spectrum data into structured non-contiguous memory regions during the data acquisition phase, before FFT processing begins. This preliminary structuring with clear address patterns eliminates the need for time-consuming rearrangement operations immediately before FFT, as the data is already in an access-optimized layout.
Solution Approach 2:
Instead of rearranging scattered data into contiguous blocks before processing, the patent inverts the conventional approach by maintaining non-contiguous storage but implementing intelligent address calculation that directly accesses scattered elements in the correct sequence for FFT operations, eliminating the rearrangement step entirely.
3Productivity
If multiple transmitters use simultaneous transmission, then system productivity is improved, but signal processing complexity increases
Solution Approach 1:
The patent segments the signal processing pipeline into separate handling paths for each transmitter's data, with dedicated memory regions and address calculation routines for each transmitter. This segmentation allows simultaneous processing of multiple transmitter signals without cross-interference, managing complexity through modular organization.
Solution Approach 2:
The patent implements a universal memory address calculation mechanism that handles data from any number of transmitters through the same underlying logic and data structures. This multi-functional approach allows the system to scale from 2 to 8 or more transmitters without increasing fundamental processing complexity, as the same framework handles all transmitters uniformly.
Data Source
AI summary
Systems and instruction carrying non-transitory processor-readable mediums are provided to facilitate access of radar data that may be scattered or non-uniformly located within a region of memory for further processing of such radar data. An example system includes counters that increment on different dimensions of the memory region, a lookup table, multipliers, an adder, and a wraparound mechanism to access different sets of non-contiguously stored radar data from a region of memory. The wraparound mechanism performs a wraparound operation when a combined address, generated by the adder based on addresses obtained by the multipliers, is greater than a last valid address in the region. The wraparound operation generates a new combined address that is used to fetch data from the memory. A transform operation is then performed on the fetched data.