A Novel Deep Learning-Based Receiver for Non-Coherent Chaotic Communication Systems With Temporal Dependencies and Spectral Properties of Chaotic Signals
Bibliographic record
Abstract
Chaotic signals are spread-spectrum nonlinear signals with initial value sensitivity that can potentially provide safe and anti-jamming digital communication systems. However, to reduce receiver complexity and achieve smooth demodulation, traditional chaos-based wireless communication systems require the transmission of additional chaotic reference signals, which reduces the spectral efficiency and degrades the security characteristics of the chaotic signals. Recent work has explored deep learning (DL)-aided transceivers to address these issues. However, these techniques have not yet fully exploited the inherent characteristics of chaotic signals, e.g., spectral properties. To maximize the potential of chaotic signals in wireless communication, this paper proposes a power spectral density-based deep learning chaos shift keying (PSD-DLCSK) receiver. The proposed PSD-DLCSK scheme effectively utilizes the spectral properties of chaotic signals, where the PSD of received signals serves as input to a deep neural network (DNN) for symbol detection. The proposed DNN architecture combines long short-term memory networks with self-attention mechanisms to effectively capture the temporal dependencies and spectral properties of chaotic signals, enabling reliable intelligent demodulation without chaotic reference signals. Extensive simulations demonstrate that PSD-DLCSK achieves superior bit error rate (BER) performance compared to traditional receivers as well as other DL-aided schemes over additive white Gaussian noise and multipath Rayleigh fading channels.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".