The use of directional antenna and polarization diversity techniques has been reported to achieve good MIMO performance. Low-profile, small structures are required to configure the MIMO antenna with these techniques. First, we assume downlink transmission in indoor MIMO systems and present the design guidelines for the radiation pattern to obtain large channel capacity by the ray-tracing method. We then propose a uni-directional, dual-polarized MIMO antenna with a thickness of 0.24λ based on the design guidelines. The proposed antenna consists of dipole antennas mounted horizontally to the ground plane and cavity backed slot antennas for vertical polarization. We apply the proposed antenna to 2 2 MIMO transmission and demonstrate the effectiveness of channel capacity enhancement in an actual environment. The improvement factor is revealed to be +16.2% with place averaged value compared to sleeve antenna configuration.

In this paper, we propose an exact analytical technique to evaluate the average capacity of a dual-hop OFDM relay system with decode-and-forward protocol in an independent and identical distribution (i.i.d.) Rayleigh fading channel. Four schemes, (no) matching "and" or "or" (no) power allocation, will be considered. First, the probability density function (pdf) for the end-to-end power channel gain for each scheme is described. Then, based on these pdf functions, we will give the expressions of the average capacity. Monte Carlo simulation results will be shown to confirm the analytical results for both the pdf functions and average capacities.

This paper proposes two novel frame resource allocation schemes: Mixed bidirectional allocation scheme and Offset allocation scheme. They improve system capacity and latency performance unlike the conventional time-division duplex relay scheme which divides the frame structure into time segments for the access zone and time segment for the relay zones as in IEEE802.16j (WiMAX) systems. Computer simulations confirm that the two proposed schemes outperform the conventional schemes in terms of throughput and latency. An evaluation of the offset allocation scheme confirms that it improves the total throughput by about 85%, and reduces latency by about 72%, compared to the conventional schemes.

The mobility control of mobile nodes can be an alternative to the transmitting power adjustment in case that fixed transmitting power is just used in the topology control. Assuming the controllable mobility of nodes, we propose four distributed mobility control algorithms assuring the network connectivity and the capacity improvement. We compare the throughput of each algorithm with the widely accepted capacity scale law considering the energy consumption. The proposed mobility-based topology control algorithms are named according to its operational characteristics; RP (Rendezvous Point), NNT (Nearest Neighbor Tracking), DM (Diffusion Model), and GP (Grid Packing). Through extensive simulations, we show that all the proposed algorithms successfully change a partitioned random network topology into a connected network topology without the power control. Furthermore, the topology reconfigured by the mobility control has the improved network capacity beyond that of the initial network. In the newly defined performance metric, effective capacity, the simulation results show that GP provides more improved and stable performance over various node densities with the short completion time.

In this letter, a new exact expression of the ergodic channel capacity for a Rician fading channel is provided that is written in terms of exponential integral and incomplete gamma function. Also, a good approximation of the Rician fading channel capacity is derived from the exact expression and its accuracy is numerically verified.

Employing fractional frequency reuse (FFR) in OFDMA cellular systems is very attractive since it offers large capacity and single cell frequency reuse. However, its performance in practical environments, e.g. scheduling and arbitrary cell configurations, has not been well revealed. This paper analyzes the theoretical capacity and outage rate of an OFDMA cellular system employing FFR. Numerical examples show that FFR achieves higher capacity than the non-FFR equivalent when the outage rate is low.

In this paper, the exact distribution of the channel capacity of MISO (multiple-input single-output) systems subject to co-channel interference is derived from an information theoretic viewpoint. It is found that the MISO channel capacity in the interference-limited channel follows the F-distribution. By using these capacity distributions, the outage capacity in Rayleigh fading channels can be accurately computed. We confirm the accuracy of our analysis by performing simulations. Our results exactly match those of the empirical simulations of interference-limited systems.

