While the problem of multicast routing and wavelength assignment (MC-RWA) in optical wavelength division multiplexing (WDM) networks has been investigated, relatively few researchers have considered network survivability for multicasting. This paper provides an optimization framework to solve the MC-RWA problem in a multi-fiber WDM network that can recover from a single-link failure with shared protection. Using the light-tree (LT) concept to support multicast sessions, we consider two protection strategies that try to reduce service disruptions after a link failure. The first strategy, called light-tree reconfiguration (LTR) protection, computes a new multicast LT for each session affected by the failure. The second strategy, called optical branch reconfiguration (OBR) protection, tries to restore a logical connection between two adjacent multicast members disconnected by the failure. To solve the MC-RWA problem optimally, we propose an integer linear programming (ILP) formulation that minimizes the total number of fibers required for both working and backup traffic. The ILP formulation takes into account joint routing of working and backup traffic, the wavelength continuity constraint, and the limited splitting degree of multicast-capable optical cross-connects (MC-OXCs). After showing some numerical results for optimal solutions, we propose heuristic algorithms that reduce the computational complexity and make the problem solvable for large networks. Numerical results suggest that the proposed heuristic yields efficient solutions compared to optimal solutions obtained from exact optimization.

In this paper, the issue of carrier frequency offset (CFO) compensation in interleaved orthogonal frequency division multiple access (OFDMA) uplink system is investigated. To mitigate the effect of multiple access interference (MAI) caused by CFOs of different users, a new parallel interference cancellation (PIC) compensation algorithm is proposed. This scheme uses minimum mean square error (MMSE) criterion to obtain the estimation of interference users, then circular convolutions are employed to restore MAI and compensate CFO. To tackle the complexity problem of circular convolutions, an efficient MAI restoration and cancellation method is developed. Simulations illustrate the good performance and low computational complexity of the proposed algorithm.

In conjunction with a first-order Taylor series approximation of the spatial scanning vector, this letter presents an iterative multiple signal classification (MUSIC) direction-of-arrival (DOA) estimation for code-division multiple access signals. This approach leads to a simple one-dimensional optimization problem to find each iterative optimal search grid. It can not only accurately estimate DOA, but also speed up the estimating process. Computer results demonstrate the effectiveness of the proposed algorithm.

In this paper, we study low complexity transceiver for double space time transmit diversity (DSTTD) and orthogonal frequency division multiplexing (OFDM) system with antenna shuffling. Firstly, we propose a novel antenna shuffling method based on the criterion of minimizing the condition number of channel correlation matrix. The condition number is an indicator about the quality of the channel. By selecting the minimum of condition number which has better channel quality, consequently, a linear detector with respect to this new channel may achieve better performance results. A low complexity variant of the condition number calculation is also proposed, and it is shown that this criterion can be reduced to the minimum mean square error (MMSE) based criterion. Furthermore, the weighted soft decision Viterbi decoding is applied to mitigate noise enhancement inherent to zero forcing (ZF) and MMSE linear receivers and improve error rate performance. Next, we propose an algorithm to reduce the amount of feedback by exploiting the fact that the channel frequency responses across OFDM subcarriers are correlated. In the proposed algorithm, subcarriers are clustered in blocks, which are allocated the same shuffling pattern with the largest number of the shuffling patterns in the cluster. This way, the signaling overhead can be reduced in comparison with each subcarrier based feedback. Extensive simulations show that the proposed techniques for DSTTD-OFDM system outperform other existing techniques under both uncorrelated and highly spatial correlated frequency selective MIMO fading channels.

In 1999, Gennaro, Halevi and Rabin proposed a signature which achieves provable security without assuming the random oracles, and it is the first RSA-type signature whose security is proved in the standard model. Since that time, several signatures have been proposed to achieve better efficiency or useful property along with the provable security in the standard model. In this paper, we construct a trapdoor hash function, and design an efficient online/offline signature by using the trapdoor hash function. Our signature scheme requires only one non-modular multiplication of two small integers for online signing, and it provides the fastest online signing among all online/offline signatures that achieve provable security in the standard model.

