Search of an acquisition face with modified spy radar
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G01S-013/66
G01S-013/72
G01S-007/02
G01S-013/00
출원번호
US-0246793
(2008-10-07)
등록번호
US-8184041
(2012-05-22)
발명자
/ 주소
Friesel, Mark A.
출원인 / 주소
Lockheed Martin Corporation
대리인 / 주소
Howard IP Law Group, PC
인용정보
피인용 횟수 :
5인용 특허 :
18
초록▼
Radar beams for searching a volume are selected by determining the central angle and azimuth and elevation extents to define an acquisition face. The number of beams NMBA required to cover the acquisition face is determined by NMBA=(2n+1)(m+12)+(-1)n+m2(2) The number of beams NMBA is multiplied by
Radar beams for searching a volume are selected by determining the central angle and azimuth and elevation extents to define an acquisition face. The number of beams NMBA required to cover the acquisition face is determined by NMBA=(2n+1)(m+12)+(-1)n+m2(2) The number of beams NMBA is multiplied by the dwell per beam to determine the total search time, which is compared with a maximum time; (a) if the total search time is greater than the permissible time, the acquisition face is partitioned, and (b) if the total search time is less, the acquisition face information is applied to a radar processor for filling the unextended acquisition face with the number NMBA of beams in a particular pattern.
대표청구항▼
1. A method for selecting radar beams in a radar system for searching a search volume from estimated target angle and angle covariance together with target range, said method comprising the steps of: determining central angle and azimuth and elevation extents to be searched, to define an acquisition
1. A method for selecting radar beams in a radar system for searching a search volume from estimated target angle and angle covariance together with target range, said method comprising the steps of: determining central angle and azimuth and elevation extents to be searched, to define an acquisition face;calculating a number of radar beams NMBA that cover the acquisition face by NMBA=(2n+1)(m+12)+(-1)n+m2where:m=ceiling(AextΔA)is a minimum number of beams in a beam row comprising adjacent beams with centers at constant elevation and separated by 2ΔA to completely cover an azimuth extent Aext; nE=ceiling(Eext-β2sinαΔE)where: nE=2n+1 is a number of beam rows to cover an acquisition face with elevation extent Eext where a difference in elevation of adjacent beam rows comprising a separation in the direction of elevation of the centers of beams in adjacent rows is given by ΔE;ceiling(x) is a smallest integer greater than or equal to x;β is a beam width, wherein a cross-section of a radar beam is a circular region of diameter β within which beam energy is higher than a threshold value, and outside of which the energy is less than the threshold; andα is equal to ½ an acute angle between two lines extending from a center of a radar beam to points of intersection of a circumference of the beam with the circumference of an adjacent beam;multiplying the number of beams NMBA by a dwell per beam to determine a total search time;comparing said total search time with a maximum permissible search time and (a) if said total search time is greater than said maximum permissible search time, partitioning said acquisition face, and for the partitioned acquisition face, repeating at least said step of calculating the number of beams NMBA, multiplying the number of beams NMBA by the dwell per beam to determine the total search time, and comparing said total search time with a maximum permissible search time; or(b) if said total search time is not greater than said maximum permissible search time, applying acquisition face information to a radar processor for filling the acquisition face with the number NMBA of beams; andusing said radar processor, filling said acquisition face with said number NMBA of beams in a generation pattern. 2. A method according to claim 1, wherein said generation pattern is a rosette pattern. 3. A method according to claim 1, wherein said threshold value is about 3 dB. 4. A method for selecting radar beams in a radar system for searching a search volume, said method comprising the steps of: determining central angle and azimuth and elevation extents of said search volume, to define an acquisition face;calculating a number of radar beams to cover the acquisition face by multiplying the number of beams by a dwell per beam to determine a total search time;comparing said total search time with a maximum permissible search time, and (a) if said total search time is greater than said maximum permissible search time, partitioning said acquisition face, and for the partitioned acquisition face, repeating at least said step of calculating the number of beams, multiplying the number of beams by the dwell per beam to determine the total search time for the partitioned acquisition face, and comparing said total search time for the partitioned acquisition face with a maximum permissible search time; or(b) if said total search time is not greater than said maximum permissible search time, applying acquisition face information to a radar processor for filling the acquisition face with the number of beams. 5. A method according to claim 4, wherein subsequent to the step of comparing said total search time for the partitioned acquisition face with a maximum permissible search time, the method further comprises the step of using said radar processor to cover the partitioned acquisition face with said number of beams in a particular generation pattern if said total search time for the partitioned acquisition face is less than said maximum permissible search time. 6. A method according to claim 5, wherein subsequent to the step of comparing said total search time for the partitioned acquisition face with a maximum permissible search time, the method further comprises the step of further partitioning said acquisition face, and for the further partitioned acquisition face, repeating at least said step of calculating the number of beams, multiplying the number of beams by the dwell per beam to determine the total search time for the further partitioned acquisition face, and comparing said total search time for the further partitioned acquisition face with a maximum permissible search time. 7. A method according to claim 4, wherein said step of calculating a number of radar beams, represented by NMBA, to cover the acquisition face is determined by: NMBA=(2n+1)(m+12)+(-1)n+m2where:m=ceiling(AextΔA)is a minimum number of beams in a beam row comprising adjacent beams with centers at constant elevation and separated by 2ΔA to completely cover an azimuth extent Aext; nE=ceiling(Eext-β2sinαΔE) where: nE=2n+1 is a number of beam rows that cover an acquisition face with elevation extent Eext where a difference in elevation of adjacent beam rows comprising a separation in the direction of elevation of the centers of beams in adjacent rows is given by ΔE;ceiling(x) is a smallest integer greater than or equal to x;β is a beam width, wherein a cross-section of a radar beam is a circular region of diameter β within which beam energy is higher than a threshold value, and outside of which the energy is less than the threshold; andα is equal to ½ an acute angle between two lines extending from a center of a radar beam to points of intersection of a circumference of the beam with the circumference of an adjacent beam. 8. A method according to claim 4, wherein said generation pattern is a rosette pattern. 9. A method according to claim 4, wherein said threshold value is about 3 dB. 10. A system for selecting radar beams for searching a search volume, said system comprising: a processor executing instructions for performing the steps of: determining central angle and azimuth and elevation extents of said search volume, to define an acquisition face;calculating a number of radar beams to cover the acquisition face by multiplying the number of beams by a dwell per beam to determine a total search time; andcomparing said total search time with a maximum permissible search time, (a) if said total search time is greater than said maximum permissible search time, partitioning said acquisition face, and for the partitioned acquisition face, repeating at least said step of calculating the number of beams, multiplying the number of beams by the dwell per beam to determine the total search time for the partitioned acquisition face, and comparing said total search time for the partitioned acquisition face with a maximum permissible search time; or(b) if said total search time is not greater than said maximum permissible search time, applying acquisition face information to a radar processor for filling the acquisition face with the number of beams. 11. A system according to claim 10, wherein the processor executes instructions to, subsequent to the step of comparing said total search time for the partitioned acquisition face with a maximum permissible search time, perform the further step of using said radar processor to cover the partitioned acquisition face with said number of beams in a particular generation pattern if said total search time for the partitioned acquisition face is less than said maximum permissible search time. 12. A system according to claim 11, wherein the processor executes instructions to, subsequent to the step of comparing said total search time for the partitioned acquisition face with a maximum permissible search time, perform the additional step of further partitioning said acquisition face, and for the further partitioned acquisition face, repeating at least said step of calculating the number of beams, multiplying the number of beams by the dwell per beam to determine the total search time for the further partitioned acquisition face, and comparing said total search time for the further partitioned acquisition face with a maximum permissible search time. 13. A system according to claim 10, wherein said step of calculating a number of radar beams, represented by NMBA, to cover the acquisition face is determined by: NMBA=(2n+1)(m+12)+(-1)n+m2where:m=ceiling(AextΔA)is a minimum number of beams in a beam row comprising adjacent beams with centers at constant elevation and separated by 2ΔA to completely cover an azimuth extent Aext; nE=ceiling(Eext-β2sinαΔE)where: nE=2n+1 is a number of beam rows that cover an acquisition face with elevation extent Eext where a difference in elevation of adjacent beam rows comprising a separation in the direction of elevation of the centers of beams in adjacent rows is given by ΔE;ceiling(x) is a smallest integer greater than or equal to x;β is a beam width, wherein a cross-section of a radar beam is a circular region of diameter β within which beam energy is higher than a threshold value, and outside of which the energy is less than the threshold; andα is equal to ½ an acute angle between two lines extending from a center of a radar beam to points of intersection of a circumference of the beam with the circumference of an adjacent beam. 14. A system according to claim 10, wherein said generation pattern is a rosette pattern. 15. A system according to claim 10, wherein said threshold value is about 3 dB.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (18)
Gounalis, Anthony J., Determining scan strategy for digital card.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.