Literature Database Entry


Bastian Bloessl and Falko Dressler, "mSync: Physical Layer Frame Synchronization Without Preamble Symbols," IEEE Transactions on Mobile Computing, 2018. (to appear)


We present a novel physical layer frame format and a corresponding decoding strategy for energy-constraint single-carrier transceivers, often used in sensor networks and cyber-physical systems. The main advantage of our approach is that decoding does not rely on dedicated preamble symbols, which usually introduce considerable overhead in terms of energy consumption and utilization of the wireless channel. We show that omitting the preamble can be achieved by buffering the signal in the receiver and processing the samples twice; first to synchronize and in a second iteration to decode the actual data. To introduce our approach, we provide a theoretical description, including a discussion of the implications of synchronizing on data symbols instead of optimized preamble sequences. The practical feasibility of the algorithm is shown by simulations and experiments using prototype implementations based on software defined radio. We implemented our algorithm for two technologies, a custom ultra low-power BPSK transceiver and the O-QPSK physical layer of the IEEE 802.15.4 standard. Finally, we present an extension of the algorithm that allows us to reduce the buffered data to a small constant number of samples, making our algorithm applicable to physical layers independent from their maximum frame size.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Bastian Bloessl
Falko Dressler

BibTeX reference

    author = {Bloessl, Bastian and Dressler, Falko},
    title = {{mSync: Physical Layer Frame Synchronization Without Preamble Symbols}},
    journal = {IEEE Transactions on Mobile Computing},
    year = {2018},
    publisher = {IEEE},
    doi = {10.1109/TMC.2018.2808968},
    note = {to appear},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.