A nested array-based multi-octave constant beamwidth beamforming method and system
A technology of constant beam width and multiple frequency multiplication, applied in the direction of impedance network, digital technology network, electrical components, etc., can solve the problems of huge and complex calculation amount of prototype algorithm, and achieve the goal of reducing calculation amount, ensuring quality and reducing calculation amount Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0063] The present invention performs down-sampling processing on low-frequency sub-array signals, taking nested arrays with a relationship of 2 times and a bandwidth of 7 octaves as an example.
[0064] Such as image 3 As shown, in the figure, sub-array No. 1 is the long sub-array of the first octave (the sub-band with the lowest frequency) (corresponding to the lower frequency limit of the sub-band), and No. 2 sub-array is the short sub-array of the first octave. (corresponding to the frequency upper limit of the sub-band); No. 2 sub-array is also the longest sub-array of the second octave, No. 3 sub-array is the short sub-array of the second octave; and so on, No. 7 sub-array is The long sub-array of the seventh octave (the sub-band with the highest frequency), and the No. 8 sub-array is the short sub-array of the seventh octave. The core steps of the nested array-based multi-octave constant beamwidth beamforming method provided by the embodiment of the present invention ...
Embodiment 2
[0074] This embodiment further optimizes the technical means of embodiment 1, specifically: since the algorithm of embodiment 1 adopts down-sampling and up-sampling processing with frequent use of high multiples, up-sampling and up-sampling become the main calculation amount. However, the core of the downsampling and upsampling algorithms is the low-pass filter, because the coefficient of the low-pass filter will increase linearly with the multiple of the upsampling, which will still cause a large amount of calculation in the low frequency band, especially in the In applications with limited computing resources and real-time processing requirements, it is necessary to study more efficient processing algorithms. For this reason, the present invention further carries out as follows to algorithm Figure 4 The improvement shown, that is, the present invention is further replaced by a 2-stage up-down sampling cascade image 3 High-magnification direct up-down sampling in . Taking...
Embodiment 3
[0101] This embodiment further optimizes the technical means of embodiment 1 or embodiment 2, specifically: the present invention uses the tree algorithm structure in multi-sampling rate digital signal processing to further reduce the calculation amount. The specific improvement is: after the low-frequency band signal is band-pass filtered, it is not necessary to directly perform multi-stage 2-fold upsampling. After only one level of 2-fold up-sampling, the signal can be added to the adjacent high-frequency band, and the signal can be doubled. The signal after frequency band combination is up-sampled by 2 times, and then added to the next octave, so progressive, such as Figure 5-a shown. After calculation, the further optimized algorithm reduces the amount of computation for upsampling to Figure 4 19.7% of the calculated amount.
[0102] In short, after the above-mentioned improvements to the existing algorithm, the calculation amount of the multi-octave nested array const...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



