Application of wavelets and artificial neural network for indoor optical wireless communication systems

Abstract This study investigates the use of error control code, discrete wavelet transform (DWT) and artificial neural network (ANN) to improve the link performance of an indoor optical wireless communication in a physical channel. The key constraints that barricade the realization of unlimited bandwidth in optical wavelengths are the eye-safety issue, the ambient light interference and the multipath induced intersymbol interference (ISI). Eye-safety limits the maximum average transmitted optical power. The rational solution is to use power efficient modulation techniques. Further reduction in transmitted power can be achieved using error control coding. A mathematical analysis of retransmission scheme is investigated for variable length modulation techniques and verified using computer simulations. Though the retransmission scheme is simple to implement, the shortfall in terms of reduced throughput will limit higher code gain. Due to practical limitation, the block code cannot be applied to the variable length modulation techniques and hence the convolutional code is the only possible option. The upper bound for slot error probability of the convolutional coded dual header pulse interval modulation (DH-PIM) and digital pulse interval modulation (DPIM) schemes are calculated and verified using simulations. The power penalty due to fluorescent light interference (FL I) is very high in indoor optical channel making the optical link practically infeasible. A denoising method based on a DWT to remove the FLI from the received signal is devised. The received signal is first decomposed into different DWT levels; the FLI is then removed from the signal before reconstructing the signal. A significant reduction in the power penalty is observed using DWT. Comparative study of DWT based denoising scheme with that of the high pass filter (HPF) show that DWT not only can match the best performance obtain using a HPF, but also offers a reduced complexity and design simplicity. The high power penalty due to multipath induced ISI makes a diffuse optical link practically infeasible at higher data rates. An ANN based linear and DF architectures are investigated to compensation the ISI. Unlike the unequalized cases, the equalized schemes don‘t show infinite power penalty and a significant performance improvement is observed for all modulation schemes. The comparative studies substantiate that ANN based equalizers match the performance of the traditional equalizers for all channel conditions with a reduced training data sequence. The study of the combined effect of the FLI and ISI shows that DWT-ANN based receiver perform equally well in the present of both interference. Adaptive decoding of error control code can offer flexibility of selecting the best possible encoder in a given environment. A suboptimal ?soft‘ sliding block convolutional decoder based on the ANN and a 1/2 rate convolutional code with a constraint length is investigated. Results show that the ANN decoder can match the performance of optimal Viterbi decoder for hard decision decoding but with slightly inferior performance compared to soft decision decoding. This provides a foundation for further investigation of the ANN decoder for convolutional code with higher constraint length values. Finally, the proposed DWT-ANN receiver is practically realized in digital signal processing (DSP) board. The output from the DSP board is compared with the computer simulations and found that the difference is marginal. However, the difference in results doesn‘t affect the overall error probability and identical error probability is obtained for DSP output and computer simulations

Error-Correction Coding and Decoding: Bounds, Codes, Decoders, Analysis and Applications

Coding; Communications; Engineering; Networks; Information Theory; Algorithm

Self-interference cancellation for full-duplex MIMO transceivers

PhD ThesisIn recent years, there has been enormous interest in utilizing the full-duplex (FD) technique with multiple-input multiple-output (MIMO) systems to complement the evolution of fifth generation technologies. Transmission and reception using FD-MIMO occur simultaneously over the same frequency band and multiple antennas are employed in both sides. The motivation for employing FD-MIMO is the rapidly increasing demand on frequency resources, and also FD has the ability to improve spectral efficiency and channel capacity by a factor of two compared to the conventional half-duplex technique. Additionally, MIMO can enhance the diversity gain and enable FD to acquire further degrees of freedom in mitigating the self-interference (SI). The latter is one of the key challenges degrading the performance of systems operating in FD mode due to local transmission which involves larger power level than the signals of interest coming from distance sources that are significantly more attenuated due to path loss propagation phenomena. Various approaches can be used for self-interference cancellation (SIC) to tackle SI by combining passive suppression with the analogue and digital cancellation techniques. Moreover, active SIC techniques using special domain suppression based on zero-forcing and null-space projection (NSP) can be exploited for this purpose too. The main contributions of this thesis can be summarized as follows. Maximum-ratio combining with NSP are jointly exploited in order to increase the signal-to-noise ratio (SNR) of the desired path and mitigate the undesired loop path, respectively, for an equalize-and-forward (EF) relay using FD-MIMO. Additionally, an end-to-end performance analysis of the proposed system is obtained in the presence of imperfect channel state information by formulating mathematically the exact closed-form solutions for the signal-to-interference-plus-noise ratio (SINR) distribution, outage probability, and average symbol-error rate for uncoded M-ary phase-shift keying over Rayleigh fading channels and in the presence of additive white Gaussian noise (AWGN). The coefficients of the EF-relay are designed to attain the minimum mean-square error (MMSE) between the transmission symbols. Comparison of the results obtained with relevant state-of-the-art techniques suggests significant improvements in the SINR figures and system capacity. Furthermore, iterative detection and decoding (IDD) are proposed to mitigate the residual self-interference (SI) remaining after applying passive suppression along with two stages of SI cancellation (SIC) filters in the analogue and digital domains for coded FD bi-directional transceiver based multiple antennas. IDD comprises an adaptive MMSE filter with log-likelihood ratio demapping, while the soft-in soft-out decoder utilizes the maximum a posteriori (MAP) algorithm. The proposed system’s performance is evaluated in the presence of AWGN over non-selective (flat) Rayleigh fading single-input multiple-output (SIMO) and MIMO channels. However, the results of the analyses can be applied to multi-path channels if orthogonal frequency division multiplexing is utilised with a proper length of cyclic prefix in order to tackle the channels’ frequency-selectivity and delay spread. Simulation results are presented to demonstrate the bit-error rate (BER) performance as a function of the SNR, revealing a close match to the SI-free case for the proposed system. Furthermore, the results are validated by deriving a tight upper bound on the performance of rate-1=2 convolutional codes for FD-SIMO and FD-MIMO systems for different modulation schemes under the same conditions, which asymptotically exhibits close agreement with the simulated BER performance.Ministry of Higher Education and Scientific Research (MoHESR), and the University of Mosul and to the Iraqi Cultural Attache in London for providing financial support for my PhD scholarship

