Antenna Array Search via Hierarchical Grouping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional antenna search methods in wireless communication devices require extensive search operations, leading to increased burden and time consumption when linking to electronic devices, especially with multiple antenna arrays.
Innovation Solution
A wireless communication device with a control circuit that groups antenna arrays into test groups, performs scanning operations to select a specific test group, and conducts setting operations to re-configure the groups, thereby reducing the number of search operations required to find an optimal antenna for linking.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional antenna search method is used to search optimal antenna from antenna arrays, then complete search can be performed, but search time increases and device burden increases
Solution Approach 1:
The patent divides the antenna array into multiple sub-arrays and further segments them into test groups. Instead of searching all antennas individually, the system first searches at the sub-array level, then refines to specific test groups. This hierarchical segmentation reduces the search space from N individual antennas to log(N) search operations, significantly reducing search time while maintaining reliability.
Solution Approach 2:
The patent performs preliminary grouping of antennas into sub-arrays and test groups before the actual search operation. By pre-organizing antennas into structured groups and establishing a hierarchical search framework in advance, the system eliminates the need for exhaustive individual antenna searches, thereby reducing search time without compromising the completeness of the search.
2Reliability
If exhaustive search is performed on all antenna arrays, then optimal antenna can be found, but device burden increases
Solution Approach 1:
The patent segments the antenna array into hierarchical levels (sub-arrays, then test groups within sub-arrays). This segmentation transforms a single complex exhaustive search into multiple simpler staged searches, reducing computational burden at each stage while preserving the ability to identify the optimal antenna through progressive refinement.
Solution Approach 2:
The patent implements a dynamic search strategy where the search granularity adapts at different stages. Initially, larger sub-array groups are searched coarsely; then, based on performance measurements, smaller test groups are identified and searched more finely. This dynamic adjustment of search resolution reduces overall computational burden while maintaining accurate optimal antenna selection.
Data Source
AI summary
A wireless communication device for linking to an electronic device and including at least one antenna array and a control circuit is provided. The control circuit groups the at least one antenna array to obtain a plurality of test groups. In a scanning operation, the control circuit selects one of the test groups to be a specific test group. In a setting operation, the control circuit groups the specific test group, and re-obtains the plurality of test groups according to the grouped specific test group. The control circuit searches at least one optimal antenna for linking to the electronic device from the at least one antenna array through the scanning operation and the setting operation.