Recently, a versatile user cooperation method called coded cooperation diversity has been introduced, in which the codewords of each mobile are partitioned and transmitted through independent fading channels instead of simple repetition relay, to achieve remarkable gains over a conventional (non-cooperation) system, while maintaining the same information rate and transmission power. In this paper we present an adaptive space-time (AST) coded cooperation scheme based on the decoding operation on the first partition of the codeword at the base station and enables practical adaptive arrangement of resources to adopt the channel condition. Performance analysis and simulation results have proved that the proposed scheme greatly improves error rate performance and system throughput, compared with the previous framework.

In this paper a new method for the design and optimization of microstrip parallel coupled-line bandpass filters is presented which allows for the specification of frequency bandwidths and arbitrary source and load impedance transformation. The even- and odd-mode theory and the relationships between impedance, transmission and scattering matrices and their properties are used to construct a positive definite error function using the insertion losses at discrete frequencies in the pass, transition and stop bands. The dispersion relations for the coupled line are also taken into account. The minimization of the error function determines the widths, gap spacings and lengths of the coupled-line filter, for the optimum design and realization of filter specifications. The proposed filter design and optimization method is coded by computer programs and the results of simulation, fabrication and testing of sample filters together with comparisons with available full-wave analysis softwares, indicate the efficacy of the proposed method. Filter design with up to 50% bandwidth and the design of shorter lengths of coupled line sections are achievable by the proposed method in part due to the incorporation of impedance matching.

In this paper, we propose a high speed Preamble Searcher suitable for the RACH (Random Access Channel) structure in WCDMA reverse link receivers. Unlike IS-95, WCDMA system uses the AISMA (Acquisition Indication Sense Multiple Access) scheme. Because of the time limit between RACH preamble transmission and AI (Acquisition Indicators), and the restriction on the number of RACH signatures assigned to RACH preamble, fast acquisition is required for efficient operation. The Preamble Searcher proposed in this paper is designed for 2-antenna systems; it adopts the FHT (Fast Hadamard Transform) algorithm that has the radix-2 16 point FFT (Fast Fourier Transform) structure. The acquisition speed using FHT is 32 times faster than the conventional method that correlates each signature. Based on this fast acquisition scheme, we improved the acquisition performance by calculating correlation up to 4096 chips of the total preamble length.

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.

We propose a scheme by which Broadcast Satellite/Communication Satellite- radio frequency (BS/CS-RF) converted TV signals are transmitted over optical fiber, and also propose a simultaneous Frequency Modulation (FM) converted CATV and BS/CS-RF converted TV optical transmission system as one of its applications. To confirm the proposals, we demonstrate the simultaneous transport of FM converted CATV signals and BS/CS-RF converted TV signals over a single optical fiber. In the experiments, 40 carriers of AM-VSB CATV channels, 30 carriers of 64-QAM digital TV channels, 8 carriers of FM/TC8PSK BS-TV channels, and 12 carriers of QPSK CS-TV channels are simultaneously transmitted. For optical access network application, the practical transmission length of 15 km over 1.3 µm-zero-dispersion optical fiber can be achieved by using dispersion compensation fiber (DCF).

This paper introduces the design of an Optical Switching Module (OSM) for our newly proposed Gigabit Ethernet Optical Switched Access Network (GE-OSAN) architecture that uses the Multi-Point Control Protocol (MPCP), defined in IEEE 802.3ah. We outline the GE-OSAN architecture to clarify OSM's role in the network. We offer an OSM configuration that has the basic functions needed to realize downstream and upstream high-speed data services in GE-OSAN. We clarify the OSM optical switching time that allows GE-OSAN to achieve the same throughput as GE-PON. Our survey of currently available optical switches identifies the optical packet switches that can meet this switching time requirement. We evaluate OSM insertion loss with these switches. We propose an OSM configuration that has a regeneration function as well as the basic ones to realize wider network configurations that can lead to a reduction in overall system costs. In addition, we present OSM configurations that have broadcast and multicast functions as well as the basic ones so that GE-OSAN can support broadcast and multicast video services to equal and exceed GE-PON.

Emerging GMPLS (Generalized Multi-Protocol Label Switching)-based photonic networks are expected to realize the dynamic allocation of network resources for a wide range of applications, such as carriers' backbone networks as well as enterprise core networks and GRID computing. To address diverse reliability requirements corresponding to different application needs, photonic networks have to support various optical path recovery schemes. Thus GMPLS standardization bodies have developed failure recovery protocols for 1+1 protection, 1:N protection and restoration, with support of extra traffic and shared use of back-up resources. Whereas the standardization efforts cover a full spectrum of recovery schemes, there have not been many reports on actual implementations of such functionalities, and none of them included extra traffic. This paper introduces an OXC (Optical Cross Connect) implementation of GMPLS's failure recovery functionalities supporting 1+1 protection, M:N protection and extra path. Here extra path is an extension of GMPLS protection's extra traffic which can partially reuse protected paths' back-up resources. Evaluation of the implementation confirms rapid recovery of protected traffic upon a failure, even when preemption of an extra path is involved. It is also shown that its preemption scheme can resolve the issue of the poor scalability of GMPLS-based preemption when multiple extra paths are preempted upon a failure.

