Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Abdulqader, Ahmed Jameel" wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-2 z 2
    Tytuł:
    Linear and Planar Array Pattern Nulling via Compressed Sensing
    Autorzy:
    Mohammed, Jafar Ramadhan
    Thaher, Raad H.
    Abdulqader, Ahmed Jameel
    Powiązania:
    https://bibliotekanauki.pl/articles/1839322.pdf
    Data publikacji:
    2021
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    compressed sensing
    convex optimization
    iterative re-weighted l1- norm minimization
    linear array
    planar array
    Opis:
    An optimization method based on compressed sensing is proposed for uniformly excited linear or planar antenna arrays to perturb excitation of the minimum number of array elements in such a way that the required number of nulls is obtained. First, the spares theory is relied upon to formulate the problem and then the convex optimization approach is adopted to find the optimum solution. The optimization process is further developed by using iterative re-weighted l1- norm minimization, helping select the least number of the sparse elements and impose the required constraints on the array radiation pattern. Furthermore, the nulls generated are wide enough to cancel a whole specific sidelobe. Simulation results demonstrate the effectiveness of the proposed method and the required nulls are placed with a minimum number of perturbed elements. Thus, in practical implementations of the proposed method, a highly limited number of attenuators and phase shifters is required compared to other, conventional methods.
    Źródło:
    Journal of Telecommunications and Information Technology; 2021, 3; 50-55
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Beam Pattern Optimization Via Unequal Ascending Clusters
    Autorzy:
    Abdulqader, Ahmed Jameel
    Mohammed, Jafar Ramadhan
    Ali, Yessar E. Mohammad
    Powiązania:
    https://bibliotekanauki.pl/articles/2200966.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    beam pattern
    clustered array
    genetic algorithm
    sidelobes
    Opis:
    In this paper, two different architectures based on completely and sectionally clustered arrays are proposed to improve the array patterns. In the wholly clustered arrays, all elements of the ordinary array are divided into multiple unequal ascending clusters. In the sectionally clustered arrays, two types of architectures are proposed by dividing a part of the array into clusters based on the position of specific elements. In the first architecture of sectionally clustered arrays, only those elements that are located on the sides of the array are grouped into unequal ascending clusters, and other elements located in the center are left as individual and unoptimized items (i.e. uniform excitation). In the second architecture, only some of the elements close the center are grouped into unequal ascending clusters, and the side elements were left individually and without optimization. The research proves that the sectionally clustered architecture has many advantages compared to the completely clustered structure, in terms of the complexity of the solution. Simulation results show that PSLL in the side clustered array can be reduced to more than −28 dB for an array of 40 elements. The PSLL was −17 dB in the case of a centrally clustered array, whereas the complexity percentage in the wholly clustered array method was 12 .5 %, while the same parameter for the partially clustered array method equaled 10%.
    Źródło:
    Journal of Telecommunications and Information Technology; 2023, 1; 1--7
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-2 z 2

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies