Fast Burst Synchronization for Power Line Communication Systems
Bibliographic record
Abstract
Fast burst synchronization is an important requirement in asynchronous communication networks, where devices transmit short data packets in an unscheduled fashion. Such a synchronization is typically achieved by means of a preamble sent in front of the data packet. In this paper, we study fast burst synchronization for power line communication (PLC) systems operating below 500 kHz and transmitting data rates of up to about 500 kbps as it is typical in various PLC network applications. In particular, we are concerned with the receiver processing of the preamble signal and the actual design of preambles suitable for fast burst synchronization in such PLC systems. Our approach is comprehensive in that it takes into account the most distinctive characteristics of the power line channel, which are multipath propagation, highly varying path loss, and disturbance by impulse noise, as well as important practical constraints, especially the need for spectral shaping of the preamble signal and fast adjustment of the automatic gain control (AGC). In fact, we regard the explicit incorporation of these various requirements into the preamble design as the main contribution of this work. We devise an optimization criterion and a stochastic algorithm to search for suitable preamble sequences. A comprehensive performance comparison of a designed and two conventional preambles shows that the designed sequence is superior in terms of (a) fast burst synchronization in various transmission environments, (b) fast AGC adjustment, and (c) compliance of its spectrum with the spectral mask applied to the data transmit signal.
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.001 | 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.001 |
| 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".