Automatic Identification of Space-Frequency Block Coding for OFDM Systems
Bibliographic record
Abstract
Signal identification has emerged as an enabling technology for intelligent wireless communication systems with applications in military and commercial fields. One of recent trends in this research topic is to propose identification algorithms for multiple antenna (MA) systems with multi-carrier (MC) transmissions. The previously reported investigations are limited to space-time block code (STBC) systems with MC transmissions. However, practical systems include also space-frequency block code (SFBC) schemes with MC transmissions. In this paper, we develop and analyze an SFBC identification algorithm for MA orthogonal frequency-division multiplexing (OFDM) transmission for the first time in the literature. Analytical expressions for the time-domain properties of the Alamouti and spatial multiplexing SFBC-OFDM signals are derived as the basis of the identification process. The proposed algorithm is divided into two steps. The first step estimates the cross-correlation function of pairs of signals received from different antennas, while the second step employs a false-alarm based test for decision making. The proposed algorithm avoids the need for a priori knowledge of the modulation format, channel coefficients, signal-to-noise ratio (SNR) value, and the starting time of OFDM symbols. Simulation results show the ability of the proposed algorithm to provide an acceptable identification performance in the presence of transmission impairments, even at relatively low SNR values. These favorable results are achieved with acceptable computational cost.
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.005 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".