In many communication standards, several variable length frames generated by some source coder may be aggregated at a given layer of the protocol stack in the same burst to be transmitted. This decreases the signalization overhead and increases the throughput. However, after a transmission over a noisy channel, Frame Synchronization (FS), i.e., recovery of the aggregated frames, may become difficult due to errors affecting the bursts. This paper proposes several robust FS methods making use of the redundancy present in the protocol stack combined with channel soft information. A trellis-based FS algorithm is proposed first. Its efficiency is obtained at the cost of a large delay, since the whole burst must be available before beginning the processing, which might not be possible in some applications. Thus, a low-delay and reduced-complexity Sliding Window-based variant is introduced. Second, an improved version of an on-the-fly three-state automaton for FS is proposed. Bayesian hypothesis testing is performed to retrieve the correct FS. These methods are compared in the context of the WiMAX MAC layer when bursts are transmitted over Rayleigh fading channels.

Frame Synchronization (FS) is required in several communication standards in order to recover the individual frames that have been aggregated in a burst. This paper proposes a low-delay and reduced-complexity Sliding Trellis (ST)-based FS technique, compared to our previously proposed trellis-based FS method. Each burst is divided into overlapping windows in which FS is performed. Useful information is propagated from one window to the next. The proposed method makes use of soft information provided by the channel, but also of all sources of redundancy present in the protocol stack. An illustration of our ST-based approach for the WiMAX Media Access Control (MAC) layer is provided. When FS is performed on bursts transmitted over Rayleigh fading channel, the ST-based approach reduces the FS latency and complexity at the cost of a very small performance degradation compared to our full complexity trellis-based FS and outperforms state-of-the-art FS techniques.

Video transmission on wireless links usually requires some frame aggregation, so that the overhead due to the headers is not a too large percentage of the bit-stream. In such a situation, header error detection is essential, because any error in the header may cause a loss of several consecutive frames. The contributions of this paper are (i) an improved reception of the length field of the header and (ii) an improved Frame Synchronization (FS) algorithm for aggregated frames. The FS algorithm has the following characteristics: (i) it makes use of the implicit redundancies which are present in the headers, thus resulting in an efficient synchronization of the variable-length frames; (ii) Bayesian hypothesis testing is used to estimate the correct synchronization; (iii) the proposed algorithm performs estimation on-the-fly and does not require reading the whole bit-stream. A comparative performance evaluation with respect to previously proposed algorithms is provided in the context of WiMAX MAC.