Joint MIMO Channel Tracking and Symbol Decoding
Bibliographic record
Abstract
Kalman Filter: Recent Advances and Applications 536 (Alamouti, 1998), and therefore its application is limited to the case of two transmit antennas.Second, the channel is assumed to be time-varying during the transmission of each block.The latter assumption implies that the linear ML receiver is optimal in a mean sense (Liu et al., 2002).Kalman filtering has been applied to the problem of MIMO channel tracking in several other research reports (Schafhuber et al., 2003).Also, in (Coon et al., 2005), a frequency domain equalization method has been proposed for single carrier MIMO systems.Particle filtering has also been used in other studies (Haykin et al., 2004) for MIMO channel tracking.In (AlNauffouri et al., 2004), a Kalman filtering approach has been used in the maximization step of an expectation-maximization (EM) method to track the frequency selective MIMO channel when the underlying code is an OSTBC and when an orthogonal frequency division multiplexing (OFDM) is used.This chapter also focuses on the MIMO channel tracking and data decoding algorithms (Balakumar et al., 2007) that are a) suitable for any M×N MIMO system and b) computationally efficient to be able to implement in practical systems.By considering a class of MIMO systems where OSTBCs are used as the underlying space-time coding schemes and assuming a fixed channel during the transmission of each block of data a two-step channel tracking algorithm is developed.In the first step, Kalman filtering is used at the beginning of each block to obtain an initial channel estimate for that block based on the channel estimate obtained for previous block.In the second step, to improve the quality of the channel estimate obtained by Kalman filtering, a simple iterative channel estimation technique is proposed.This iterative method is in fact a decision-directed algorithm and it consists of sequential use of a linear receiver and a linear channel estimator.In addition, it is shown that, due to specific properties of orthogonal space-time block codes, both the Kalman filter and the decision-directed algorithm can be significantly simplified. How to referenceIn order to correctly reference this scholarly work, feel free to
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.001 | 0.001 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.005 |
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".