11 research outputs found
Sequences design for OFDM and CDMA systems
With the emergence of multi-carrier (MC) orthogonal frequency division multiplexing (OFDM) scheme in the current WLAN standards and next generation wireless broadband standards, the necessitation to acquire a method for combating high peak to average power ratio (PMEPR) becomes imminent. In this thesis, we will explore various sequences to determine their PMEPR behaviours, in hopes to find some sequences which could potentially be suitable for PMEPR reduction control under MC system settings. These sequences include sequences, Sidelnikov sequences, new sequences, Golay sequences, FZC sequences and Legendre sequences. We will also examine the merit factor properties of these sequences, and then we will derive a bound between PMEPR and merit factor.
Moreover, in the design of code division multiple access (CDMA) spreading sequence sets, it is critical that each sequence in the set has low autocorrelations and low cross-correlation with other sequences in the same set. In the thesis, we will present a class of GDJ Golay sequences which contains a large zero autocorrelation zone (ZACZ), which could satisfy the low autocorrelation requirement. This class of Golay sequences could potentially be used to construct new CDMA spreading sequence sets
Construction of -ary Sequence Families of Period and Cross-Correlation of -ary m-Sequences and Their Decimated Sequences
학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 2. 노종선.This dissertation includes three main contributions: a construction of a new family of -ary sequences of period with low correlation, a derivation of the cross-correlation values of decimated -ary m-sequences and their decimations, and an upper bound on the cross-correlation values of ternary m-sequences and their decimations.
First, for an odd prime and an odd integer , a new family of -ary sequences of period with low correlation is proposed. The family is constructed by shifts and additions of two decimated m-sequences with the decimation factors 2 and . The upper bound on the maximum value of the magnitude of the correlation of the family is shown to be by using the generalized Kloosterman sums. The family size is four times the period of sequences, .
Second, based on the work by Helleseth \cite{Helleseth1}, the cross-correlation values between two decimated m-sequences by 2 and are derived, where is an odd prime and is an integer. The cross-correlation is at most 4-valued and their values are . As a result, for , a new sequence family with the maximum correlation value and the family size is obtained, where is the period of sequences in the family.
Lastly, the upper bound on the cross-correlation values of ternary m-sequences and their decimations by is investigated, where is an integer and the period of m-sequences is . The magnitude of the cross-correlation is upper bounded by . To show this, the quadratic form technique and Bluher's results \cite{Bluher} are employed. While many previous results using quadratic form technique consider two quadratic forms, four quadratic forms are involved in this case. It is proved that quadratic forms have only even ranks and at most one of four quadratic forms has the lowest rank .Abstract i
Contents iii
List of Tables vi
List of Figures vii
1. Introduction 1
1.1. Background 1
1.2. Overview of Dissertation 9
2. Sequences with Low Correlation 11
2.1. Trace Functions and Sequences 11
2.2. Sequences with Low Autocorrelation 13
2.3. Sequence Families with Low Correlation 17
3. A New Family of p-ary Sequences of Period (p^n−1)/2 with Low Correlation 21
3.1. Introduction 22
3.2. Characters 24
3.3. Gaussian Sums and Kloosterman Sums 26
3.4. Notations 28
3.5. Definition of Sequence Family 29
3.6. Correlation Bound 30
3.7. Size of Sequence Family 35
3.8. An Example 38
3.9. Related Work 40
3.10. Conclusion 41
4. On the Cross-Correlation between Two Decimated p-ary
m-Sequences by 2 and 4p^{n/2}−2 44
4.1. Introduction 44
4.2. Decimated Sequences of Period (p^n−1)/2 49
4.3. Correlation Bound 53
4.4. Examples 59
4.5. A New Sequence Family of Period (p^n−1)/2 60
4.6. Discussions 61
4.7. Conclusion 67
5. On the Cross-Correlation of Ternary m-Sequences of Period 3^{4k+2} − 1 with Decimation (3^{4k+2}−3^{2k+1}+2)/4 + 3^{2k+1} 69
5.1. Introduction 69
5.2. Quadratic Forms and Linearized Polynomials 71
5.3. Number of Solutions of x^{p^s+1} − cx + c 78
5.4. Notations 79
5.5. Quadratic Form Expression of the Cross-Correlation Function 80
5.6. Ranks of Quadratic Forms 83
5.7. Upper Bound on the Cross-Correlation Function 89
5.8. Examples 93
5.9. Related Works 94
5.10. Conclusion 94
6. Conclusions 96
Bibliography 98
초록 109Docto
Design of tch-type sequences for communications
This thesis deals with the design of a class of cyclic codes inspired by TCH codewords.
Since TCH codes are linked to finite fields the fundamental concepts and facts about abstract
algebra, namely group theory and number theory, constitute the first part of the thesis.
By exploring group geometric properties and identifying an equivalence between some operations
on codes and the symmetries of the dihedral group we were able to simplify the generation
of codewords thus saving on the necessary number of computations. Moreover, we
also presented an algebraic method to obtain binary generalized TCH codewords of length
N = 2k, k = 1,2, . . . , 16. By exploring Zech logarithm’s properties as well as a group theoretic
isomorphism we developed a method that is both faster and less complex than what was
proposed before. In addition, it is valid for all relevant cases relating the codeword length N
and not only those resulting from N = p
Complexity measures for classes of sequences and cryptographic apllications
Pseudo-random sequences are a crucial component of cryptography, particularly
in stream cipher design. In this thesis we will investigate several measures of
randomness for certain classes of finitely generated sequences.
We will present a heuristic algorithm for calculating the k-error linear complexity
of a general sequence, of either finite or infinite length, and results on the
closeness of the approximation generated.
We will present an linear time algorithm for determining the linear complexity
of a sequence whose characteristic polynomial is a power of an irreducible element,
again presenting variations for both finite and infinite sequences. This algorithm
allows the linear complexity of such sequences to be determined faster than was
previously possible.
Finally we investigate the stability of m-sequences, in terms of both k-error
linear complexity and k-error period. We show that such sequences are inherently
stable, but show that some are more stable than others
Machine Learning Techniques To Mitigate Nonlinear Impairments In Optical Fiber System
The upcoming deployment of 5/6G networks, online services like 4k/8k HDTV (streamers and online games), the development of the Internet of Things concept, connecting billions of active devices, as well as the high-speed optical access networks, impose progressively higher and higher requirements on the underlying optical networks infrastructure. With current network infrastructures approaching almost unsustainable levels of bandwidth utilization/ data traffic rates, and the electrical power consumption of communications systems becoming a serious concern in view of our achieving the global carbon footprint targets, network operators and system suppliers are now looking for ways to respond to these demands while also maximizing the returns of their investments. The search for a solution to this predicted ªcapacity crunchº led to a renewed interest in alternative approaches to system design, including the usage of high-order modulation formats and high symbol rates, enabled by coherent detection, development of wideband transmission tools, new fiber types (such as multi-mode and ±core), and finally, the implementation of advanced digital signal processing (DSP) elements to mitigate optical channel nonlinearities and improve the received SNR. All aforementioned options are intended to boost the available optical systems’ capacity to fulfill the new traffic demands. This thesis focuses on the last of these possible solutions to the ªcapacity crunch," answering the question: ªHow can machine learning improve existing optical communications by minimizing quality penalties introduced by transceiver components and fiber media nonlinearity?". Ultimately, by identifying a proper machine learning solution (or a bevy of solutions) to act as a nonlinear channel equalizer for optical transmissions, we can improve the system’s throughput and even reduce the signal processing complexity, which means we can transmit more using the already built optical infrastructure. This problem was broken into four parts in this thesis: i) the development of new machine learning architectures to achieve appealing levels of performance; ii) the correct assessment of computational complexity and hardware realization; iii) the application of AI techniques to achieve fast reconfigurable solutions; iv) the creation of a theoretical foundation with studies demonstrating the caveats and pitfalls of machine learning methods used for optical channel equalization. Common measures such as bit error rate, quality factor, and mutual information are considered in scrutinizing the systems studied in this thesis. Based on simulation and experimental results, we conclude that neural network-based equalization can, in fact, improve the channel quality of transmission and at the same time have computational complexity close to other classic DSP algorithms
Interaction of Ionizing Photons with Atomic and Molecular Ions
The interaction of ionising radiation with atomic and/or molecular ions is a fundamental process in nature, with implications for the understanding of many laboratory and astrophysical plasmas. At short wavelengths, the photon–ion interactions lead to inner-shell and multiple electron excitations, leading to demands on appropriate laboratory developments of sources and detectors and requiring advanced theoretical treatments which take into account many-body electron-correlation effects. This book includes a range of papers based on different short wavelength photon sources including recent facility and instrumental developments. Topics include experimental photoabsorption studies with laser-produced plasmas and photoionization of atomic and molecular ions with synchrotron and FEL sources, including modifications of a cylindrical mirror analyzer for high efficiency photoelectron spectroscopy on ion beams. Theoretical investigations include the effects of FEL fluctuations on autoionization line shapes, multiple sequential ionization by intense fs XUV pulses, photoelectron angular distributions for non-resonant two-photon ionization, inner-shell photodetachment of Na- and spin-polarized fluxes from fullerene anions