This paper analyzes the ergodic capacity of the MIMO multi-keyhole channel, assuming that the channel state information (CSI) is available only at the receiver. We first derive new closed-form expressions for marginal probability density function (pdf) of the single unordered eigenvalue as well as joint pdf of ordered eigenvalues of the channel matrix in a simple and general framework. With these statistical results, we then present an exact closed-form expression for the ergodic capacity. We analyze tight bounds on the exact capacity and propose a new tight lower bound. We also investigate the asymptotic capacity performances in low-signal-to-noise-ratio (SNR) and high-SNR regimes to gain further insights. All our results apply for arbitrary number of keyholes and antennas. Numerical simulations are presented to validate our theoretical analysis.

A simple closed-form approximation for the outage capacity of Transmit Antenna Selection/Maximal-Ratio Combining (TAS/MRC) systems over independent and identically distributed (i.i.d) Nakagami-m fading channels is derived while the fading index is a positive integer. When the Nakagami-m fading index is not an integer, the approximate outage capacity is derived as a single infinite series of Gamma function. Computer simulations verify the accuracy of the approximate results.

Since traffic in IP access networks is less aggregated than in backbone networks, its variance could be significant and its distribution may be long-tailed rather than Gaussian in nature. Such characteristics make it difficult to forecast traffic volume in IP access networks for appropriate capacity planning. This paper proposes a traffic forecasting method that includes a function to control residual error distribution in IP access networks. The objective of the proposed method is to grasp the statistical characteristics of peak traffic variations, while conventional methods focus on average rather than peak values. In the proposed method, a neural network model is built recursively while weighting residual errors around the peaks. This enables network operators to control the trade-off between underestimation and overestimation errors according to their planning policy. Evaluation with a total of 136 daily traffic volume data sequences measured in actual IP access networks demonstrates the performance of the proposed method.

Recently proposed coded bi-directional relaying protocols increase the spectral efficiency by using network codes, which rely on joint packet encoding and exploitation of previously transmitted and stored information. In this letter, we derive the cumulative density function (CDF) and the probability density function (PDF) of received signal-to-noise ratios (SNRs) for two-phase and three-phase bi-directional coded relaying protocols, respectively, over Rayleigh fading channels. Using these results, we compare the outage performances as well as the average capacities of the protocols. From the numerical observations, we can see that the two-phase protocol has better link-level performances than the three-phase protocol when required data rate is greater than 2 for outate performance and transmit SNR at each node is greater than 18 dB for average capacity, respectively. Otherwise, the three-phase protocol performs better.

Multiple-input-multiple-output (MIMO) wireless systems can not always have full spatial multiplexing gain due to the channel correlation problem caused by various factors such as the coupled antenna elements, and the key-hole effect of the propagation environment. In this paper, we proposed a channel reconfiguration technique to combat the rank deficiency problem of the involved MIMO wireless channels that can not afford high-order multiplexing gains. In the proposed approach, each mobile station can simultaneously receive several independent data streams from multiple base stations through a set of MMSE-based receive beamformers to suppress the multiple access interferences. Making use of the receive beamforming, which virtually produce the effect of a single antenna at each receive mobile, makes the transmit base station possible to reconfigure the MIMO downlink channel and then pre-cancel the co-channel interferences. The proposed signal processing mechanism that iteratively optimized the MMSE receive weights and the transmit precoders, which brings the reconfigured MIMO system about the high data throughput seen only with indoor MIMO systems having rich wireless channels. It is shown that as compared to the conventional MIMO system, the M4 system can achieve a significantly higher capacity which is proportional to the number of the linked base stations.

