MétaCan
Menu
Back to cohort

An End-to-End Auto-Encoder Algorithm for Hardware-Impaired Transceivers Based on Meta and Joint Learning

2023· article· en· W4388427917 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Signal Modulation Classification
Canadian institutionsLakehead University
Fundersnot available
KeywordsTransceiverEncoderComputer scienceChannel (broadcasting)Bit error rateWirelessFadingJoint (building)AlgorithmDecoding methodsSignal-to-noise ratio (imaging)Artificial intelligenceComputer hardwareSpeech recognitionTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

The application of Deep learning (DL) in wireless communications has achieved remarkable success. However, there are still marked challenges impeding its use in the physical layer, largely due to the random nature of the wireless channel. This work investigates an end-to-end transceiver based on an unsupervised auto-encoder. We aim to detect a wireless signal suffering from transceiver hardware impairments as it passes through the fading channel. Furthermore, we examine the ability of this receiver to detect signals corrupted with non-Gaussian noise. We use meta and joint learning techniques to train the auto-encoder transceiver with random unknown channels and HWIs to simulate real channel conditions. We compare the results with maximum likelihood detection (MLD) in terms of bit error rate (BER). Our results demonstrate that using meta-learning to train the auto-encoder enhances system performance by reducing the BER of the received signal.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: none
Teacher disagreement score0.842
Threshold uncertainty score0.620

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.069
GPT teacher head0.283
Teacher spread0.214 · 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