44 research outputs found
Generalized discrete Fourier transform with non-linear phase : theory and design
Constant modulus transforms like discrete Fourier transform (DFT), Walsh transform, and Gold codes have been successfully used over several decades in various engineering applications, including discrete multi-tone (DMT), orthogonal frequency division multiplexing (OFDM) and code division multiple access (CDMA) communications systems. Among these popular transforms, DFT is a linear phase transform and widely used in multicarrier communications due to its performance and fast algorithms. In this thesis, a theoretical framework for Generalized DFT (GDFT) with nonlinear phase exploiting the phase space is developed. It is shown that GDFT offers sizable correlation improvements over DFT, Walsh, and Gold codes. Brute force search algorithm is employed to obtain orthogonal GDFT code sets with improved correlations. Design examples and simulation results on several channel types presented in the thesis show that the proposed GDFT codes, with better auto and cross-correlation properties than DFT, lead to better bit-error-rate performance in all multi-carrier and multi-user communications scenarios investigated. It is also highlighted how known constant modulus code families such as Walsh, Walsh-like and other codes are special solutions of the GDFT framework. In addition to theoretical framework, practical design methods with computationally efficient implementations of GDFT as enhancements to DFT are presented in the thesis. The main advantage of the proposed method is its ability to design a wide selection of constant modulus orthogonal code sets based on the desired performance metrics mimicking the engineering .specs of interest.
Orthogonal Frequency Division Multiplexing (OFDM) is a leading candidate to be adopted for high speed 4G wireless communications standards due to its high spectral efficiency, strong resistance to multipath fading and ease of implementation with Fast Fourier Transform (FFT) algorithms. However, the main disadvantage of an OFDM based communications technique is of its high PAPR at the RF stage of a transmitter. PAPR dominates the power (battery) efficiency of the radio transceiver. Among the PAPR reduction methods proposed in the literature, Selected Mapping (SLM) method has been successfully used in OFDM communications. In this thesis, an SLM method employing GDFT with closed form phase functions rather than fixed DFT for PAPR reduction is introduced. The performance improvements of GDFT based SLM PAPR reduction for various OFDM communications scenarios including the WiMAX standard based system are evaluated by simulations. Moreover, an efficient implementation of GDFT based SLM method reducing computational cost of multiple transform operations is forwarded. Performance simulation results show that power efficiency of non-linear RF amplifier in an OFDM system employing proposed method significantly improved
Golden Modulation: a New and Effective Waveform for Massive IoT
This paper considers massive Internet of Things systems, especially for LoW
Power Wide Area Networks, that aim at connecting billions of low-cost devices
with multi-year battery life requirements. Current systems for massive Internet
of Things exhibit severe problems when trying to pursue the target of serving a
very large number of users. In this paper, a novel asynchronous spread spectrum
modulation, called Golden Modulation, is introduced. This modulation provides a
vast family of equivalent waveforms with very low cross-interference even in
asynchronous conditions, hence enabling natural multiuser operation without the
need for inter-user synchronization or for interference cancellation receivers.
Thanks to minimal interference between waveforms, coupled with the absence of
coordination requirements, this modulation can accommodate very high system
capacity. The basic modulation principles, relying on spectrum spreading via
direct Zadoff-Chu sequences modulation, are presented and the corresponding
theoretical bit error rate performance in an additive white Gaussian noise
channel is derived and compared by simulation with realistic Golden Modulation
receiver performance. The demodulation of the Golden Modulation is also
described, and its performance in the presence of uncoordinated multiple users
is characterized.Comment: 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 accessibl
New Correlation Bound and Construction of Quasi-Complementary Code Sets
Quasi-complementary sequence sets (QCSSs) have attracted sustained research
interests for simultaneously supporting more active users in multi-carrier
code-division multiple-access (MC-CDMA) systems compared to complete
complementary codes (CCCs). In this paper, we investigate a novel class of
QCSSs composed of multiple CCCs. We derive a new aperiodic correlation lower
bound for this type of QCSSs, which is tighter than the existing bounds for
QCSSs. We then present a systematic construction of such QCSSs with a small
alphabet size and low maximum correlation magnitude, and also show that the
constructed aperiodic QCSSs can meet the newly derived bound asymptotically
Generalization and Improvement of the Levenshtein Lower Bound for Aperiodic Correlation
This paper deals with lower bounds on aperiodic correlation of sequences. It intends to solve two open questions. The first one is on the validity of the Levenshtein bound for a set of sequences other than binary sequences or those over the roots of unity. Although this result could be a priori extended to polyphase sequences, a formal demonstration is presented here, proving that it does actually hold for these sequences. The second open question is on the possibility to find a bound tighter than Welch’s, in the case of a set consisting of two sequences M = 2. By including the specific structure of correlation sequences, a tighter lower bound is introduced for this case. Besides, this method also provides in the cases M = 3 and M = 4 a tighter bound than the up-to-now tightest bound provided by Liu et al
Efficient complementary sequences-based architectures and their application to ranging measurements
Premio Extraordinario de Doctorado de la UAH en 2015En las últimas décadas, los sistemas de medición de distancias se han beneficiado de los avances en el área de las comunicaciones inalámbricas. En los sistemas basados en CDMA (Code-Division Multiple-Access), las propiedades de correlación de las secuencias empleadas juegan un papel fundamental en el desarrollo de dispositivos de medición de altas prestaciones. Debido a las sumas ideales de correlaciones aperiódicas, los conjuntos de secuencias complementarias, CSS (Complementary Sets of Sequences), son ampliamente utilizados en sistemas CDMA. En ellos, es deseable el uso de arquitecturas eficientes que permitan generar y correlar CSS del mayor número de secuencias y longitudes posibles. Por el término eficiente se hace referencia a aquellas arquitecturas que requieren menos operaciones por muestra de entrada que con una arquitectura directa. Esta tesis contribuye al desarrollo de arquitecturas eficientes de generación/correlación de CSS y derivadas, como son las secuencias LS (Loosely Synchronized) y GPC (Generalized Pairwise Complementary), que permitan aumentar el número de longitudes y/o de secuencias disponibles. Las contribuciones de la tesis pueden dividirse en dos bloques: En primer lugar, las arquitecturas eficientes de generación/correlación para CSS binarios, derivadas en trabajos previos, son generalizadas al alfabeto multinivel (secuencias con valores reales) mediante el uso de matrices de Hadamard multinivel. Este planteamiento tiene dos ventajas: por un lado el aumento del número de longitudes que pueden generarse/correlarse y la eliminación de las limitaciones de las arquitecturas previas en el número de secuencias en el conjunto. Por otro lado, bajo ciertas condiciones, los parámetros de las arquitecturas generalizadas pueden ajustarse para generar/correlar eficientemente CSS binarios de mayor número de longitudes que con las arquitecturas eficientes previas. En segundo lugar, las arquitecturas propuestas son usadas para el desarrollo de nuevos algoritmos de generación/correlación de secuencias derivadas de CSS que reducen el número de operaciones por muestra de entrada. Finalmente, se presenta la aplicación de las secuencias estudiadas en un nuevo sistema de posicionamiento local basado en Ultra-Wideband y en un sistema de posicionamiento local basado en ultrasonidos
Secuencias binarias y sus aplicaciones
ABSTRACT: The generation of families of sequences with a bounded correlation, among other properties, is of interest in several fields such as cryptography, wireless communications and digital watermarks. Commercial applications such as GPS or military uses such as Radar have been developed and improved thanks to the search of these sequences and the analysis of their autocorrelation function and the correlation between members of the same family.
In this project, we focus on a technique for the algebraic construction of sequences where a sequence of shifts and a sequence with good properties generate a new sequence. The aim is the exhaustive search of longer sequences then the ones already present in the literature. To do so, a software intended to provide support to a designer has been developed to assist in the search of said sequences and check their properties, which can be deployed in a supercomputer. The applications of these sequences are, among others, radars and location systems with higher spatial resolution.RESUMEN: Generar familias de secuencias con correlación acotada, entre otras propiedades, es de interés en diversas áreas como criptografÃa, comunicaciones inalámbricas y marcas de agua digitales. Aplicaciones comerciales como el GPS, o con usos militares como el Radar se han desarrollado y mejorado a partir de la búsqueda de estas secuencias mediante el estudio de su función tanto de autocorrelación como de la correlación entre los miembros de una misma familia.
En este proyecto, nos centramos en una técnica para la construcción algebraica de secuencias donde, a través de una secuencia de desplazamientos y una secuencia con buenas propiedades, se genera una nueva secuencia. El objetivo es la búsqueda exhaustiva de secuencias de mayor longitud que las ya existentes en la literatura. Para este fin, se ha desarrollado un software de apoyo al diseñador con capacidad de ser desplegado en un nodo de supercomputación para asistir a la búsqueda de dichas secuencias y la comprobación de sus propiedades. La finalidad de estas secuencias, entre otros posibles usos, son radares y sistemas de localización con mayor resolución espacial.Grado en IngenierÃa Informátic