Multiuser -- Multiple Input Multiple Output (MU-MIMO) techniques were proposed to increase spectrum efficiency; a key assumption was that the Mobile Terminals (MTs) were simple with only a few antennas. This paper focuses on the Block Diagonalization algorithm (BD) based on the equal power allocation strategy as a practical MU-MIMO technique. When there are many MTs inside the service area of the access point (AP), the AP must determine, at each time slot, the subset of the MTs to be spatially multiplexed. Since the transmission performance depends on the subsets of MTs, the user selection method needs to use the Channel State Information (CSI) obtained in the physical layer to maximize the Achievable Transmission Rate (ATR). In this paper, we clarify the relationship between ATR with SU-MIMO and that with MU-MIMO in a high eigenvalue channel. Based on the derived relationship, we propose a new measure for user selection. The new measure, the eigenvalue decay factor, represents the degradation of the eigenvalues in null space compared to those in SU-MIMO; it is obtained from the signal space vectors of the MTs. A user selection method based on the proposed measure identifies the combination of MTs that yields the highest ATR; our approach also reduces the computational load of user selection. We evaluate the effectiveness of user selection with the new measure using numerical formulations and computer simulations.

A coordinate plane representation of the resource requirements of digital modulation methods is presented, and an overall resource efficiency measure is proposed. This measure can be used for the comparison of digital modulation methods and the evaluation of an emerging modulation technique. Several typical digital modulation methods are compared based on this measure to show its validity.

A spectrum sharing method is proposed for systems that share the same frequency band or adjacent bands with services that have different priorities. The proposed method adaptively controls transmission power according to information provided by the high-priority system receivers. We give the theoretical capacities achieved by low-priority systems when the proposed method and a conventional method (constant transmit power) are applied. Numerical results confirm that the proposed method attains 1.5-2 times larger capacity than the conventional method.

Threshold-based ordered successive interference cancellation (OSIC) detection algorithm is proposed for per-antenna-coded (PAC) two-input multiple-output (TIMO) orthogonal frequency division multiplexing (OFDM) systems. Successive interference cancellation (SIC) is performed selectively according to channel conditions. Compared with the conventional OSIC algorithm, the proposed algorithm reduces the complexity significantly with only a slight performance degradation.

This letter focuses on the simplified capacity evaluation for the downlink of a distributed antenna system (DAS) with random antenna layout. Based on system scale-up, we derive a good approximation of the downlink capacity by developing the results from random matrix theory. We also propose an iterative method to calculate the unknown parameters in the approximated expression of the downlink capacity. The approximation is illustrated to be quite accurate and the iterative method is shown to be quite efficient by Monte Carlo simulations.

We address the problem of multiuser co-channel interference scheduling in multicell interference-limited networks. Our target is to optimize the network capacity under the SIR-balanced power control policy. Since it's difficult to optimize the original problem, we derive a new problem which maximizes the lower bound of the network capacity. Based on the analysis of this new problem, we propose an interference matched scheduling algorithm. This algorithm considers the caused co-channel interference and the channel conditions to schedule the "matched" users at the same time. We prove that this interference matched scheduling algorithm optimizes the lower bound of the network capacity for any arbitrary numbers of cells and users. Moreover, this scheduling method is low-complexity and can be implemented in a fully distributed fashion. Simulation results reveal that the performance of the proposed algorithm achieves near optimal capacity, even though it does not optimize the network capacity directly. Finally, the proposed algorithm holds a great gain over formerly proposed round robin and power matched scheduling method, especially when the scale of the network is large.

In this letter we investigate the relaying strategies for multihop transmission in wireless networks over Rayleigh fading channels. Theoretical analysis reveals that equally allocating power among all transmitters and placing relays equidistantly on the line between source and destination are optimal in terms of outage capacity. Then equal time duration for the transmission of each hop is also proved to be optimal. Furthermore, the optimum number of hops is also derived and shown to be inversely proportional to the signal-to-noise ratio (SNR). Numerical simulations agree well with the reported theoretical results.

As the demand for reliable high speed data transmission increases, the capacity of downlink cellular multiple-input multiple-output (MIMO) systems is of much interest. Unfortunately, the capacity analysis regarding the frequency reuse factor (FRF) is rarely reported. In this paper, theoretical analyses for both ergodic and outage capacities for cellular MIMO systems are presented. The FRF is considered and a hybrid frequency reuse scheme is proposed. It is shown by the numerical results that the proposed scheme can greatly alleviate the coverage problem of single-frequency-reuse cellular systems.