Constructions of resilient boolean functions with maximum nonlinearity

Şahin, M. Özgür
In this thesis, we work on the upper bound for nonlinearity of t-resilient Boolean functions given by Sarkar and Maitra, which is based on divisibility properties of spectral weights of resilient functions and study construction methods that achieve the upper bound. One of the construction methods, introduced by Maity and Johansson, starts with a bent function and complements some values of its truth table corresponding to a previously chosen set of inputs, S, which satisfies three criteria. In this thesis, we show that a fourth criterion is needed for t-resiliency of the resulting function, and prove that three criteria of Maity and Johansson do not guarantee resiliency. We also work on other constructions, one by Sarkar and Maitra, which uses a Maiorana-McFarland like technique to satisfy the upper bound and the other by Tarannikov, which satisfies the nonlinearity bound using a technique with low computational complexity. However, these methods have tendency to maximize the order of resiliency for a given number of variables, therefore one cannot construct functions for all possible resiliency values given the number of variables, using this method. We further go into details and compute the auto-correlation functions of the constructed Boolean functions to find the absolute indicator and sum-of-squared-errors for each of them. We also provide a comparison of Boolean functions constructed by other techniques given in the literature, together with the ones studied in this thesis.


Sub-graph approach in interative sum-product algorithm
Bayramoğlu, Muhammet Fatih; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2005)
Sum-product algorithm can be employed for obtaining the marginal probability density functions from a given joint probability density function (p.d.f.). The sum-product algorithm operates on a factor graph which represents the dependencies of the random variables whose joint p.d.f. is given. The sum-product algorithm can not be operated on factor-graphs that contain loops. For these factor graphs iterative sum-product algorithm is used. A factor graph which contains loops can be divided in to loop-free sub-...
Multi-tone representation of arbitrary waveforms and application to the analysis of nonlinear amplifiers and feedforward linearizers
Mutlu, Ahmet; Demir, Şimşek; Department of Electrical and Electronics Engineering (2005)
Characterization of nonlinear systems is a challenging task as the output can not be expressed simply in terms of input signal. Therefore, a universal analysis method is essential to simplify this procedure. Modeling of the input signal is a crucial part of such analysis. In this thesis, multi-tone representation is employed to model arbitrary, stochastically not well-defined input signals and thereafter characterize nonlinear systems. In order to verify the validity of multitone representation, multi-tone ...
Nonuform pulse repetition interval optimization for pulse doppler radars
Mercan, Hasan; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2004)
In this thesis, a method of optimization of nonuniform pulse repetition interval for pulse Doppler radars is investigated. PRI jittering technique is used for the selection of inter-pulse intervals. An environment with white Gaussian noise and clutter interference is defined and applying generalized likelihood ratio test, a sufficient statistic function for the detection of the target is derived. The effect of jitter set selection on range and Doppler ambiguity resolution and clutter rejection is investigat...
Ofdm papr reduction with linear coding and codeword modification
Susar, Aylin; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2005)
In this thesis, reduction of the Peak-to-Average Power Ratio (PAPR) of Orthogonal Frequency Division Multiplexing (OFDM) is studied. A new PAPR reduction method is proposed that is based on block coding the input data and modifying the codeword until the PAPR is reduced below a certain threshold. The method makes use of the error correction capability of the block code employed. The performance of the algorithm has been investigated through theoretical models and computer simulations. For performance evalua...
Noncoherent differential demodulation of CPM signals with joint frequency offset and symbol timing estimation
Çulha, Onur; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2011)
In this thesis, noncoherent differential demodulation of CPM signals with joint carrier frequency offset and symbol timing estimation is investigated. CPM is very attractive for wireless communications owing to major properties: good spectral efficiency and a constant envelope property. In order to demodulate the received CPM signal differentially, the symbol timing and the carrier frequency offset have to be estimated accurately. There are numerous methods developed for the purpose. However, we have not en...
Citation Formats
M. Ö. Şahin, “Constructions of resilient boolean functions with maximum nonlinearity,” M.S. - Master of Science, Middle East Technical University, 2005.