Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations
In monopulse radar antennas, the synthesizing process of the sum and difference patterns must be fast enough to achieve good tracking of the targets. At the same time, the feed networks of such antennas must be as simple as possible for efficient implementation. To achieve these two goals, an iterat...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | International Journal of Antennas and Propagation |
| Online Access: | http://dx.doi.org/10.1155/2017/2563901 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849405651445350400 |
|---|---|
| author | Jafar Ramadhan Mohammed |
| author_facet | Jafar Ramadhan Mohammed |
| author_sort | Jafar Ramadhan Mohammed |
| collection | DOAJ |
| description | In monopulse radar antennas, the synthesizing process of the sum and difference patterns must be fast enough to achieve good tracking of the targets. At the same time, the feed networks of such antennas must be as simple as possible for efficient implementation. To achieve these two goals, an iterative fast Fourier transform (FFT) algorithm is used to synthesize sum and difference patterns with the main focus on obtaining a maximum allowable sharing percentage in the element excitations. The synthesizing process involves iterative calculations of FFT and its inverse transformations; that is, starting from an initial excitation, the successive improved radiation pattern and its corresponding modified element excitations can be found repeatedly until the required radiation pattern is reached. Here, the constraints are incorporated in both the array factor domain and the element excitation domain. By enforcing some constraints on the element excitations during the synthesizing process, the described method provides a significant reduction in the complexity of the feeding network while achieving the required sum and difference patterns. Unlike the standard optimization approaches such as genetic algorithm (GA), the described algorithm performs repeatedly deterministic transformations on the initial field until the prescribed requirements are satisfied. This property makes the proposed synthesizing method converge much faster than GA. |
| format | Article |
| id | doaj-art-512adae0362d4fd6b33a38779ece9b65 |
| institution | Kabale University |
| issn | 1687-5869 1687-5877 |
| language | English |
| publishDate | 2017-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Antennas and Propagation |
| spelling | doaj-art-512adae0362d4fd6b33a38779ece9b652025-08-20T03:36:37ZengWileyInternational Journal of Antennas and Propagation1687-58691687-58772017-01-01201710.1155/2017/25639012563901Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element ExcitationsJafar Ramadhan Mohammed0College of Electronics Engineering, Ninevah University, Mosul 41001, IraqIn monopulse radar antennas, the synthesizing process of the sum and difference patterns must be fast enough to achieve good tracking of the targets. At the same time, the feed networks of such antennas must be as simple as possible for efficient implementation. To achieve these two goals, an iterative fast Fourier transform (FFT) algorithm is used to synthesize sum and difference patterns with the main focus on obtaining a maximum allowable sharing percentage in the element excitations. The synthesizing process involves iterative calculations of FFT and its inverse transformations; that is, starting from an initial excitation, the successive improved radiation pattern and its corresponding modified element excitations can be found repeatedly until the required radiation pattern is reached. Here, the constraints are incorporated in both the array factor domain and the element excitation domain. By enforcing some constraints on the element excitations during the synthesizing process, the described method provides a significant reduction in the complexity of the feeding network while achieving the required sum and difference patterns. Unlike the standard optimization approaches such as genetic algorithm (GA), the described algorithm performs repeatedly deterministic transformations on the initial field until the prescribed requirements are satisfied. This property makes the proposed synthesizing method converge much faster than GA.http://dx.doi.org/10.1155/2017/2563901 |
| spellingShingle | Jafar Ramadhan Mohammed Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations International Journal of Antennas and Propagation |
| title | Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations |
| title_full | Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations |
| title_fullStr | Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations |
| title_full_unstemmed | Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations |
| title_short | Synthesizing Sum and Difference Patterns with Low Complexity Feeding Network by Sharing Element Excitations |
| title_sort | synthesizing sum and difference patterns with low complexity feeding network by sharing element excitations |
| url | http://dx.doi.org/10.1155/2017/2563901 |
| work_keys_str_mv | AT jafarramadhanmohammed synthesizingsumanddifferencepatternswithlowcomplexityfeedingnetworkbysharingelementexcitations |