Compressed sensing-based channel estimation for ACO-OFDM visible light communications in 5G systems
Bibliographic record
Abstract
In this paper, we propose a compressive sensing (CS)-based channel estimation technique for asymmetrically clipped optical-orthogonal frequency division multiplexing (ACO-OFDM) visible light communications (VLC) in 5G systems. We proposed a modified version of sparsity adaptive matching pursuit (SAMP) algorithm which is named as self-aware step size sparsity adaptive matching pursuit (SS-SAMP) algorithm. It utilizes the built-in features of SAMP and with additional ability to select step size according to the present situation, hence term self-aware, can provide better accuracy and low computational cost. It also does not require any prior knowledge of the sparsity of the signal which makes it self-sufficient. CS-based algorithms such as orthogonal matching pursuit (OMP), SAMP, and our proposed SS-SAMP were implemented on ACO-OFDM VLC. The paper is supported by simulation results which demonstrate performance of proposed scheme in terms of bit error rate (BER), mean square error (MSE), computational complexity, and key VLC parameter (LED nonlinearity, shot noise, thermal noise, channel response, and peak-to-average power ratio (PAPR). It is shown that the SS-SAMP is a good candidate for ACO-OFDM-based VLC that are mobile and have limited processing power, based on its performance and computational complexity.
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.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.001 |
| Research integrity | 0.000 | 0.001 |
| 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".