MATLAB-Based GPU Acceleration for Multiple-Input and Multiple-Output Radar Beamforming Algorithm
Bibliographic record
Abstract
Multi-input and multi-output (MIMO) radar systems possess numerous advantages, such as scanning an entire region much faster than a phased array, enhancing the spatial resolution, mitigating interference and multipath fading, and improving the probability of detection of targets. MIMO radar systems use adaptive beamforming techniques such as the minimum variance distortionless response (MVDR) to obtain the best possible estimation of the direction of arrival (DOA) of the targets. The MVDR algorithm has been thoroughly investigated for traditional phased array radars. For MIMO radar systems, however, it requires significant signal processing, which can introduce substantial latency, especially in the case of large MIMO systems where few hundred antennas are used; this can be solved by using a Graphics Processor Unit (GPU), which contains thousands of cores and can execute many operations in parallel. This paper presents a MATLAB-based approach for GPU parallelization of the minimum variance distortionless (MVDR) beamforming algorithm in a MIMO radar system. Two MIMO radar systems are considered. The first one is a simulated MIMO radar which is used for automotive adaptive cruise control (ACC), and the second one is an experimental monostatic MIMO radar that is based on a vector network analyzer (VNA). It is shown that the GPU achieved a speedup of up to 7 times while successfully detecting all targets.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.015 | 0.004 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".