In CDMA cellular systems, the frequency reuse factor equals one. Therefore, the soft-handoff technology with combining macroscopic diversity was introduced to enhance the link performance. In this work, a novel macroscopic diversity combining scheme is proposed to enhance the link performance of the forward-link. The basic concept of this scheme is to integrate error correction coding into the soft-handoff technology. According to the number of soft-handoff channels, the source information is encoded by a convolutional code with a lower code rate. The coded symbols are then equally distributed to all channels from different BSs to the MS, and each channel carries a disjointed set of coded symbols. For this proposed scheme, no extra transmission power or bandwidth is required. The only cost is a slight increase of the encoding and decoding complexity of the convolutional codes. Numerical and simulation results show that a performance gain of 1 dB in bit energy-to-total noise power density ratio can be obtained as compared with the conventional scheme in the same conditions.

This paper presents a numerical analysis of reverse link capacity by obtaining a closed form of ICI (InterCell Interference) over OFDM (Orthogonal Frequency Division Multiplexing)-based broadband wireless networks. In the analysis, shadowing factors are taken into account for determining the home BS (Base Station) of each MS (Mobile Station) over multicell environments. Under the consideration, a more accurate analysis of link capacity can be performed compared to Gilhousen's approximation. In the numerical results, it turns out that the actual interference is lower than Gilhousen's approximation with a decrease of around 20% in the interference.

We derived explicit formulas for evaluating the error vector magnitude (EVM) from the amplitude distortion (AM-AM) and phase distortion (AM-PM) of power amplifiers (PAs) in orthogonal frequency-division multiplexing (OFDM) systems, such as the IEEE 802.11a/g wireless local area networks (WLANs) standards. We demonstrated that the developed formulas allowed EVM simulation of a memoryless PA using only a single-tone response (i.e. without OFDM modulation and demodulation), thus enabling us to easily simulate the EVM using a harmonic-balance (HB) simulator. This HB simulation technique reduced the processing time required to simulate the EVM of a PA for the IEEE 802.11a standard by a factor of ten compared to a system-level (SL) simulation. We also demonstrated that the measured EVM of a PA module for the IEEE 802.11g could accurately be predicted by applying the measured static AM-AM and AM-PM characteristics to the derived formulas.

Multiple-input multiple-output (MIMO) systems using eigenbeam space division multiplexing (E-SDM) perform well and have increased capacities compared with those using conventional space division multiplexing (SDM). However, channel state information (CSI) is required at a transmitter, and the performance of E-SDM systems depends much on the accuracy of the CSI at a transmitter and a receiver. In time-varying fading environments, the channel change between the transmit weight determination time and the actual data transmission time causes the system performance to degrade. To compensate for the channel error, a linear extrapolation method has been proposed for a time division duplexing system. Unfortunately, the system performance still deteriorates as the maximum Doppler frequency increases. Here, two new techniques of channel extrapolation are proposed. One is second order extrapolation, and the other is exponential extrapolation. Also, we propose maximum Doppler frequency estimation methods for exponential extrapolation. Simulation results for 4tx 4rx MIMO systems showed that using the proposed techniques, E-SDM system performs better in a higher Doppler frequency region.

For broadband wireless networks based on OFDM (Orthogonal Frequency Division Multiplexing), an FRF (Frequency Reuse Factor) of 1 has been highly desirable for more improved channel throughput. However, due to the limited power budget of MSs (Mobile Stations) or the increase in ICI (Inter-Cell Interference), a required QoS (Quality of Service) may not be maintained. This paper addresses an optimal LCRTD (Loading Control based on Region-Time Division) over multi-cell environments for an efficient uplink QoS control. In the LCRTD scheme, a cell is divided into several regions by utilizing an optimization approach under QoS constraints, and users in each region are allowed to send their data at the allocated time slots. In the simulation, it is demonstrated that a decrease of 26% in the transmit power can be obtained.

In this paper, we propose a novel spatial filtering technique for orthogonal frequency division multiplexing (OFDM) signals called "VIrtual Subcarrier Assignment (VISA)." Here, virtual subcarrier is a subcarrier which is not used for data transmission. When a wireless terminal is equipped with multiple antennas, VISA can easily achieve a space division multiple access (SDMA) by assigning a different spectral position of virtual subcarrier to a different user. To realize VISA in an already-existing OFDM-based wireless local area network (WLAN), we discuss an antenna weight control method in the preamble of a signal burst format designed for the IEEE802.11a standard and evaluate the bit error rate (BER) performance in typical indoor wireless environments.

In this paper, a multiuser receiver based on a Gaussian Mixture Sigma Point Particle Filter (GMSPPF), which can be used for joint channel coefficient estimation and time delay tracking in CDMA communication systems, is introduced. The proposed algorithm has better improved estimation performance than either Extended Kalman Filter (EKF) or Particle Filter (PF). The Cramer-Rao Lower Bound (CRLB) is derived for the estimator, and the simulation result demonstrates that it is almost completely near-far resistant. For this reason, it is believed that the proposed estimator can replace well-known filters such as the EKF or PF.