An ICI (Inter-Cell Interference) mitigation algorithm for exploiting macroscopic diversity for an up-link OFDMA (Orthogonal Frequency Division Multiple Access) system is proposed. To reduce the influence of carrier collision, the order of resource allocation is coordinated based on the location of each MS (Mobile Station) and the associated carrier group. This consideration significantly reduces ICI and enhances throughput at the boundary region.

Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the systematic encoding of GQC codes is equivalent to the division algorithm in the theory of Grobner basis of modules, there has been no algorithm that computes Grobner basis for all types of GQC codes. In this paper, we propose two algorithms to compute Grobner basis for GQC codes from their parity check matrices; we call them echelon canonical form algorithm and transpose algorithm. Both algorithms require sufficiently small number of finite-field operations with the order of the third power of code-length. Each algorithm has its own characteristic. The first algorithm is composed of elementary methods and is appropriate for low-rate codes. The second algorithm is based on a novel formula and has smaller computational complexity than the first one for high-rate codes with the number of orbits (cyclic parts) less than half of the code length. Moreover, we show that a serial-in serial-out encoder architecture for FG LDPC codes is composed of linear feedback shift registers with the size of the linear order of code-length; to encode a binary codeword of length n, it takes less than 2n adder and 2n memory elements.

In direct-conversion orthogonal frequency division multiplexing (OFDM) receivers, the impact of frequency-dependent I/Q mismatch (IQ-M) with carrier frequency offset (CFO) must be considered. A preamble-assisted estimation is developed to circumvent the frequency-dependent IQ-M with CFO. The results of a simulation and an experiment show that the proposed method could provide good estimation efficiency and enhance the system performance. Moreover, the proposed scheme is compatible with current wireless local area network standards.

Kalman filters are effective channel estimators but they have the drawback of having heavy calculations when filtering needs to be done in each sample for a large number of subcarriers. In our paper we obtain the steady-state Kalman gain to estimate the channel state by utilizing the characteristics of pilot subcarriers in OFDM, and thus a larger portion of the calculation burden can be eliminated. Steady-state value is calculated by transforming the vector Kalman filtering in to scalar domain by exploiting the filter charactertics when pilot subcarriers are used for channel estimation. Kalman filters operate optimally in the steady-state condition. Therefore by avoiding the convergence period of the Kalman gain, the proposed scheme is able to perform better than the conventional method. Also, driving noise variance of the channel is difficult to obtain practical situations and accurate knowledge is important for the proper operation of the Kalman filter. Therefore, we extend our scheme to operate in the absence of the knowledge of driving noise variance by utilizing received Signal-to-Noise Ratio (SNR). Simulation results show considerable estimator performance gain can be obtained compared to the conventional Kalman filter.

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.