In this paper, we present a scheduler that incorporates round robin service within a VirtualClock discipline. Time-stamp based scheduling algorithms attain a low local delay bound and performance guarantee, but are computationally complex. On the other hand, round robin schemes are simple to implement and have computational complexity of O(1), but they are well known for their output burstiness and short-term unfairness. In order to overcome this problem, we combine round robin with VirtualClock in an algorithm we call VCRR. VCRR possesses better fairness than simple round robin, low jitter and a good scheduling delay bound. At the same time, VCRR preserves the O(1) time complexity of round robin. Simulation experiments show VCRR's efficiency in terms of delay performance, jitter and fairness.

This paper proposes a network design scheme for Virtual Private Network (VPN) services. Traditionally, network design to compute required amount of resource is based on static point-to-point resource demand. This scheme is effective for traditional private line services. However, since VPN services allow multi-site connectivity for customers, it may not be appropriate to design a network based on static point-to-point resource demand. In particular, this scheme is not effective when the traffic pattern changes over time. Therefore, network design for VPN services introduces a new challenge in order to comply with traffic flexibility. There are conventional studies tackling this issue. In those studies, by defining a resource demand model considering flexibility, and designing the network based on this model, amount of resource required can be computed. However, there are some deficiencies in those studies. This paper proposes a new network design scheme, consisting of two components. The first one is a new resource demand model, created by extending conventional resource demand models, that can specify resource demand more precisely. The second one is a new network design algorithm for this resource demand model. Simulations are conducted to evaluate the performance of the proposed network design scheme, and the results show significant performance improvement against conventional schemes. In addition, deployment considerations of the proposed scheme are analyzed.

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.

The Erlang capacity of multi-service multi-access systems supporting several different radio access technologies was analyzed and compared according to two different operation methods: the separate and common operation methods, by simultaneously considering the link capacity limit per sector as well as channel element (CE) limit in a base station (BS). In a numerical example with GSM-like and WCDMA-like sub-systems, it is shown that we can get up to 60% Erlang capacity improvement through the common operation method using a near optimum so-called service-based user assignment scheme when there is no CE limit in BS. Even with the worst-case assignment scheme, we can still get about 15% capacity improvement over the separate operation method. However, a limited number of CEs in BS reduces the capacity gains of multi-service multi-access systems in both the common operation and separate operation. In order to fully extract the Erlang capacity of multi-service multi-access systems, an efficient method is needed in order to select a proper number of CE in BS while minimizing the equipment cost.

This paper presents a linear constrained minimum variance multiuser detection (MUD) scheme for DS-CDMA systems, which makes full use of the available spreading sequences of the users as well as the relevant channel information of the incoming rays in the construction of the constraint matrix. To further enhance the performance, a statistical optimum filter bank in combination with the developed minimum variance MUD with the partitioned linear interference canceller (PLIC) as the underlying structure is also addressed. The determination of the filter bank coefficients, however, calls for computationally demanding nonlinear programming. To alleviate the computational overhead, an iterative procedure is also proposed, which solves the Rayleigh quotient in each iteration. Furthermore, the expressions of the output signal to interference plus noise ratio (SINR) are also determined to provide further insights into the proposed approach. Conducted simulations validate the new scheme.

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.

Outdoor wireless services quality is greatly tarnished by the existence of coverage blind spots or any areas of inadequate reception. It is thus of interest to eliminate or fill in the blind spots in order to boost the receiving signal strength which ultimately leads to better service quality. The authors propose the use of a simple flat metallic reflector as a device to divert some energy in the service coverage towards the blind spots or any existing areas of inadequate reception. The method of moment is employed in analysing the effectiveness of the authors' proposed technique. Experiments have been carried out to verify calculation results as well as to find out on the proposed technique's viability. It is found that the elimination of blind spots by using a reflector is a viable approach. The received power at the blind spot locations are increased by about 3 dB to 5 dB when the reflector is present.

This letter presents an extended Pawula F-function for computing the error rate of generalized M-ary phase shift keying (MPSK) system in the presence of phase error, quadrature error, and I-Q gain mismatch over additive white Gaussian noise (AWGN) and fading channels. The extended Pawula F-function conditioned on an instantaneous fading carrier-to-noise ratio (CNR) is derived in the form of the Craig representation.

Active Queue Management (AQM) based on nonlinear difference equations is proposed to solve the end-to-end TCP network congestion problem. The proposed AQM scheme can guarantee the stability of the multiple bottleneck network by nonlinear control of dropping probability of the routers by imposing some restrictions on the AQM parameter. Nonlinear control often relies on some heuristics and network traffic controllers that appear to be highly correlated with the multiple bottleneck network status. Based on the proposed nonlinear difference equations for TCP flows control across the network, this paper reveals the reasons of congestion of multiple bottleneck AQM, and provides a theorem for avoiding network congestion. Moreover, we give simulations to verify the results for nonlinear control of the multiple bottleneck network congestion.

