Flexible design of decoupling and matching networks for two strongly coupled antennas

The flexible design of decoupling and matching networks for coupled antennas is introduced. The network includes three parts: circuits for impedance transformation, an element for odd-mode decoupling and conventional matching networks. It is found that all three parts are determined by one parameter of the ABCD matrix of the impedance transformation circuit. Thus a large variety of circuits with different element values can be used for decoupling which relaxes the practical design constraints.

Dual-band Decoupling and Matching Network Design for very Closely Spaced Antennas

A practical method for the design of dual-band decoupling and matching networks (DMN) for two closely spaced antennas using discrete components is presented. The DMN reduces the port-to-port coupling and enhances the diversity of the antennas. By applying the DMN, the radiation efficiency can also be improved when one port is fed and the other port is match terminated. The proposed DMN works at two frequencies simultaneously without the need for any switch. As a proof of concept, a dual-band DMN for a pair of monopoles spaced 0.05λ apart is designed. The measured return loss and port isolation exceed 10 dB from 1.71 GHz to 1.76 GHz and from 2.27 GHz to 2.32 GHz.

Tunable decoupling and matching network for diversity enhancement of closely spaced antennas

A tunable decoupling and matching network (DMN) for a closely spaced two-element antenna array is presented. The DMN achieves perfect matching for the eigenmodes of the array and thus simultaneously isolates and matches the system ports while keeping the circuit small. Arrays of closely spaced wire and microstrip monopole pairs are used to demonstrate the proposed DMN. It is found that monopoles with different lengths can be used for the design frequency by using this DMN, which increases the design flexibility. This property also enables frequency tuning using the DMN only without having to change the length of the antennas. The proposed DMN uses only one varactor to achieve a tuning range of 18.8% with both return loss and isolation better than 10-dB when the spacing between the antenna is 0.05λ. When the spacing increases to 0.1λ, the simulated tuning range is more than 60%.

Integrated decoupling and matching network incorporated in the ground plane of a compact monopole array

Compact arrays enable various applications such as antenna beam-forming and multi-input, multi-output (MIMO) schemes on limited-size platforms. The reduced element spacing in compact arrays introduces high levels of mutual coupling which can affect the performance of the adaptive array. This coupling causes a mismatch at the input ports, which disturbs the performance of the individual elements in the array and affects the implementation of beam steering. In this article, a reactive decoupling network for a 3-element monopole array is used to establish port isolation while simultaneously matching input impedance at each port to the system impendence. The integrated decoupling and matching network is incorporated in the ground plane of the monopole array, providing further development scope for beamforming using phase shifters and power splitters in double-layered circuits.

Accurate pattern prediction of very closely spaced mismatched antennas using measured active element patterns

A method for prediction of the radiation pattern of N strongly coupled antennas with mismatched sources is presented. The method facilitates fast and accurate design of compact arrays. The prediction is based on the measured N-port S parameters of the coupled antennas and the N active element patterns measured in a 50 ω environment. By introducing equivalent power sources, the radiation pattern with excitation by sources with arbitrary impedances and various decoupling and matching networks (DMN) can be accurately predicted without the need for additional measurements. Two experiments were carried out for verification: pattern prediction for parasitic antennas with different loads and for antennas with DMN. The difference between measured and predicted patterns was within 1 to 2 dB.

Array of antenna arrays

Antenna arrays are groups of antenna elements spaced in a geometrical pattern. By changing the phase excitation of each element, the array is capable of transmitting electromagnetic waves strongly in a chosen direction with little or no radiation in another direction, thus controlling the array's radiation pattern without physically moving any parts. An antenna array of sub-arrays replaces conventional antenna elements with compact circular arrays with potential for improved performance. This thesis expands on the concept by exploring the development, realisation and operation of an array of subarrays. The overall size of the array essentially remains the same, but the array's performance is improved due to having steerable directive subarrays. The negative effects of strong mutual coupling between closely spaced elements of a subarray are analysed and a number of new solutions for element decoupling are proposed.

Finding and matching communities in social networks using data mining

The rapid growth in the number of users using social networks and the information that a social network requires about their users make the traditional matching systems insufficiently adept at matching users within social networks. This paper introduces the use of clustering to form communities of users and, then, uses these communities to generate matches. Forming communities within a social network helps to reduce the number of users that the matching system needs to consider, and helps to overcome other problems from which social networks suffer, such as the absence of user activities' information about a new user. The proposed system has been evaluated on a dataset obtained from an online dating website. Empirical analysis shows that accuracy of the matching process is increased using the community information.

Generalized matching networks and their properties

In this paper, we introduce two kinds of graphs: the generalized matching networks (GMNs) and the recursive generalized matching networks (RGMNs). The former generalize the hypercube-like networks (HLNs), while the latter include the generalized cubes and the star graphs. We prove that a GMN on a family of k-connected building graphs is -connected. We then prove that a GMN on a family of Hamiltonian-connected building graphs having at least three vertices each is Hamiltonian-connected. Our conclusions generalize some previously known results.

Comparing China's city transportation and economic networks