Toward the implementation of analog LDPC decoders for long codewords

Error control codes are used in virtually every digital communication system. Traditionally, decoders have been implemented digitally. Analog decoders have been recently shown to have the potential to outperform digital decoders in terms of area and power/speed ratio. Analog designers have attempted to fully understand and exploit this potential for large decoders. However, large codes are generally still implemented with digital circuits. Nevertheless, in this thesis a number of aspects of analog decoder implementation are investigated with the hope of enabling the design of large analog decoders. In this thesis, we study and modify analog circuits used in a decoding algorithm known as the sum-product algorithm for implementation in a CMOS 90 nm technology. We apply a current-mode approach at the input nodes of these circuits and show through simulations that the power/speed ratio will be improved. Interested in studying the dynamics of decoders, we model an LDPC code in MATLAB's Simulink. We then apply the linearization technique on the modeled LDPC code in order to linearize the decoder about an initial state as its solution point. Challenges associated with decoder linearization are discussed. We also design and implement a chip comprised of the sum-product circuits with different configurations and sizes in order to study the effect of mismatch on the accuracy of the outputs. Unfortunately, testing of the chip fails as a result of errors in either the packaging process or fabrication

New cryptanalysis of LFSR-based stream ciphers and decoders for p-ary QC-MDPC codes

The security of modern cryptography is based on the hardness of solving certain problems. In this context, a problem is considered hard if there is no known polynomial time algorithm to solve it. Initially, the security assessment of cryptographic systems only considered adversaries with classical computational resources, i.e., digital computers. It is now known that there exist polynomial-time quantum algorithms that would render certain cryptosystems insecure if large-scale quantum computers were available. Thus, adversaries with access to such computers should also be considered. In particular, cryptosystems based on the hardness of integer factorisation or the discrete logarithm problem would be broken. For some others such as symmetric-key cryptosystems, the impact seems not to be as serious; it is recommended to at least double the key size of currently used systems to preserve their security level. The potential threat posed by sufficiently powerful quantum computers motivates the continued study and development of post-quantum cryptography, that is, cryptographic systems that are secure against adversaries with access to quantum computations. It is believed that symmetric-key cryptosystems should be secure from quantum attacks. In this manuscript, we study the security of one such family of systems; namely, stream ciphers. They are mainly used in applications where high throughput is required in software or low resource usage is required in hardware. Our focus is on the cryptanalysis of stream ciphers employing linear feedback shift registers (LFSRs). This is modelled as the problem of finding solutions to systems of linear equations with associated probability distributions on the set of right hand sides. To solve this problem, we first present a multivariate version of the correlation attack introduced by Siegenthaler. Building on the ideas of the multivariate attack, we propose a new cryptanalytic method with lower time complexity. Alongside this, we introduce the notion of relations modulo a matrix B, which may be seen as a generalisation of parity-checks used in fast correlation attacks. The latter are among the most important class of attacks against LFSR-based stream ciphers. Our new method is successfully applied to hard instances of the filter generator and requires a lower amount of keystream compared to other attacks in the literature. We also perform a theoretical attack against the Grain-v1 cipher and an experimental attack against a toy Grain-like cipher. Compared to the best previous attack, our technique requires less keystream bits but also has a higher time complexity. This is the result of joint work with Semaev. Public-key cryptosystems based on error-correcting codes are also believed to be secure against quantum attacks. To this end, we develop a new technique in code-based cryptography. Specifically, we propose new decoders for quasi-cyclic moderate density parity-check (QC-MDPC) codes. These codes were proposed by Misoczki et al.\ for use in the McEliece scheme. The use of QC-MDPC codes avoids attacks applicable when using low-density parity-check (LDPC) codes and also allows for keys with short size. Although we focus on decoding for a particular instance of the p-ary QC-MDPC scheme, our new decoding algorithm is also a general decoding method for p-ary MDPC-like schemes. This algorithm is a bit-flipping decoder, and its performance is improved by varying thresholds for the different iterations. Experimental results demonstrate that our decoders enjoy a very low decoding failure rate for the chosen p-ary QC-MDPC instance. This is the result of joint work with Guo and Johansson.Doktorgradsavhandlin