A multiple-places reservation discipline is studied in a discrete-time priority queueing system. We obtain the joint distribution of system state, from which the delays of high and low priority packets are derived. Comparison is made with the cases of FIFO, single-place reservation discipline and HOL priority.

A new Kalman carrier synchronization algorithm is developed for high-order QAM transmission to reduce complexity compared to the conventional Kalman approach. The state model in the proposed algorithm employs only phase, instead of both phase and frequency, as in the conventional method. A reduced-observation model is also introduced to eliminate matrix operations in the Kalman recursions. Simulations results show that the one-state Kalman algorithm has better performance and lower complexity than the two-state Kalman algorithm. The cable modem downstream system is applied to demonstrate the effectiveness of the proposed algorithm.

Combined input-crosspoint buffered (CICB) packet switches have been of research interest in the last few years because of their high performance. These switches provide higher performance than input-buffered (IB) packet switches while requiring the crosspoint buffers run at the same speed as that of the input buffers in IB switches. Recently, it has been shown that CICB switches with one-cell crosspoint buffers, virtual output queues, and simple input and output arbitrations, provide 100% throughput under uniform traffic. However, it is of general interest to know the maximum throughput that a CICB switch, with no speedup, can provide under admissible traffic. This paper analyzes the throughput performance of a CICB switch beyond uniform traffic patterns and shows that a CICB switch with one-cell crosspoint buffers can provide 100% throughput under admissible traffic while using no speedup.

When designing the route metrics for wireless mesh networks, we can improve network capacity by considering the traffic load, the link loss rate, and the medium contention. In this letter, we propose as the route metrics for wireless mesh networks the number of contention nodes that reflects both the traffic load and the medium contention as well as the aggregated traffic bandwidth that reflects the traffic load. To the best of our knowledge, no studies to date have compared the performances of route metrics with different features in the wireless mesh network. We therefore compared the performances of the proposed route metrics and the existing route metrics of the hop count and the expected transmission count to reflect the link loss rate. Simulation results show that the proposed route metrics perform better than the existing route metrics.

Several active queue management schemes have been proposed to provide fairness among flows. In particular, BLACK has the best performance among them with respect to simplicity and fairness. However, it can provoke the UDP throughput to fluctuate and worsen the fairness. In this paper, we propose a new active queue management scheme to modify BLACK for better performance. Simulation results illustrate that the performance of our proposal is better than that of BLACK in terms of the fairness and the smooth UDP throughput.

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).

This letter proposed a linear precoding scheme for the V-BLAST system that requires only knowledge of the statistical CSI; the transmitter does not need the instantaneous CSI. Power allocation on the eigenmodes of the transmit correlation matrix is one way to minimize bit error rate (BER). Simulation results show that the proposed precoding V-BLAST system provides a significant reduction in the BER compared with the conventional V-BLAST systems.

A powerful HARQ-based linear precoding scheme is proposed to utilize the flexibility of post-combining HARQ strategy in MIMO communications systems. The scheme selects the appropriate symbols and transmit powers for each eigen-mode to acquire more performance gains. Simulation results show that the proposed scheme achieves about 5.5 dB signal-to-noise ratio gains over original spatial multiplexing scheme at an average bit error rate of 10^-4. Furthermore, the gap between the two schemes increases with the number of transmissions.

It is well known that the diversity gain attained by DCA (Dynamic Channel Allocation) is generally very high over OFDM (Orthogonal Frequency Division Multiplexing)-based broadband networks. This paper introduces a numerical approach for measuring the performance gain afforded by DCA. In the mathematical analysis, the property of order statistics is adopted to derive the upper bound of the expected throughput via the use of DCA. In the simulation, it was possible to achieve a gain of 5 dB by exploiting multi-user and spectral diversities when the number of users is 16 and the total number of subcarriers is 256.

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.

Cooperative diversity represents an effective way of combating multipath fading through inter-terminal cooperation in wireless networks. In this letter, we propose a new participation strategy that increases the chance of cooperation and present the closed-form expression for outage probability. Numerical results demonstrate that new participation strategy improves the outage performance.

In this paper, the relationship between correlation interval (CI) and estimate is investigated. Then a special correlation interval is explored that is adaptive to all levels of signal-to-noise ratio (SNR) and velocity conditions, and the mean square error is deduced. Finally, we propose an iterative algorithm that achieves the special correlation interval and calculates the Doppler spread by increasing the resolution on time-domain iteratively. Simulation results show that compared with conventional schemes, performance of the proposed algorithm is basically independent of velocity variation and less sensitive to SNR, especially in low SNR environments. It achieves high accurate estimation directly without any post-rectification.

This letter proposes a novel geographic channel assignment (GCA) framework for dynamic channel allocation (DCA) in broadband wireless access networks (BWANs). The proposed GCA scheme is based on the characteristics of radio propagation, which focuses on the relationship between transmission distances and communication parameters, e.g., signal-to-noise ratio (SNR) etc., and uses a signal-aware distance estimation scheme to determinate an appropriate channel for communication. This method significantly increases the capacity of the BWA system. Simulation results show that the GCA framework can yield approximate two times throughput of the IEEE 802.16 standard specifications as well as obtain significantly lower call blocking probability compared with classical channel assignment methods.