Blind channel estimation and discrete speed tracking in wireless systems using independent component analysis with particle filtering
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
For high data rate multiple-input multiple-output (MIMO) systems, a joint blind channel estimation and data recovery algorithm is presented for where the relative speed of the transmit/receive terminals may change. This changing speed is called manoeuvering. The blind technique is based on non-stationary independent component analysis with a generalised exponential density function to separate each source signal, and it uses particle filtering to track the time-varying channel. The presented technique also uses a hard decision switching block which adaptively selects between discrete speeds of a manoeuvering terminal. The speed can be therefore tracked within a mobile data communication link, that is, by using only the received data information signal. The performance is evaluated by simulation and is compared with optimal coherent detection as benchmark. A large degradation in system error performance is observed if the switching block is disabled within the algorithm, confirming its advantage. Moreover, to assess the impact of the presented blind channel estimation on system error performance more directly, a fair comparison with a known blind technique based on Kalman filtering and two known pilot-aided systems is presented with the assumption of non-manoeuvering terminals. Improved performance is observed using the presented technique.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it