We have developed a code-division-multiplexing (CDM) transmission scheme for future road-vehicle communication systems, which uses cyclic shifted-and-extended (CSE) codes generated from a basic code with superior auto-correlation characteristics. This paper proposes to use a Quasi-Orthogonal (QO) sequence as the basic code. Its auto-correlation values are zero except at zero and middle shifts. When the CDM transmission is performed by the CSE codes based on the QO sequence, a desired correlation value is, at a receiver, interfered by the auto-correlation value at middle shift. Therefore, an elimination technique for the interfered correlation value is proposed and realizes zero cross-correlation characteristics within the cyclical shift interval. The new CDM transmission scheme based on the proposed scheme is evaluated by computer simulations in terms of the bit-error-rate performance.

In this letter, a blind frequency offset estimation algorithm is proposed for OFDM systems. The proposed method exploits the intrinsic phase shift between neighboring samples in a single OFDM symbol, incurred by a frequency offset. The proposed algorithm minimizes a novel cost function, which is the squared error of the candidate frequency offset compensated signals from two different observation windows. Also, the solution of the proposed algorithm is given by an explicit equation, which does not require any iterative calculation. It is shown that the performance of the proposed method is better than those of the conventional methods, especially in the presence of multipath channels. This is due to the fact that the proposed method is insensitive to inter-symbol interference (ISI).

Designable task allocation systems which consist of identical agents using stochastic automata are suggested. From the viewpoint of the group response and the individual behavior, the performances of a simple model and an improved one are compared numerically. Robots experiments are performed to compare between the two models.

A hardware algorithm for integer division is proposed. It is based on the radix-2 non-restoring division algorithm. Fast computation is achieved by the use of the radix-2 signed-digit (SD2) representation. The algorithm does not require normalization of the divisor, and hence, does not require an area-consuming leading-one (or zero) detection nor shifts of variable-amount. Combinational (unfolded) implementation of the algorithm yields a regularly structured array divider, and sequential implementation yields compact dividers.

We introduce an extension of Golay complementary sequences in which, for each sequence, there exists another sequence such that the sum of aperiodic autocorrelation functions of these two sequences for a given multiple L-shift (L≥1) is zero except for the zero shift. We call these sequences multiple L-shift complementary sequences. It is well-known that the peak-to-average power ratio (PAPR) value of any Golay complementary sequence is less than or equal to 2. In this paper, we show that the PAPR of each multiple L-shift complementary sequence is less than or equal to 2L. We also discuss other properties of the sequences and consider their construction.

In this paper, given an integer e and n such that e|n, and a prime p, we propose a method of constructing optimal p2-ary low correlation zone (LCZ) sequence set with parameters (pn-1, pe-1, (pn -1)/(pe -1), 1) from a p-ary sequence of the same length with ideal autocorrelation. The resulting p2-ary LCZ sequence set can be viewed as the generalization of the optimal quaternary LCZ sequence set by Kim, Jang, No, and Chung in respect of the alphabet size. This generalization becomes possible due to a completely new proof comprising any prime p. Under this proof, the quaternary case can be considered as a specific example for p = 2.

We have been investigating an orthogonal frequency division multiple access (OFDMA) based cellular system that is called "dynamic parameter controlled orthogonal frequency and time division multiple access (DPC-OF/TDMA)" for the development of beyond third generation (B3G) mobile communication systems. Moreover, we have already proposed a time alignment control (TAC) to compensate propagation delays that induce a multiple-access interference (MAI) in the uplink OFDMA. However, that TAC includes a large amount of computations. This means that it is quite difficult for the OFDMA systems to implement TAC into volume-limited hardware devices such as field programmable gate array (FPGA). Thus, we propose a new complexity-reduced TAC (CRTAC) in this paper. CRTAC can be implemented into such devices easily. In this paper, we show some computer simulation results, and then evaluate the error rate performances of DPC-OF/TDMA employing CRTAC. Moreover, we also show the benefit of the reasonable level of the implementation complexity made by CRTAC.

It was previously shown that the number of array elements must exceed the number of sources for multiple target direction of arrival (DOA) tracking. This is clearly not practical for code-division multiple access (CDMA) communications since the number of mobile users is very large. To overcome the restriction, adaptive angle tracking approaches employing the code-matched filters and parallel Kalman/H∞ algorithms are presented in this paper. The proposed approaches are applied to the base station of a mobile communication system. Different from Kalman prediction algorithm which minimize the squared tracking error, the adaptive H∞ filtering algorithm is a worst case optimization. It minimizes the effect of the worst disturbances (including modeling error of direction matrix models and array structure imperfection, process noise, and measurement noise). Hence, the difficult problem of tracking the crossing mobiles can be successfully handled by using the code-matched filters. Computer simulation is provided for illustrating the effectiveness of the adaptive angle tracking approaches.

