Frame Synchronization for Coded Systems Over AWGN Channels

Cassaro, T.M.; Georghiades, C.N.

doi:10.1109/tcomm.2004.823636

Cited by 43 publications

(21 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In Fig. 4 we can see that applying the SS algorithm to synchronize the RS (7,5) 2 product code does not yield good results. For a synchronization window of size M = 1 block and at a FER equal to 10 −2 , a gap of around 1 dB is observed between the SS and the perfect synchronization case.…”

Section: Simulation Resultsmentioning

confidence: 98%

“…The major drawback of such techniques is in reducing the spectral efficiency of the transmission especially when codes of small sizes are used in the system. Other works propose to take advantage of the code structure and consider frame synchronization jointly with the decoding as in [6,7]. In [8], the authors propose to encode synchronization bits as part of the data sequence.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Blind frame synchronization of reed-solomon codes: Non-binary VS. binary approach

Imad

Poulliat

Houcke

et al. 2010

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

We consider in this paper the problem of blind frame synchronization of systems using Reed-Solomon (RS) codes and other related families. We present first of all three techniques of blind frame synchronization based on the non-binary parity check matrix of RS codes. While the first two techniques involve the calculation of hard and soft values of the syndrome elements respectively, the third one perform an adaptation step of the parity check matrix before applying the soft criterion. Although RS codes are constructed from non-binary symbols, we show in this paper that it is also possible to synchronize them using the binary image expansion of their parity check matrix. Simulation results show that the synchronization algorithm based on the adaptation of the binary parity check matrix of RS codes has the best synchronization performance among all other techniques. Furthermore, the Frame Error Rate (FER) curves obtained after synchronization and decoding are very close to the perfect synchronization curves.

show abstract

Section: Simulation Resultsmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

Blind frame synchronization of reed-solomon codes: Non-binary VS. binary approach

Imad

Poulliat

Houcke

et al. 2010

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

show abstract

“…In particular, considering methods applying to CMAP-based receivers (5), the ML-based approaches proposed in the literature, see e.g., [19], [21], exhibit a complexity equal to |B| times the complexity of one CMAP decoding operation. From our previous reasoning, we come therefore to the conclusion that the proposed method has a computational complexity equal or even lower (in the cycle-free case) than these methods.…”

Section: E Implementation and Complexitymentioning

confidence: 99%

“…Among CA ambiguity-resolution methods, one can distinguish between two main approaches: the authors either propose ad-hoc algorithms based on the fact that some decoder metrics vary as a function of the considered hypotheses [15]- [19], or place the CA ambiguity-resolution problem in the context of maximum a posteriori (MAP) or ML estimation, [20]- [22]. In the latter class of algorithms, [20] modifies the likelihood function by only keeping its largest term and decides whether the current estimate is true or not by a threshold decision on this modified likelihood function.…”

Section: Introductionmentioning

confidence: 99%

Code-Aided Maximum-Likelihood Ambiguity Resolution Through Free-Energy Minimization

Herzet

Woradit

Wymeersch

et al. 2010

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

In digital communication receivers, ambiguities in terms of timing and phase need to be resolved prior to data detection. In the presence of powerful error-correcting codes, which operate in low signal to noise ratios (SNR), long training sequences are needed to achieve good performance. In this contribution, we develop a new class of code-aided ambiguity resolution algorithms, which require no training sequence and achieve good performance with reasonable complexity. In particular, we focus on algorithms that compute the maximum-likelihood (ML) solution (exactly or in good approximation) with a tractable complexity, using a factor-graph representation. The complexity of the proposed algorithm is discussed, and reduced complexity variations, including stopping criteria and sequential implementation, are developed.

show abstract

“…이 방법에서 동기화 시퀀스는 수신기가 수신 신호를 감지하 고, 데이터 패킷의 위치를 결정하기 위해 데이터 시퀀스 에 더해진다 [5] . 프레임 동기화는 수신기에서 이루어지며, 송신기에서 사용된 동기화 시퀀스와 수신 신호의 상관 값을 계산하여 최대가 되는 지점을 찾는 과정을 수행한 다 [6] . 동기화 시퀀스에 사용되는 코드로는 PN 코드, Kasami 코드 [7] , Walsh 코드, orthogonal variable spreading factor(OVSF) [8] , 골드 코드 등이 있다.…”

unclassified

Efficient OFDM Frame Synchronization Scheme for LED-ID Systems

Park¹,

Hwang²,

Kim³

2014

The Journal of Korean Institute of Electromagnetic Engineering

View full text Add to dashboard Cite

In this paper, we propose an efficient OFDM(Orthogonal Frequency Division Multiplexing) frame synchronization scheme for LED-ID(Identification) systems. A frame synchronization is an essential procedure for normal operations of OFDM systems. Bernoulli-Gaussian noise is considered in LED-ID systems' environments. In order to enhance the OFDM frame synchronization performance, we add a ROGS(Repeated Orthogonal Gold Sequence) to OFDM signals in the time domain. The power level of a ROGS does not affect a normal operation of the LED-ID systems. Frame synchronization can be achieved successfully over LED-ID channels interfered by impulsive noise owing to good auto and cross-correlation properties of the ROGS.

show abstract

Frame Synchronization for Coded Systems Over AWGN Channels

Cited by 43 publications

References 10 publications

Blind frame synchronization of reed-solomon codes: Non-binary VS. binary approach

Blind frame synchronization of reed-solomon codes: Non-binary VS. binary approach

Code-Aided Maximum-Likelihood Ambiguity Resolution Through Free-Energy Minimization

Efficient OFDM Frame Synchronization Scheme for LED-ID Systems

Contact Info

Product

Resources

About