Reducing misframe frequency for HEC-based variable length frame suitable for IP services

Yamaguchi, Ukyo; Watanabe, Ryosuke

doi:10.1109/icc.2001.936871

Cited by 6 publications

(15 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, (16) and (18) are only employed in the SYNCH state in presence of errors and in the HUNT state. When the channel is relatively clear, (16) and (18) are then not too frequently evaluated, and the complexity remains of the same order of magnitude as that of the techniques presented in [5] or in [6], [13], [14]. This is no more true when the channel is very noisy.…”

Section: Complexitymentioning

confidence: 69%

“…Second, the proposed on-the-fly 3S FS method is compared with on-the-fly methods such as HD-based method and Ueda's method [5], serving as references. Since the MAC header uses an HEC of only 8 bits, a modified version of Ueda's method, denoted by MU 1 , is applied.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…With tight delay constraints, a classical method is the 3S automaton proposed in [10] for the synchronization of fixed-length ATM cells and adapted to variable-length frames by [5].…”

Section: Three-state Fs Automatonmentioning

confidence: 99%

“…Second, an improved version of an onthe-fly 3S FS automaton [5] is presented in Section III. It combines robust header recovery techniques from [22] with Bayesian hypothesis testing inspired from [6], [13], [14] to localize frame boundaries via a sample-by-sample search.…”

Section: Introductionmentioning

confidence: 99%

“…In absence of SW, assuming a length field is present in the header of the variable-length frame, the conventional Hard Decision (HD)-based FS can be performed when the noise is moderate. In [5], the HEC field has been employed to perform FS of variable-length IP frames using a 3S automaton adapted from [10]. In several situations, e.g., when the HEC field is erroneous itself or when its length is too short compared to the header size, false alarms can hamper the efficiency of the algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Joint Protocol-Channel Decoding for Robust Frame Synchronization

Ali

Kieffer²,

Duhamel³

2012

IEEE Trans. Commun.

View full text Add to dashboard Cite

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.

show abstract

Section: Complexitymentioning

confidence: 69%

Section: Simulation Resultsmentioning

confidence: 99%

“…With tight delay constraints, a classical method is the 3S automaton proposed in [10] for the synchronization of fixed-length ATM cells and adapted to variable-length frames by [5].…”

Section: Three-state Fs Automatonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Joint Protocol-Channel Decoding for Robust Frame Synchronization

Ali

Kieffer²,

Duhamel³

2012

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

Joint Source-Channel Coding and Decoding

Kieffer

Duhamel

2014

Academic Press Library in Mobile and Wireless Communications

View full text Add to dashboard Cite

Sliding-Trellis Based Frame Synchronization

Ali

Kieffer

Duhamel

2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

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 reducedcomplexity 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 STbased 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.

show abstract

Reducing misframe frequency for HEC-based variable length frame suitable for IP services

Cited by 6 publications

References 1 publication

Joint Protocol-Channel Decoding for Robust Frame Synchronization

Joint Protocol-Channel Decoding for Robust Frame Synchronization

Joint Source-Channel Coding and Decoding

Sliding-Trellis Based Frame Synchronization

Contact Info

Product

Resources

About