Signal detection of M-MIMO-orthogonal time frequency space modulation using hybrid algorithms: ZFE + MMSE and ZFE + MF
Bibliographic record
Abstract
• Combines OTFS modulation with massive MIMO (M-MIMO) systems. • Target: Signal detection for M-MIMO-OTFS systems of sizes 8x8, 16x16, 64x64, and 256x256. • Uses two hybrid algorithms: ZFE+MF and ZFE+MMSE. • Enhanced spectral efficiency. • Improved resistance to fading. Orthogonal Time Frequency Space (OTFS) modulation, coupled with Massive Multiple Input Multiple Output (Massive-MIMO) technology, presents a promising avenue for enhancing the efficiency and reliability of fifth-generation (5G) and beyond fifth-generation (B5G) systems. OTFS modulation offers robust communication in high-mobility environments by converting signals into the delay-Doppler domain, ensuring better performance over fading channels. MIMO enhances wireless networks by using large antenna arrays to boost capacity, spectral efficiency, and reliability, making both technologies vital for next-generation radio systems. In this study, we explore the detection of (8 × 8, 16 × 16, 64 × 64, and 256 × 256) Massive-MIMO-OTFS signals utilizing two prominent detection algorithms: zero forcing equalization (ZFE) with matched filter (MF) known as (ZFE+MF) and Zero Forcing with minimum mean square error (MMSE) known as (ZFE+MMSE). The combination of Massive MIMO and OTFS offers improved spectral efficiency, robustness against fading, and enhanced spatial multiplexing capabilities. The parameters such as bit error rate (BER) and power spectral density (PSD) are analyzed and estimated for the proposed hybrid and conventional algorithms. The proposed algorithms obtained the SNR and PSD gain of 3.2 dB, 3.2 dB, 4.8 dB, and 6.1dB gain, respectively, for 8 × 8, 16 × 16, 64 × 54, and 256 × 256 MIMO systems. Further, the PSD gain of -390 is obtained for the 256 × 256 system, resulting in high spectral efficiency.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".