Antenna diversity is an effective technique for improving the transmission performance in a multi-path fading channel. Recently, transmit diversity has been attracting much attention since it can alleviate the complexity problem of the mobile terminals. Joint transmit diversity/receive diversity achieves a much improved transmission performance. In this paper, we propose a new space-time block coding algorithm for joint transmit/receive diversity, which requires the channel state information (CSI) only at the transmitter side. Unlike the conventional space-time transmit diversity (STTD), the space-time block coded joint transmit/receive diversity (STBC-JTRD) can use arbitrary number of transmit antennas, while the number of receive antennas is limited to 4. STBC-JTRD achieves a larger diversity gain than joint STTD/receive antenna diversity. The bit error rate (BER) analysis in a frequency-nonselective Rayleigh fading channel is presented. The BER performance is evaluated and is confirmed by the computer simulation.

This paper discusses a cyclic prefixed single carrier frequency-domain equalization (SC-FDE) scheme with two types of transmit diversity. Firstly, we propose a SC-FDE system with space-frequency block coding (SFBC). The transmit sequence of the proposed system is designed to have spatial and frequency diversities, which is equivalent to the SFBC. The corresponding combining receiver is derived under a minimum mean square error (MMSE) criterion. It is shown that the proposed system significantly outperforms the SC-FDE system with space-time block coding (STBC) over fast fading channels, while providing lower computational complexity than orthogonal frequency division multiplexing (OFDM) combined with SFBC. We verify the performance of two-branch transmit diversity systems including the proposed one through bit error rate (BER) analysis. Secondly, as a scheme that combines STBC and SFBC, a space-time-frequency block code (STFBC) SC-FDE system is presented. Computer simulation results show that the proposed STFBC SC-FDE system has better immunity to the distortion caused by both fast fading and severe frequency selective fading, compared to the SC-FDE system with the STBC or the SFBC scheme. Complexity analysis is also conducted to compare their computational loads of the transceiver. It is shown that the proposed STFBC SC-FDE system has lower computational complexity than the STFBC OFDM system.

Wavelength division multiplexing (WDM) technology offers the capability of building wide-area networks with high speed. Reconfigurability is a key feature of a WDM network that enables the network logical topology to change dynamically in response to the changing traffic patterns. There are two important issues involved in the reconfiguration of a network logical topology. One is how to determine the new logical topology corresponding to the current topology. It needs to consider a trade-off between the performance of the new target topology and the cost of the topology transition from the current topology to the new one. The other is how to determine the transition sequence from the current topology to the new one. It needs to control the disruption to the network as less as possible during the reconfiguration process. In this paper, we focus on the latter problem and propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to control the disruption to the network as less as possible during the reconfiguration process. For this purpose, a lightpath is taken as the minimum reconfiguration unit. The proposed algorithms are evaluated by using an NFSNET-like network model with 16 nodes and 25 links. The results show that very simple algorithms provide very small computational complexity but poor performance, i.e., large network disruption, and that an efficient algorithm provides reasonable computational complexity and very good performance. More complex algorithms may improve performance somewhat further but have unrealistically large computational complexity.

In this paper, ultra-wideband (UWB) multiple access systems are introduced by using direct-sequence (DS) and hybrid direct-sequence time-hopping (DS/TH) code division multiple access (CDMA) that use arbitrary chip-duty of the spreading sequences. The bit error probabilities are presented. First of all, the variances of the multiple access interference are developed by investigating the collision properties of the signals. Afterward, various approximations are applied. The standard Gaussian approximation (SGA) for the DS system is shown to become extremely optimistic as the chip-duty becomes low. Though the hybrid system performs better, the SGA still remains optimistic. To obtain accurate results, Holtzman's simplified improved Gaussian approximation (SIGA) and Morrow and Lehnert's improved Gaussian approximation (IGA) are used. A shortcoming of the SIGA is rediscovered that renders it unusable for low-duty DS systems, especially, at high signal-to-noise ratio. However, for the hybrid system, the SIGA works as an excellent tool. The IGA is used to get accurate results for the low-duty DS systems. It is shown that lowering of chip-duty by keeping chip rate and chip length unchanged improves performance for asynchronous DS and both asynchronous and synchronous hybrid systems. However, under the same processing gain, a high-duty system performs better than a low-duty system. Performance of synchronous DS system remains independent of chip-duty.

This paper presents a hybrid decimal division algorithm to improve division speed. The proposed hybrid algorithm employs either non-restoring or restoring algorithm on each digit to reduce iterative computations. The selection of the algorithm is based on the relative remainder values with respect to the half of its divisor. The proposed algorithm requires maximum 7n+4 add/subtract operations for an n-digit quotient, whereas other restoring or non-restoring schemes comprise more than 10n+1 operations.