The city system has been a prevailing research issue in the fields of urban geography and regional economics. Not only do the relationships between cities in the city system exist in the form of rankings, but also in a more general network form. Previous work has examined the spatial structure of the city system in terms of its separate industrial networks, such as in transportation and economic activity, but little has been done to compare different networks. To rectify this situation, this study analyzes and reveals the spatial structural features of China’s city system by comparing its transportation and economic urban networks, thus providing new avenues for research on China’s city network. The results indicate that these two networks relate with each other by sharing structural equivalence with a basic diamond structure and a layered intercity structure decreasing outwards from the national centers. A decoupling effect also exists between them as the transportation network contributes to a balanced regional development, while the economic network promotes agglomeration economies. The law of economic development and the government both play important roles in the articulation between these two networks, and the gap between them can be shortened by related policy reforms and the improvement of the transportation network.

Biodiversity, Species Interactions and Ecological Networks in a Fragmented World

Biodiversity is organised into complex ecological networks of interacting species in local ecosystems, but our knowledge about the effects of habitat fragmentation on such systems remains limited. We consider the effects of this key driver of both local and global change on both mutualistic and antagonistic systems at different levels of biological organisation and spatiotemporal scales.There is a complex interplay of patterns and processes related to the variation and influence of spatial, temporal and biotic drivers in ecological networks. Species traits (e.g. body size, dispersal ability) play an important role in determining how networks respond to fragment size and isolation, edge shape and permeability, and the quality of the surrounding landscape matrix. Furthermore, the perception of spatial scale (e.g. environmental grain) and temporal effects (time lags, extinction debts) can differ markedly among species, network modules and trophic levels, highlighting the need to develop a more integrated perspective that considers not just nodes, but the structural role and strength of species interactions (e.g. as hubs, spatial couplers and determinants of connectance, nestedness and modularity) in response to habitat fragmentation.Many challenges remain for improving our understanding: the likely importance of specialisation, functional redundancy and trait matching has been largely overlooked. The potentially critical effects of apex consumers, abundant species and supergeneralists on network changes and evolutionary dynamics also need to be addressed in future research. Ultimately, spatial and ecological networks need to be combined to explore the effects of dispersal, colonisation, extinction and habitat fragmentation on network structure and coevolutionary dynamics. Finally, we need to embed network approaches more explicitly within applied ecology in general, because they offer great potential for improving on the current species-based or habitat-centric approaches to our management and conservation of biodiversity in the face of environmental change.

A synthesis method for broad-band antenna impedance matching networks /

Vita.

Reconfigurable Matching Networks for RF Amplifiers

This article presents applications of reconfigurable matching networks for RF amplifier design. Two possible solutions are given, one where the switching element is a PIN diode, and the other is based on graphene. Due to the fact that its conductivity depends on applied bias voltage, the graphene-based circuits can be used in microwave circuits as controllable elements. The structure of the proposed switch is very simple and it is particularly convenient for microstrip-based circuits. Because of that, a design of reconfigurable amplifier with the graphene-based switch is presented together with the one which has the PIN diode switch. Both amplifiers have the same specifications, and the one with the PIN diode switch is fabricated. The amplifier utilizing the PIN switch was used as a reference to make a comparison the two types of switches. Results of both amplifiers are very similar which indicates possible future applications of the graphene-based switch.

Leveraging Multiple Features for Image Retrieval and Matching

The goal of image retrieval and matching is to find and locate object instances in images from a large-scale image database. While visual features are abundant, how to combine them to improve performance by individual features remains a challenging task. In this work, we focus on leveraging multiple features for accurate and efficient image retrieval and matching. We first propose two graph-based approaches to rerank initially retrieved images for generic image retrieval. In the graph, vertices are images while edges are similarities between image pairs. Our first approach employs a mixture Markov model based on a random walk model on multiple graphs to fuse graphs. We introduce a probabilistic model to compute the importance of each feature for graph fusion under a naive Bayesian formulation, which requires statistics of similarities from a manually labeled dataset containing irrelevant images. To reduce human labeling, we further propose a fully unsupervised reranking algorithm based on a submodular objective function that can be efficiently optimized by greedy algorithm. By maximizing an information gain term over the graph, our submodular function favors a subset of database images that are similar to query images and resemble each other. The function also exploits the rank relationships of images from multiple ranked lists obtained by different features. We then study a more well-defined application, person re-identification, where the database contains labeled images of human bodies captured by multiple cameras. Re-identifications from multiple cameras are regarded as related tasks to exploit shared information. We apply a novel multi-task learning algorithm using both low level features and attributes. A low rank attribute embedding is joint learned within the multi-task learning formulation to embed original binary attributes to a continuous attribute space, where incorrect and incomplete attributes are rectified and recovered. To locate objects in images, we design an object detector based on object proposals and deep convolutional neural networks (CNN) in view of the emergence of deep networks. We improve a Fast RCNN framework and investigate two new strategies to detect objects accurately and efficiently: scale-dependent pooling (SDP) and cascaded rejection classifiers (CRC). The SDP improves detection accuracy by exploiting appropriate convolutional features depending on the scale of input object proposals. The CRC effectively utilizes convolutional features and greatly eliminates negative proposals in a cascaded manner, while maintaining a high recall for true objects. The two strategies together improve the detection accuracy and reduce the computational cost.