Efficient Residual Shrinkage CNN Denoiser Design for Intelligent Signal Processing: Modulation Recognition, Detection, and Decoding
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.
Bibliographic record
Abstract
The noises embedded in signals will degrade the signal processing quality. Traditional denoising algorithms might not work in practical systems since the statistical characteristics of noises might not be learned. To address this issue, we propose an efficient residual shrinkage convolutional neural network (RSCNN) aided denoiser based on the principle of the domain transformation, shrinking and inverse transforming operations conducted by the traditional denoiser. The proposed RSCNN is composed by the batch normalization layer, domain transformation layers, the shrinkage module and inverse transformation layers, wherein transformation layers consist of convolutional layers and the nonlinear activation function. Moreover, we propose a thresholds learning subnetwork to automatically determine the thresholds, so as to enhance noise suppressing performances. Furthermore, we compose the data set by preprocessing the received signals, and design the loss function according to different denoising requirements. To validate the efficiency and universality of the RSCNN aided denoiser, we apply the proposed RSCNN denoiser to three different application scenarios, including the modulation recognition, detection and decoding. After the offline training, at the online deployment stage, we utilize the RSCNN denoiser to reduce the noise power and improve the signal to noise ratios. Simulation results demonstrate that the proposed intelligent denoiser can efficiently improve the signal processing capabilities to achieve higher modulation recognition accuracy, better detection and decoding performances with lower complexity than benchmark schemes.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it