• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.4
• /
• pp.424-434
• /
• 2015

Adaptive beamforming algorithms have been widely used to remove interference and jamming in the phased array radar system. Advances in the field programmable gate array(FPGA) technology now make possible the real time processing of adaptive beamforming (ABF) algorithm. In this paper, the FPGA based real-time implementation method of adaptive beamforming system(beamformer) in the pre-processor module for active electronically scanned array(AESA) radar is proposed. A compact FPGA-based adaptive beamformer is developed using commercial off the shelf(COTS) FPGA board with communication via OpenVPX(Virtual Path Cross-connect) backplane. This beamformer comprises a number of high speed complex processing including QR decomposition & back substitution for matrix inversion and complex vector/matrix calculations. The implemented result shows that the adaptive beamforming patterns through FPGA correspond with results of simulation through Matlab. And also confirms the possibility of application in AESA radar due to the real time processing of ABF algorithm through FPGA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.123-136
• /
• 2004

In this paper, complexity and regularity of polynomial multiplication over $GF({2^n})$ are defined by using Hamming weight of rows and columns of the matrix ever GF(2) which represents polynomial multiplication. It is shown experimentally that in order to construct the block cipher robust against differential cryptanalysis, polynomial multiplication of substitution layer and the permutation layer should have high complexity and high regularity. With result of the experiment, a way of constituting S box and G function is suggested in the block cipher whose structure is similar to SEED, which is KOREA standard of 128-bit block cipher. S box can be formed with a nonlinear function and an affine transform. Nonlinear function must be strong with differential attack and linear attack, and it consists of an inverse number over $GF({2^8})$ which has neither a fixed pout, whose input and output are the same except 0 and 1, nor an opposite fixed number, whose output is one`s complement of the input. Affine transform can be constituted so that the input/output correlation can be the lowest and there can be no fixed point or opposite fixed point. G function undergoes linear transform with 4 S-box outputs using the matrix of 4${\times}$4 over $GF({2^8})$. The components in the matrix of linear transformation have high complexity and high regularity. Furthermore, G function can be constituted so that MDS(Maximum Distance Separable) code can be formed, SAC(Strict Avalanche Criterion) can be met, and there can be no weak input where a fixed point an opposite fixed point, and output can be two`s complement of input. The primitive polynomials of nonlinear function affine transform and linear transformation are different each other. The S box and G function suggested in this paper can be used as a constituent of the block cipher with high security, in that they are strong with differential attack and linear attack with no weak input and they are excellent at diffusion.

• Journal of the Society of Naval Architects of Korea
• /
• v.29 no.4
• /
• pp.114-131
• /
• 1992

In the present work, a two-dimensional boundary-value problem for a large amplitude motion is treated as an initial-value problem by satisfying the exact body-boundary and nonlinear free-surface boundary conditions. The present nonlinear numerical scheme is similar to that described by Vinje and Brevig(1981) who utilized the Cauchy's theorem and assumed the periodicity in the horizontal coordinate. In the present thesis, however, the periodicity in the horizontal coordinate is not assumed. Thus the present method can treat more realistic problems, which allow radiating waves to infinities. In the present method of solution, the original infinite fluid domain, is divided into two subdomains ; ie the inner and outer subdomains which are a local nonlinear subdomain and the truncated infinite linear subdomain, respectively. By imposing an appropriate matching condition, the computation is carried out only in the inner domain which includes the body. Here we adopt the nonlinear scheme of Vinje & Brevig only in the inner domain and respresent the solution in the truncated infinite subdomains by distributing the time-dependent Green function on the matching boundaries. The matching condition is that the velocity potential and stream function are required to be continuous across the matching boundary. In the computations we used, if necessary, a regriding algorithm on the free surface which could give converged stable solutions successfully even for the breaking waves. In harmonic oscillation problem, each harmonic component and time-mean force are obtained by the Fourier transform of the computed forces in the time domain. The numerical calculations are made for the following problems. $\cdot$ Forced harmonic large-amplitude oscillation(${\omega}{\neq}0,\;U=0$) $\cdot$ Translation with a uniform speed(${\omega}=0,\;U{\neq}0$) The computed results are compared with available experimental data and other analytical results.