In this paper, we study a low profile top loaded monopole antenna. By changing the number, thickness, position and shape of post(s), the input and radiation characteristic due to parameters of matching post(s) are investigated. The low profile top loaded monopole antenna (TLMA) is known as a suitable way for antenna's miniaturization. But it is also reported that the parameters of matching post influence the input and radiation characteristic greatly. The FDTD method is well suit for use in analyzing both the plate and wire structure. And to improve the calculation effect efficiency, the non-uniform mesh FDTD algorithm is used. From the measurement and simulation results, we propose the most suitable parameters of matching structure for low profile top loaded monopole antenna.

A filter integrated antenna configuration that suppresses the coupling signal from the transmitter (Tx) to receiver (Rx) base station antenna is investigated. We propose an aperture coupled patch antenna with multiple trapezoidal elements installed on the substrate of the Rx antenna between the radiation and feed layers in order to increase the bandwidth in the Rx band while maintaining low mutual coupling in the Tx band. The mutual coupling characteristics and the fractional bandwidth of the Rx antenna are presented as functions of the shape and width of the trapezoidal elements.

Numerical modeling of realistic engineering problems using the FDTD technique often requires smaller cell size, higher simulation accuracy and less computation resources. In this paper, we describe a high performance three-dimensional FDTD algorithm by using non-uniform mesh that allows flexible cell size to improve the accuracy of modeling, and computation resource also can be reduced greatly. In this paper, we will first explain the detailed formulation and algorithm of Non-Uniform Mesh. Next, examination of the reflection error from fine-coarse boundary because of the discontinuity is carried out. Then some test geometry are solved by using both uniform mesh and non-uniform mesh FDTD scheme to validate the results and check the accuracy of solution. We also examine the calculation accuracy due to mesh size ratio, and then investigation of how to determine the fine mesh region surrounding the object for a most small computation error will be carried out in this paper. In addition, the algorithm is demonstrated for several different antenna geometry.

Non-orthogonal multiple access (NOMA) utilizing the power domain and advanced receiver has been considered as one promising multiple access technology for further cellular enhancements toward the 5th generation (5G) mobile communications system. Most of the existing investigations into NOMA focus on the combination of NOMA with orthogonal frequency division multiple access (OFDMA) for either downlink or uplink. In this paper, we investigate NOMA for uplink with single carrier-frequency division multiple access (SC-FDMA) being used. Differently from OFDMA, SC-FDMA requires consecutive resource allocation to a user equipment (UE) in order to achieve low peak to average power ratio (PAPR) transmission by the UE. Therefore, sophisticated designs of scheduling algorithm for NOMA with SC-FDMA are needed. To this end, this paper investigates the key issues of uplink NOMA scheduling such as UE grouping method and resource widening strategy. Because the optimal schemes have high computational complexity, novel schemes with low computational complexity are proposed for practical usage for uplink resource allocation of NOMA with SC-FDMA. On the basis of the proposed scheduling schemes, the performance of NOMA is investigated by system-level simulations in order to provide insights into the suitability of using NOMA for uplink radio access. Key issues impacting NOMA performance are evaluated and analyzed, such as scheduling granularity, UE number and the combination with fractional frequency reuse (FFR). Simulation results verify the effectiveness of the proposed algorithms and show that NOMA is a promising radio access technology for 5G systems.

High frequency bands such as the 3-GHz band have received much attention as frequency resources for broadband mobile communication systems. Radio Frequency (RF) integrated antennas are considered to be useful as base station antennas in decreasing the feeding loss that is otherwise inevitable in high frequency bands and they ensure sufficient power for broadband transmission. One problem in actualizing RF integrated antennas is miniaturizing the duplexer, which is generally large, among the RF circuitry components. To downsize the duplexer, we consider separately locating the transmitter (Tx) and receiver (Rx) antennas. To suppress further the mutual coupling between the Tx and Rx antennas, we investigate a filter integrated antenna configuration. In this paper, we consider an aperture coupled patch antenna as the base antenna configuration and propose a new filter integrated antenna that comprises multiple rectangular elements installed between the coupling slot and radiation element of the Rx antenna. The simulation and measurement results confirm that the new antenna reduces the mutual coupling in the transmission frequency band up to 5.7 dB compared to the conventional slot coupled patch antenna configuration.

Coordinated multi-point (CoMP) transmission and reception is a promising technique for interference mitigation in cellular systems. The scheduling algorithm for CoMP has a significant impact on the network processing complexity and performance. Performing exhaustive search permits centralized scheduling and thus the optimal global solution; however, it incurs a high level of computational complexity and may be impractical or lead to high cost as well as network instability. In order to provide a more realistic scheduling method while balancing performance and complexity, we propose a low complexity centralized scheduling scheme that adaptively selects users for single-cell transmission or different CoMP scheme transmission to maximize the system weighted sum capacity. We evaluate the computational complexity and system-level simulation performance in this paper. Compared to the optimal scheduling method with exhaustive search, the proposed scheme has a much lower complexity level and achieves near optimal performance.

With the phenomenal explosion in online services, social networks are becoming an emerging ubiquitous platform for numerous services where service consumers require the selection of trustworthy service providers before invoking services with the help of other intermediate participants. Under this circumstance, evaluation of the trustworthiness of the service provider along the social trust paths from the service consumer to the service provider is required and to this end, selection of the optimal social trust path (OSTP) that can yield the most trustworthy evaluation result is a pre-requisite. OSTP selection with multiple quality of trust (QoT) constraints has been proven to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions cannot guarantee the search efficiency, that is, they have difficulty in avoiding suboptimal solutions during the search process. Quantum annealing uses delocalization and tunneling to avoid local minima without sacrificing execution time. Several recent studies have proven that it is a promising way to tackle many optimization problems. In this paper, we propose a novel quantum annealing based OSTP selection algorithm (QA_OSTP) for large-scale complex social networks. Experiments show that QA_OSTP has better performance than its heuristic counterparts.