An algorithmic approach to preamble sequence optimization
Bibliographic record
Abstract
When using coherent demodulation techniques, it is often necessary to include sequences of known symbols within the transmission in order to facilitate synchronization and, when advanced equalization algorithms are employed, channel estimation. In many cases it is possible to employ well-known sequences with desirable properties for use in synchronization. In some cases, however, to remove the overt signature that the repeated use of these known sequences causes, pseudo-random sequences are required. The conventional method of choosing such pseudo-random sequences relies on an exhaustive search algorithm. However, the computational requirements for a search of moderate length sequences are immense. In practice, for sequences of moderate length, the usual procedure is to evaluate sequences generated at random against several well-defined criteria. We present a computationally efficient method for deriving PSK sequences with good properties for signal detection and channel estimation. From an initial random sequence, a gradient descent algorithm is used to iteratively improve the sequence, based on the evaluation criteria. This algorithmic approach is shown to reduce the time required to generate a set of sequences, meeting the specified performance criteria, by more than two orders of magnitude in some cases. The method is particularly applicable to the design of pseudorandom sequences for preamble and training segments in serial-tone HF waveforms. Although the technique is general in nature, examples provided focus on the design of 8PSK sequences for serial-tone HF waveforms.
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.000 | 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".