MétaCan
Menu
Back to cohort
Record W3028395677 · doi:10.1109/tii.2020.2995598

Low-Complexity MIMO-FBMC Sparse Channel Parameter Estimation for Industrial Big Data Communications

2020· article· en· W3028395677 on OpenAlexaff
Han Wang, Lingwei Xu, Zhengqiang Yan, T. Aaron Gulliver

Bibliographic record

VenueIEEE Transactions on Industrial Informatics · 2020
Typearticle
Languageen
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsUniversity of Victoria
FundersQingdao University of Science and TechnologyNational Natural Science Foundation of China
KeywordsMIMOPreambleComputer scienceElectronic engineeringFilter bankComputational complexity theoryQuadrature amplitude modulationInterference (communication)Spectral efficiencyChannel (broadcasting)AlgorithmBit error rateTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Industrial applications can produce significant amounts of data that require low delay and high data rate communications. Multiple-input-multiple-output filter bank multicarrier (MIMO-FBMC) communications employing offset quadrature amplitude modulation has been proposed for industrial big data due to its reliability and high spectrum efficiency. One of the difficulties in implementing a MIMO-FBMC system is accurate channel estimation (CE). The main factor affecting the CE performance is intrinsic imaginary interference, and the conventional preamble-based CE is not effective in this case. Thus, in this article, a low-complexity sparse adaptive CE scheme is proposed that is based on a dynamic threshold. This reduces the number of inner product calculations by considering only the columns of the measurement matrix greater than the threshold. Simulation results are presented that show that the proposed scheme is better than other well-known methods in terms of computational complexity and CE accuracy.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.428
GPT teacher head0.321
Teacher spread0.107 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations150
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Industrial InformaticsSame topicPAPR reduction in OFDMFrench-language works237,207