MétaCan
Menu
Back to cohort
Record W1550331781 · doi:10.1109/iccw.2015.7247224

Tomlinson-Harashima precoding design in MIMO wiretap channels based on the MMSE criterion

2015· article· en· W1550331781 on OpenAlexaff
Lei Zhang, Yunlong Cai, Benoı̂t Champagne, Minjian Zhao

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsPrecodingKarush–Kuhn–Tucker conditionsMIMOComputer scienceTransmitter power outputArtificial noiseTransceiverControl theory (sociology)Mean squared errorChannel (broadcasting)Minimum mean square errorMathematical optimizationMathematicsTelecommunicationsWirelessTransmitterArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

This paper investigates the Tomlinson-Harashima precoding (THP) design for secure communications in broadcast multiple-input multiple-output (MIMO) systems in the presence of a passive eavesdropper. We focus on optimizing the nonlinear transceiver to guarantee a certain Quality-of-Service (QoS) level for the intended receiver in terms of mean-squared-error (MSE). The scheme allocates the transmit power in order to achieve the target MSE for the intended receiver, and then uses the remaining available power to transmit artificial noise (AN) to degrade the eavesdropper's channel. With the geometric mean decomposition (GMD) based THP, the lower MSE bound can be achieved. We convert the nonlinear transmit power minimization problem to a standard convex optimization problem. The solution for the problem is obtained by the waterfilling method via the Karush-Kuhn-Tucker (KKT) conditions. Simulation results demonstrate that the proposed nonlinear scheme outperforms existing linear transceiver designs.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.090
GPT teacher head0.276
Teacher spread0.186 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Quick stats

Citations12
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207