Artificial Noise Assisted In-Band Full-Duplex Secure Channel Estimation
Bibliographic record
Abstract
This paper proposes a novel secure channel estimation technique to provide security against leakage of the channel estimates to any malicious user by utilizing artificial noise (AN) along with full-duplex (FD) transmissions. AN overcomes the drawback of FD transmission, where any strategically located eavesdropper can minimize the interference signal received from the FD receiver. The proposed secure channel estimation technique comprises three stages, where the first stage is responsible for the estimation of the residual self-interference (SI) channel. The second stage acquires rough channel estimates to design AN orthogonal to the channel between legitimate transmitter-receiver for the next training stage. In the third stage, both legitimate nodes transmit orthogonal AN signals along with the known training signals using FD transmissions. For power allocation, we have presented a novel local adaptive power allocation algorithm at each legitimate node to allocate the powers to the training signals, and AN signals while ensuring equivocation at the eavesdropper. We provide the mean square error (MSE) to indicate the performance achieved by the respective nodes. We have also provided the bit error rate (BER) simulation analysis to indicate the secure communication achieved by securing the channel estimation process. The presented simulation analysis indicates that the eavesdropper is unable to decode the transmitted information while the legitimate receiver has robustly decoded the transmitted information.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".