Design and fpga implementation of an efficient deinterleaving algorithm

Download
2008
Olgun, Muhammet Ertuğ
In this work, a new deinterleaving algorithm that can be used as a part of an ESM system and its implementation by using an FPGA is studied. The function of the implemented algorithm is interpreting the complex electromagnetic military field in order to detect and determine different RADARs and their types by using incoming RADAR pulses and their PDWs. It is assumed that RADAR signals in the space are received clearly and PDW of each pulse is generated as an input to the implemented algorithm system. Clustering analysis and a new interpreting process is used to deinterleave the RADAR pulses. In order to implement the algorithm, FPGA is used for achieving a faster and more efficient system. Comparison of the new algorithm and the previous deinterleaving studies is done. The simulation results are shown and discussed in detail.

Suggestions

Neural network based beamforming for linear and cylindrical array applications
Güreken, Murat; Dural Ünver, Mevlüde Gülbin; Department of Electrical and Electronics Engineering (2009)
In this thesis, a Neural Network (NN) based beamforming algorithm is proposed for real time target tracking problem. The algorithm is performed for two applications, linear and cylindrical arrays. The linear array application is implemented with equispaced omnidirectional sources. The influence of the number of antenna elements and the angular seperation between the incoming signals on the performance of the beamformer in the linear array beamformer is studied, and it is observed that the algorithm improves...
Boolean functions with excellent cryptographic properties in autocorrelation and walsh spectra
Kavut, Selçuk; Yücel Diker, Melek; Department of Electrical and Electronics Engineering (2008)
We introduce a steepest-descent-like search algorithm for the design of Boolean functions, yielding multiple desirable cryptographic properties in their Walsh and autocorrelation spectra together. The algorithm finds some Boolean functions on 9, 10, 11, 13 variables with very good cryptographic properties unattained in the literature. More specifically, we have discovered 9-variable rotation symmetric Boolean functions (RSBFs) having nonlinearity of 241, which exceeds the bent concatenation bound and has re...
Fpga implementation of jointly operating channel estimator and parallelized decoder
Kılcıoğlu, Çağlar; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2009)
In this thesis, implementation details of a joint channel estimator and parallelized decoder structure on an FPGA-based platform is considered. Turbo decoders are used for the decoding process in this structure. However, turbo decoders introduce large decoding latencies since they operate in an iterative manner. To overcome that problem, parallelization is applied to the turbo codes and the resulting parallel decodable turbo code (PDTC) structure is employed for coding. The performance of a PDTC decoder and...
Computation of radar cross sections of complex targets by physical optics with modified surface normals
Durgun, Ahmet Cemal; Kuzuoğlu, Mustafa; Department of Electrical and Electronics Engineering (2008)
In this study, a computer code is developed in MATLAB® to compute the Radar Cross Section (RCS) of arbitrary shaped complex targets by using Physical Optics (PO) and Modified PO. To increase the computational efficiency of the code, a novel fast integration procedure for oscillatory integrals, called Levin’s integration, is applied to PO integrals. In order to improve the performance of PO near grazing angles and to model diffraction effects, a method called PO with Modified Surface Normal Vectors is implem...
Design and performance of capacity approaching irregular low-density parity-check codes
Bardak, Erinç Deniz; Diker Yücel, Melek; Department of Electrical and Electronics Engineering (2009)
In this thesis, design details of binary irregular Low-Density Parity-Check (LDPC) codes are investigated. We especially focus on the trade-off between the average variable node degree, wa, and the number of length-6 cycles of an irregular code. We observe that the performance of the irregular code improves with increasing wa up to a critical value, but deteriorates for larger wa because of the exponential increase in the number of length-6 cycles. We have designed an irregular code of length 16,000 bits wi...
Citation Formats
M. E. Olgun, “Design and fpga implementation of an efficient deinterleaving algorithm,” M.S. - Master of Science, Middle East Technical University, 2008.