Low complexity time-frequency synchronization for transform domain communications systems

Author(s):  
Gang Wu ◽  
Su Hu ◽  
Shaoqian Li
2021 ◽  
Author(s):  
Vincent Savaux ◽  
Christophe Delacourt ◽  
Patrick Savelli

This paper deals with time and frequency synchronization in LoRa system based on the preamble symbols. A thorough analysis of the maximum likelihood (ML) estimator of the delay (time offset) and the frequency offset shows that the resulting cost function is not concave. As a consequence the a priori solution to the maximization problem consists in exhaustively searching over all the possible values of both the delay and the frequency offset. Furthermore, it is shown that these parameters are intertwined and therefore they must be jointly estimated, leading to an extremely complex solution. Alternatively, we show that it is possible to recover the concavity of the cost function, from which we suggest a low-complexity synchronization algorithm, whose steps are described in detail. Simulations results show that the suggested method reaches the same performance as the ML exhaustive search, while the complexity is drastically reduced, allowing for a real-time implementation of a LoRa receiver. <br>


2021 ◽  
Author(s):  
Vincent Savaux ◽  
Christophe Delacourt ◽  
Patrick Savelli

This paper deals with time and frequency synchronization in LoRa system based on the preamble symbols. A thorough analysis of the maximum likelihood (ML) estimator of the delay (time offset) and the frequency offset shows that the resulting cost function is not concave. As a consequence the a priori solution to the maximization problem consists in exhaustively searching over all the possible values of both the delay and the frequency offset. Furthermore, it is shown that these parameters are intertwined and therefore they must be jointly estimated, leading to an extremely complex solution. Alternatively, we show that it is possible to recover the concavity of the cost function, from which we suggest a low-complexity synchronization algorithm, whose steps are described in detail. Simulations results show that the suggested method reaches the same performance as the ML exhaustive search, while the complexity is drastically reduced, allowing for a real-time implementation of a LoRa receiver. <br>


2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Irena Orović ◽  
Vladan Papić ◽  
Cornel Ioana ◽  
Xiumei Li ◽  
Srdjan Stanković

Compressive sensing has emerged as an area that opens new perspectives in signal acquisition and processing. It appears as an alternative to the traditional sampling theory, endeavoring to reduce the required number of samples for successful signal reconstruction. In practice, compressive sensing aims to provide saving in sensing resources, transmission, and storage capacities and to facilitate signal processing in the circumstances when certain data are unavailable. To that end, compressive sensing relies on the mathematical algorithms solving the problem of data reconstruction from a greatly reduced number of measurements by exploring the properties of sparsity and incoherence. Therefore, this concept includes the optimization procedures aiming to provide the sparsest solution in a suitable representation domain. This work, therefore, offers a survey of the compressive sensing idea and prerequisites, together with the commonly used reconstruction methods. Moreover, the compressive sensing problem formulation is considered in signal processing applications assuming some of the commonly used transformation domains, namely, the Fourier transform domain, the polynomial Fourier transform domain, Hermite transform domain, and combined time-frequency domain.


2014 ◽  
Vol 1 (9(67)) ◽  
pp. 24
Author(s):  
Александр Алексеевич Костыря ◽  
Сергей Александрович Плехно ◽  
Виталий Николаевич Науменко ◽  
Сергей Иванович Ушаков

2021 ◽  
Author(s):  
Tharaj Thaj ◽  
Emanuele Viterbo

This paper proposes <i>orthogonal time sequency multiplexing</i> (OTSM), a novel single carrier modulation scheme based on the well known Walsh-Hadamard transform (WHT) combined with row-column interleaving, and zero padding (ZP) between blocks in the time-domain. The information symbols in OTSM are multiplexed in the delay and sequency domain using a cascade of time-division and Walsh-Hadamard (sequency) multiplexing. By using the WHT for transmission and reception, the modulation and demodulation steps do not require any complex multiplications. We then propose two low-complexity detectors: (i) a simpler non-iterative detector based on a single tap minimum mean square time-frequency domain equalizer and (ii) an iterative time-domain detector. We demonstrate, via numerical simulations, that the proposed modulation scheme offers high performance gains over orthogonal frequency division multiplexing (OFDM) and exhibits the same performance of orthogonal time frequency space (OTFS) modulation, but with lower complexity. In proposing OTSM, along with simple detection schemes, we offer the lowest complexity solution to achieving reliable communication in high mobility wireless channels, as compared to the available schemes published so far in the literature.


Author(s):  
O. V. Saltykov ◽  
A. N. Kalinin

The article proposes a method of time-frequency synchronization of an OFDM mo-dem, the input of which receives signals from the elements of the antenna array. The method is based on the combined action of correlation procedures for entering into communication and spatial selection, which clears the signal from interference based on the criterion of the minimum difference between the received signal and the test combination.


Sign in / Sign up

Export Citation Format

Share Document