V-BLAST Without Optimal Ordering: Analytical Performance Evaluation for Rayleigh Fading Channels
Bibliographic record
Abstract
The Bell Labs layered space-time (BLAST) algorithm is simple, and hence, a popular choice for a multiple-input multiple-output (MIMO) receiver. Its bit-error rate (BER) performance has been studied mainly using numerical (Monte Carlo) techniques, since exact analytical evaluation presents serious difficulties. Close examination of the problem of BLAST BER performance analysis reveals that the major difficulty for analytical evaluation is due to the optimal ordering procedure. Hence, we analyze the algorithm performance without optimal ordering. While this is a disadvantage of the analysis, there are certain advantages as well. Exact closed-form analytical evaluation is possible for arbitrary number of transmit and receive antennas in an independent, identically distributed Rayleigh fading channel, which provides deep insight and understanding that cannot be gained using the Monte Carlo approach alone. A result on the maximum ratio combining weights, which is used at each detection step, is derived to obtain a number of results: independence of noise, distribution of signal-to-noise ratio (SNR), and block- or bit-error rates. We present a detailed analysis and expressions for uncoded error rates at each detection step, which hold true for any modulation format and take simple closed form in some cases. Asymptotic form of these expressions for large SNRs is particularly simple. Extensive Monte Carlo simulations validate the analytical results and conclusions
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.002 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".