On Efficient DCT Type-I Based Low Complexity Channel Estimation for Uplink NB-IoT Systems
Bibliographic record
Abstract
Channel estimation is a challenging and timely issue for the 3rd Generation Partnership Project (3GPP) standardized low power wide-area network technology named narrowband Internet of Things (NB-IoT).Channel estimation is crucial to achieve extended radio coverage, energy efficiency, coherent detection, and channel equalization for signal repetition dominated NB-IoT uplink transmission.The NB-IoT inherits simplified baseband radio frequency processing, physical channels, reference signal structure, and numerology from existing Long Term Evolution (LTE) systems to save power and costs.Thus, channel estimation methods extensively employed in LTE systems may not be applied to the NB-IoT uplink systems.In this paper, efficient discrete cosine transform type-I (DCT-I)-based transform-domain channel estimation approaches are proposed by modifying the original definition of DCT-I.The proposed methods can mitigate the problems experienced in the discrete Fourier transform (DFT)-based channel estimation, such as signal aliasing error, and border effect.The proposed approaches improve channel estimation precision by reducing signal distortion from the high-frequency region in the time-domain when non-sample-spaced path delays exist in multipath fading channels.Signal aliasing error experienced from the virtual subcarriers is also minimized with the anticipated schemes.The proposed methods are applied on simple least squares (LS) estimates in time-domain to eliminate estimation noise.The viability of the proposed estimators is verified as compared to the conventional LS, DFT-based de-noising LS, and standard DCT-I based methods through extensive numerical simulations.Based on the numerical simulations, the proposed estimators show better mean square error and bit error rate performances than their competitors in extremely low coverage conditions.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".