One major drawback of orthogonal frequency-division multiplexing is the high peak-to-average power ratio (PAPR) of the output signal. The selected mapping (SLM) and partial transmit sequences (PTS) methods are two promising techniques for PAPR reduction. However, to generate a set of candidate signals, these techniques need a bank of inverse fast Fourier transforms (IFFT's) and thus require high computational complexity. In this paper, we propose two low-complexity multiplication-free conversion processes to replace the IFFT's in the SLM method, where each conversion process for an N-point IFFT involves only 3N complex additions. Using these proposed conversions, we develop several new SLM schemes and a combined SLM & PTS method, in which at least half of the IFFT blocks are reduced. Computer simulation results show that, compared to the conventional methods, these new schemes have approximately the same PAPR reduction performance under the same number of candidate signals for transmission selection.

In this paper, the performance of multiuser MIMO E-SDM systems in downlink transmission is evaluated in both uncorrelated and correlated time-varying fading environments. In the ideal case, using the block diagonalization scheme, inter-user interference can be completely eliminated at each user; and using the E-SDM technique for each user, optimal resource allocation can be achieved, and spatially orthogonal substreams can be obtained. Therefore, a combination of the block diagonalization scheme and the E-SDM technique applied to multiuser MIMO systems gives very good results. In realistic environments, however, due to the dynamic nature of the channel and processing delay at both the transmitter and the receiver, the channel change during the delay may cause inter-user interference even if the BD scheme is used. In addition, the change may also result in large inter-substream interference and prevent optimal resource allocation from being achieved. As a result, system performance may be degraded seriously. To overcome the problem, we propose a method of channel extrapolation to compensate for the channel change. Applying our proposed method, simulation results show that much better system performance can be obtained than the conventional case. Moreover, it also shows that the system performance in the correlated fading environments is much dependent on the antenna configuration and the angle spread from the base station to scatterers.

Vector Coding (VC) is a novel vector modulation scheme that partitions a SISO (Single-Input Single-Output) channel into orthogonal subchannels by singular value decomposition (SVD). Because the orthogonal transmissions enabled by VC cannot cope with inter block interference (IBI) that is inevitable in delay spread channels, this paper proposes an IBI cancelling demodulator which can remove IBI by an iterative technique. We also show that code elimination in which insignificant eigencodes with lowermost eigenvalues are intentionally removed from transmission vectors greatly reduces BER (Bit Error Rate). The VC which utilizes the IBI cancelling demodulator and code elimination to reduce BER is compared with the original VC in not only delay spread SISO channels but also delay spread MIMO (Multi-Input Multi-Output) channels while emphasis is placed on the MIMO cases. Simulation results show that, under a predetermined BER, the enhanced MIMO-VC can improve effective transmission rate than the natural extension of VC to delay spread MIMO channels.

Arrayed waveguide grating (AWG) is a promising technology for constructing high-speed large-capacity WDM switches, because it can switch fast, is scalable to large size and consumes little power. To take the full advantage of high-speed AWG, the routing control of a massive AWG-based switch should be as simple as possible. In this paper, we focus on the self-routing design of AWG-based switches with O(1) constant routing complexity and propose a novel construction of self-routing AWG switches that can guarantee the attractive nonblocking property for both the wavelength-to-wavelength and wavelength-to-fiber request models. We also fully analyze the proposed design in terms of its blocking property, hardware cost and crosstalk performance and compare it against traditional designs. It is expected that the proposed construction will be useful for the design and all-optical implementation of future ultra high-speed optical packet/burst switches.

Similar to orthogonal frequency-division multiplexing (OFDM) systems, orthogonal frequency-division multiple access (OFDMA) is vulnerable to carrier frequency offset (CFO). Since the CFO of each user is different, CFO compensation in OFDMA uplink is much more involved than that in OFDM systems. It has been shown that the zero-forcing (ZF) compensation method is a simple yet effective remedy; however, it requires the inversion of a large matrix and the computational complexity can be very high. Recently, we have developed a low-complexity iterative method to alleviate this problem. In this paper, we consider the theoretical aspect of the algorithm. We specifically analyze the output signal-to-interference-plus-noise-ratio (SINR) of the algorithm. Two approaches are used for the analysis; one is simple but approximated, and the other is complicated but exact. The convergence problem is also discussed. In addition to the analysis, we propose a pre-compensation (PC) method enhancing the performance of the algorithm. Simulations show that our analysis is accurate and the PC method is effective.

In this paper, we propose a subcarrier resource allocation algorithm for managing the video quality degradation for multiuser orthogonal frequency division multiplex (OFDM) systems. The proposed algorithm exploits the unequal importance existing in different picture types for video coding and the diversity of subcarriers for multiuser systems. A model-based performance metric is first derived considering the error concealment and error propagation properties of the H.264 video coding structure. Based on the information on video quality enhancement existing in a packet to be transmitted, we propose the distortion management algorithm for balancing the subcarriers and power usages for each user and minimizing the overall video quality degradation. In the simulation results, the proposed algorithm demonstrates a more gradual video quality degradation for different numbers of users compared with other resource allocation schemes.

An improved dual-band design method is presented for the 180coupler. It uses the non-uniform impedance ring structure for the arbitrary power division and a π-shaped branch for the dual-band operation The increased design freedom offered by the proposed structure helps to extend the useful dual-band operation range.

In this paper, the impacts of using multiple transmit antennas under doubly correlated MIMO channels on CDMA uplink code acquisition is studied. The performance of a MIMO code acquisition system is analyzed by considering spatial fading correlations, which depend on antenna spacing and azimuth spread at both MS and BS. The detection performance and mean acquisition time in the presence of spatially correlated MIMO channel are presented on a frequency selective fading channel and compared with the cases of spatial fading decorrelation via numerical evaluation. It is observed that the acquisition performance relies on the degree of spatial fading correlations. In addition, it is surprisingly seen that a MIMO code acquisition system provides worse performance than SIMO.

We present a novel frequency partitioning technique of fractional frequency reuse (FFR) that reduces the effect of co-channel interference and increases the capacity of OFDM systems. The usable sub-channel sets are classified into the common sub-channel sets for all cells and the dedicated sub-channel sets for specific cell types in FFR. The proposed fractional frequency reuse with ordering scheme (FFRO) can decrease the amount of interference in the common sub-channel sets by specially designing the sub-channel sets and the order of sub-channel assignment for specific cell types. Simulation results show that the proposed FFRO yields enhanced performance for both uniform and non-uniform distributions of traffic load.

In this letter, new families of binary low correlation zone (LCZ) sequences based on the interleaving technique and quadratic form sequences are constructed, which include the binary LCZ sequence set derived from Gordon-Mills-Welch (GMW) sequences. The constructed sequences have the property that, in a specified zone, the out-of-phase autocorrelation and cross-correlation values are all equal to -1. Due to this property, such sequences are suitable for quasi-synchronous code-division multiple access (QS-CDMA) systems.