A Hybrid LSTM-ResNet Deep Neural Network for Noise Reduction and Classification of V-Band Receiver Signals
Bibliographic record
Abstract
Noise reduction is one of the most important process used for signal processing in communication systems. The signal-to-noise ratio (SNR) is a key parameter to consider for minimizing the bit error rate (BER). The inherent noise found in millimeter-wave systems is mainly a combination of white noise and phase noise. Increasing the SNR in wireless data transfer systems can lead to reliability and performance improvements. To address this issue, we propose to use a recurrent neural network (RNN) with a long short-term memory (LSTM) autoencoder architecture to achieve signal noise reduction. This design is based on a composite LSTM autoencoder with a single encoder layer and two decoder layers. A V-band receiver test bench is designed and fabricated to provide a high-speed wireless communication system. Constellation diagrams display the output signals measured for various random sequences of PSK and QAM modulated signals. The LSTM autoencoder is trained in real time using various noisy signals. The trained system is then used to reduce noise levels in the tested signals. The SNR of the designed receiver is of the order of 11.8dB, and it increases to 13.66dB using the three-level LSTM autoencoder. Consequently, the proposed algorithm reduces the bit error rate from 10−8to 10−11. The performance of the proposed algorithm is comparable to other noise reduction strategies. Augmented denoised signals are fed into a ResNet-152 deep convolutional network to perform the final classification. The demodulation types are classified with an accuracy of 99.93%. This is confirmed by experimental measurements.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".