Veuillez utiliser cette adresse pour citer ce document : http://dspace1.univ-tlemcen.dz/handle/112/2406
Affichage complet
Élément Dublin CoreValeurLangue
dc.contributor.authorBouacha, A-
dc.contributor.authorDebbat, F-
dc.contributor.authorBendimerad, FT-
dc.date.accessioned2013-06-18T13:15:12Z-
dc.date.available2013-06-18T13:15:12Z-
dc.date.issued2008-01-
dc.identifier.urihttp://dspace.univ-tlemcen.dz/handle/112/2406-
dc.description.abstractIntelligent antennas take advantage of both antenna and propagation technologies. They have the potential to reduce multipath interference, increase signal to noise ratio, and introduce frequency reuse within a confined environment. Several challenges remain however in the growth of intelligent antennas; one of these is the development of new beamforming algorithm for the best use of the received signal. This study focuses on the development and the application of a new simple matrix inversion normalized constant modulus algorithm (SMI-NCMA) for smart antennas. The SMI-NCMA which combines the individual good aspects of Sample Matrix Inversion (SMI) and the Normalized Constant Modulus algorithms (NCMA) is described. Simulation results show that less complexity SMI-NCMA improves the interference suppression and gain enhancement over classical NCMA, converges from the initial iteration and achieves BER (bite error rate) improvements for cochannel interference.en_US
dc.language.isoenen_US
dc.publisherUniversity of Tlemcenen_US
dc.subjectSmart antennaen_US
dc.subjectbeamforming algorithmen_US
dc.subjectconstant modulus algorithm (CMA)en_US
dc.subjectsimple matrix inversion (SMI)en_US
dc.subjectnormalized constant modulus algorithm (NCMA)en_US
dc.titleMODIFIED BLIND BEAMFORMING ALGORITHM FOR SMART ANTENNA SYSTEMen_US
dc.typeArticleen_US
Collection(s) :Articles internationaux

Fichier(s) constituant ce document :
Fichier Description TailleFormat 
MODIFIED-BLIND-BEAMFORMING-ALGORITHM-FOR-SMART-ANTENNA-SYSTEM.pdf186,32 kBAdobe PDFVoir/Ouvrir


Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.