000 04381ntm a2200385 i 4500
001 vtls000103164
003 KUKTEM
005 20251117113358.0
008 190514s2017 my a f am 000 0 eng d
020 _aTHE0005189(Local)
039 9 _a201905141438
_bhanafiah
_c201905141312
_dida
_c201905141311
_dida
_y201803261217
_zsaini
040 _aUMP
_beng
_cUMP
_erda
090 _aFKEE .K45 2017 r Thesis
100 0 _aKelvin Lazarus Lazarus,
_eauthor.
245 1 0 _aAdaptive beamforming algorithm based on Simulated Kalman Filter /
_cKelvin Lazarus A/L Lazarus
246 0 4 _aSimulated Kalman Filter algorithms for adaptive beamforming
264 1 _aKuantan, Pahang :
_bUMP,
_c2017
264 4 _c© 2017
300 _axiii, 91 pages :
_billustrations (some color) ;
_c30 cm. +
_e1 CD-ROM
336 _atext
_2rdacontent
336 _atext
_2rdacontent
337 _aunmediated
_2rdamedia
337 _acomputer
_2rdamedia
338 _avolume
_2rdacarrier
338 _acomputer disc
_2rdacarrier
347 _atext file
_bPDF
_2rda
500 _aFaculty of Electrical and Electronics Engineering
502 _aThesis (Master of Science) -- Universiti Malaysia Pahang – 2017
504 _aIncludes bibliographical references
520 3 _aAdaptive beamforming is a technique used to steer the radiation pattern towards the desired signal and cancel out any interference signal by finding the appropriate weights for every element in an array antenna, to achieve maximum signal to interference plus noise ratio (SINR). There are many methods to perform adaptive beamforming and one of the method is to use metaheuristic algorithm, to estimate the weights for individual elements in an array. Over the years, various metaheuristic algorithms have been applied to adaptive beamforming. Some of the metaheuristic algorithms have been modified from the original algorithms to improve the algorithms performance in adaptive beamforming application. A new metaheuristic algorithm named Simulated Kalman Filter (SKF), is inspired by the estimation capabilities of Kalman filter, has not been applied to adaptive beamforming application. Therefore, this research presents the first-time application of SKF algorithm to adaptive beamforming. The SKF algorithm, however, often converge prematurely at local optimum due to lack of exploration, preventing it from finding better solution. A modified version of the SKF algorithm, named Opposition-Based SKF (OBSKF), introduced by K. Zakwan, applies Opposition-Based Learning method to improve the exploration capabilities of SKF algorithm. Moreover, a new modified version of the SKF algorithm named SKF with Modified Measurement (SKFMM) is introduced to further improve the exploration capabilities of SKF algorithm by modifying the measurement-update equation. The SKF, OBSKF and SKFMM is applied to an array antenna with 10 elements arranged linearly with 0.5 𝜆 distance between elements. The desired signal angle is set 30° and the interference signal angle is set to −70°,−40°,−30°,−10°,0°,10°,50°,70°. The experiment is repeated for 100 times for various signal to noise ratio (SNR) values to obtain statistical results for best, worst, mean and standard deviation of the signal to interference plus noise ratio (SINR). The results obtained using SKF, OBSKF and SKFMM is compared to previously published work, Adaptive Mutated Boolean Particle Swarm Optimization (AMBPSO). The results show that all three SKF algorithms can produce higher mean SINR and lower standard deviation values compared to AMBPSO. The high mean SINR and low standard deviation value proves that the SKF algorithms are accurate and consistent in finding better solution. All the SKF algorithms produces consistency above 70% compared to existing AMBPSO for adaptive beamforming. Among the three SKF algorithms, the SKFMM produces the highest mean SINR values and is also the most consistent. The SKFMM is more consistent than the SKF algorithm by 25.20% and the SKFMM is more consistent than the OBSKF algorithm by 17.50%.
610 2 0 _aFaculty of Electrical and Electronics Engineering
_xDissertations
650 0 _aUniversities and colleges
_xDisertations
650 0 _aTheses
999 _aVIRTUA40
_c7646
_d7652
999 _aVTLSSORT0080*0200*0400*0900*1000*2450*2460*2640*2641*3000*3360*3361*3370*3371*3380*3381*3470*5000*5020*5040*5200*6100*6500*6501*9992