Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Ali, W.A.E. Mohamed, D.A.E. Hassan, A.H.G. |
| Copyright Year | 2013 |
| Description | Author affiliation: Dept. of Electron. & Commun. Eng., Arab Acad. for Sci. & Technol. (AAST), Alexandria, Egypt (Ali, W.A.E.; Mohamed, D.A.E.; Hassan, A.H.G.) |
| Abstract | Beamforming is a signal processing technique that has the ability to direct the main beam toward signal-of-interest and the null toward signal-of-not-interest without moving antenna array. This technique is achieved by using algorithms which change the amplitude and phase of array pattern continuously. This paper presents hybrid algorithm that is a combination of two algorithms, least mean square algorithm and sample matrix inversion algorithm. The hybrid algorithm (least mean square/sample matrix inversion) is applied on an array of dipoles to overcome the shortcomings of existing algorithms for a robust smart antenna system. To focus the main beam toward the desired direction and place the null in the direction of the interference signals, the weights of the inversion matrix in sample matrix inversion are calculated and these weights will be the initial weights in least mean square algorithm. The merit of this approach solves the convergence speed problem of the least mean square algorithm as well as the computation intensive exists in sample matrix inversion algorithm and decreases the least mean square error. The simulation results indicate the analyses of least mean square, sample matrix inversion and hybrid algorithm performances .These techniques are compared and verified using MATLAB. |
| Starting Page | 624 |
| Ending Page | 629 |
| File Size | 392419 |
| Page Count | 6 |
| File Format | |
| ISBN | 9781479900916 |
| DOI | 10.1109/LAPC.2013.6711976 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2013-11-11 |
| Publisher Place | UK |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | sample matrix inversion algorithm Beamforming Least squares approximations Dipole antennas Signal processing algorithms Mean square error methods Least mean square algorithms smart antenna Arrays least mean square algorithm Antenna arrays |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|