Optical Code Division Multiplexing (OCDM) is a multiplexing technology for constructing future all-optical networks. Compared with other multiplexing technologies, it can be easily controlled and can establish lightpaths of smaller granularity. However, previous research has revealed that OCDM networks are vulnerable to cycle attacks. Cycle attacks are caused by multi-access interference (MAI), which is crosstalk noise on the same wavelength in OCDM networks. If cycle attacks occur, they disrupt all network services immediately. Previous research has proposed a logical topology design that is free of cycle attacks. However, this design assumes that path assignment is centrally controlled. It also does not consider the delay between each node and the centralized controller. In this paper, we propose novel logical topology designs that are free of cycle attacks and methods of establishing paths. The basic concepts underlying our methods are to autonomously construct a cycle-attack-free logical topology and to establish lightpaths by using a distributed controller. Our methods can construct a logical network and establish lightpaths more easily than the previous method can. In addition, they have network scalability because of their distributed control. Simulation results show that our methods have lower loss probabilities than the previous method and better mean hop counts than the centralized control approach.

In this paper, a direct/cooperative relay switched single carrier-frequency division multiple access (SC-FDMA) using amplify-and-forward (AF) protocol and spectrum division/adaptive subcarrier allocation (SDASA) is proposed. Using SDASA, the transmit SC signal spectrum is divided into sub-blocks, to each of which a different set of subcarriers (resource block) is adaptively allocated according to the channel conditions of mobile terminal (MT)-relay station (RS) link, RS-base station (BS) link, and MT-BS link. Cooperative relay does not always provide higher capacity than the direct communication. Switching between direct communication and cooperative relay is done depending on the channel conditions of MT-RS, RS-BS, and MT-BS links. We evaluate the achievable channel capacity by the Monte-Carlo numerical computation method. It is shown that the proposed scheme can reduce the transmit power by about 6.0 (2.0) dB compared to the direct communication (the cooperative AF relay) for a 1%-outage capacity of 3.0 bps/Hz.

Time domain synchronous orthogonal frequency division multiplexing (TDS-OFDM) has higher spectral efficiency than the standard cyclic prefix OFDM (CP-OFDM) OFDM by replacing the random CP with the known training sequence (TS), which could be also used for synchronization and channel estimation. However, TDS-OFDM requires suffers from performance loss over fading channels due to the iterative interference cancellation has to be used to remove the mutual interferences between the TS and the useful data. To solve this problem, the novel TS based OFDM transmission scheme, referred to as the unified time-frequency OFDM (UTF-OFDM), is proposed in which the time-domain TS and the frequency-domain pilots are carefully designed to naturally avoid the interference from the TS to the data without any reconstruction. The proposed UTF-OFDM based flexible frame structure supports effective channel estimation and reliable channel equalization, while imposing a significantly lower complexity than the TDS-OFDM system at the cost of a slightly reduced spectral efficiency. Simulation results demonstrate that the proposed UTF-OFDM substantially outperforms the existing TDS-OFDM, in terms of the system's achievable bit error rate.

In this letter, we prove that for fading multiuser orthogonal frequency division multiplexing networks, a simple fixed rate scheduling scheme with only 1 bit channel state information feedback is capable of achieving the optimal performance in the wideband limit. This result indicates that the complexities of both the feedback and channel coding schemes can be reduced with nearly no system performance penalty in wideband wireless communication environments.

This paper describes mobile backhaul optical access network designs for future cellular systems, in particular, for those systems that exploit coordinated multipoints (CoMP) transmission/reception techniques. Wavelength-division-multiplexing passive optical networks (WDM-PON) are primarily considered and two proposals to enhance mobile backhaul capability of WDM-PONs for CoMP are presented. One is physical X2 links that support dedicated low latency and high capacity data exchange between base stations (BSs). The other is multicasting in WDM-PONs. It effectively reduces data/control transmission time from central node to multiple BSs joining CoMP. Evaluation results verify that the proposed X2 links and the multicasting enable more BSs to join CoMP by enhancing the mobile backhaul capability, which results in improved service quality for users.

In this paper, an extended best linear unbiased estimator (EBLUE) based on a periodic training sequence is proposed and investigated for frequency offset estimation in orthogonal frequency division multiplexing (OFDM) systems. The structure of EBLUE is general and flexible so it adapts to different complexity constraints, and is attractive in practical implementation. Performance analysis and design strategy of EBLUE are provided to realize the best tradeoff between performance and complexity. Moreover, closed-form results of both weight and performance make EBLUE even more attractive in practical implementation. Both the performance and complexity of EBLUE are compared with other proposals and the Cramer-Rao lower bound (CRLB) to demonstrate the merit of EBLUE.

The broadcast scheduling problem (BSP) in wireless ad-hoc networks is a well-known NP-complete combinatorial optimization problem. The BSP aims at finding a transmission schedule whose time slots are collision free in a wireless ad-hoc network with time-division multiple access (TDMA). The transmission schedule is optimized for minimizing the frame length of the node transmissions and maximizing the utilization of the shared channel. Recently, many metaheuristics can optimally solve smaller problem instances of the BSP. However, for complex problem instances, the computation of metaheuristics can be quite time and memory consuming. In this work, we propose a greedy genetic algorithm for solving the BSP with a large number of nodes. We present three heuristic genetic operators, including a greedy crossover and two greedy mutation operators, to optimize both objectives of the BSP. These heuristic genetic operators can generate good solutions. Our experiments use both benchmark data sets and randomly generated problem instances. The experimental results show that our genetic algorithm is effective in solving the BSP problem instances of large-scale networks with 2,500 nodes.

The cooperative orthogonal frequency-division multiplexing (OFDM) relaying system is widely regarded as a key design for future broadband mobile cellular systems. This paper focuses on channel estimation in such a system that uses amplify-and-forward (AF) as the relaying strategy. In the cooperative AF relaying, the destination requires the individual (disintegrated) channel state information (CSI) of the source-relay (S-R) and relay-destination (R-D) links for optimum combination of the signals received from source and relay. Traditionally, the disintegrated CSIs are obtained with two channel estimators: one at the relay and the other at the destination. That is, the CSI of the S-R link is estimated at relay and passed to destination, and the CSI of the R-D link is estimated at destination with the help of pilot symbols transmitted by relay. In this paper, a new disintegrated channel estimator is proposed; based on an expectation-maximization (EM) algorithm, the disintegrated CSIs can be estimated solely by the estimator at destination. Therefore, the new method requires neither signaling overhead for passing the CSI of the S-R link to destination nor pilot symbols for the estimation of the R-D link. Computer simulations show that the proposed estimator works well under the signal-to-noise ratios of interest.

Cloud computing is an emerging computing paradigm that may have a significant impact on various aspects of the development of information infrastructure. In a Cloud environment, different types of network resources need to be virtualized as a series of service components by network virtualization, and these service components should be further composed into Cloud services provided to end users. Therefore Quality of Service (QoS) aware service composition plays a crucial role in Cloud service provisioning. This paper addresses the problem on how to compose a sequence of service components for QoS guaranteed service provisioning in a virtualization-based Cloud computing environment. The contributions of this paper include a system model for Cloud service provisioning and two approximation algorithms for QoS-aware service composition. Specifically, a system model is first developed to characterize service provisioning behavior in virtualization-based Cloud computing, then a novel approximation algorithm and a variant of a well-known QoS routing procedure are presented to resolve QoS-aware service composition. Theoretical analysis shows that these two algorithms have the same level of time complexity. Comparison study conducted based on simulation experiments indicates that the proposed novel algorithm achieves better performance in time efficiency and scalability without compromising quality of solution. The modeling technique and algorithms developed in this paper are general and effective; thus are applicable to practical Cloud computing systems.

A construction of shift sequence sets is proposed. Multiple distinct shift sequence sets are obtained by changing the parameters of the shift sequences. The shift sequences satisfy the conditions that P|L and P ≥ 2, where P is the length of the shift sequences, L is the length of the zero-correlation zone or low-correlation zone (ZCZ/LCZ). Then based on these shift sequence sets, many shift distinct ZCZ/LCZ sequence sets are constructed by using interleaving technique and complex Hadamard matrices. Furthermore, the new construction is optimal under the conditions proposed in this paper. Compared with previous constructions, the proposed construction extends the number of shift distinct ZCZ/LCZ sequence sets, so that more sequence sets are obtained for multi-cell quasi-synchronous code-division multiple access (QS-CDMA) systems.

Two-dimensional (2-D) codes for optical code-division multiple access (O-CDMA) systems can increase the number of subscribers and simultaneous users as compared to one-dimensional time-spreading codes. Multiple-wavelength optical orthogonal code (MWOOC), which is one of the 2-D codes, uses prime sequences as a wavelength-hopping code and an optical orthogonal code (OOC) as a time-spreading code. MWOOCs have some advantages over other 2-D codes especially in high bit-rate O-CDMA systems. The only drawback of MWOOC is that the performance degrades significantly when the number of wavelengths is not prime. Recently a generalized class of modified prime sequence codes (MPSCs), which includes the class of original MPSCs as its subclass, was presented. An important property of generalized MPSCs is that the codes can be constructed over not only prime fields but also extension fields. It has been shown that the correlation property of generalized MPSCs is the same as that of the original MPSCs. This paper investigates MWOOC with generalized prime sequences, which can be obtained in the process of generating the generalized MPSCs, as a wavelength-hopping code. Use of the generalized prime sequences can solve the nonprime problem of MWOOCs. The average error probability of the proposed MWOOCs is formulated theoretically and numerical results are compared with that of the original schemes. It is shown that nonprime numbers, such as 2m, 3m and 5m, can be also taken as the number of wavelengths without degrading the system performance in the proposed systems.

For advanced mobile communication systems that adopt orthogonal frequency-division multiple access (OFDMA) technologies, intercarrier interference (ICI) significantly degrades performance when mobility is high. Standard specifications and concerns about complexity demand low-cost methods with deployment readiness and decent performance. In this paper, novel zero forcing (ZF) and minimum mean-square error (MMSE) equalizers based on per-subcarrier adaptive (PSA) processing and perturbation-based (PB) approximation are introduced. The proposed equalizers strike a good balance between implementation cost and performance; therefore they are especially suitable for OFDMA downlink receivers. Theoretical analysis and simulations are provided to verify our claims.

A scheme that modulates the training sequence is proposed to support two-layer data streams in the time domain synchronous orthogonal frequency division multiplex (TDS-OFDM) systems. A theoretical analysis and computer simulation show that the proposed scheme works well and that the two layer data streams are compatible with each other.

This paper proposes a new channel allocation algorithm for satellite communication systems. The algorithm is based on a spectrum division transmission technique as well as a spectrum compression transmission technique that we have developed in separate pieces of work. Using these techniques, the algorithm optimizes the spectrum bandwidth and a MODCOD (modulation and FEC error coding rate) scheme to balance the usable amount of satellite transponder bandwidth and satellite transmission power. Moreover, it determines the center frequency and bandwidth of each divided subspectra depending on the unused bandwidth of the satellite transponder bandwidth. As a result, the proposed algorithm enables flexible and effective usage of satellite resources (bandwidth and power) in channel allocations and thus enhances satellite communication (SATCOM) system capacity.

In block transmissions, inter-block interference (IBI) due to delayed waves exceeding a cyclic prefix severely limits the performance. To suppress IBI in downlink MC-CDMA systems, this paper proposes a novel channel shortening method using a time-domain equalizer. The proposed method minimizes a cost function related to equalizer output autocorrelations without the transmission of training symbols. We prove that the method can shorten a channel and suppress IBI completely. Simulation results show that the proposed method can significantly suppress IBI using relatively less number of received blocks than a conventional method when the number of users is moderate.

In this paper, we analyze the existing results to derive the cross-correlation distributions of p-ary m-sequences and their decimated sequences for an odd prime p and various decimations d. Based on the previously known results, a methodology to obtain the distribution of their cross-correlation values is also formulated.

For maximum-likelihood (ML) estimation to jointly track carrier frequency offset (CFO) and channel impulse response (CIR) in orthogonal frequency division multiplexing (OFDM) systems, we present a finite high order approximation method utilizing the MATLAB ‘roots' command on the log-likelihood function derived from the OFDM received signal, coupled with an adaptive iteration algorithm. The tracking performance of this high order approximation algorithm is found to be excellent, and as expected, the algorithm outperforms the other existing first order approximation algorithms.

This paper addresses conjugate-gradient (CG) based pilot-assisted channel estimation and equalization in doubly selective channels for orthogonal frequency division multiplexing (OFDM) block transmissions. With the help of the discrete prolate spheroidal sequence, which shows flat mean-square error (MSE) curves for the reconstructed channels in the presence of Doppler frequency mismatch, a basis expansion model for a parsimonious channel representation over multiple OFDM blocks is developed, a system equation for the least square channel estimation under widely used pilot lattices, where the pilot symbols are irregularly placed in the subcarrier domain, is formulated by introducing carving matrices, and the standard CG method is applied to the system. Relying on the CG method again, the linear minimum mean-square error channel equalization is pursued without performing any matrix inversion, while elevating the convergence speed of the iterative algorithm with a simple preconditioner. Finally, we validate our schemes with numerical experiments on the integrated services digital broadcasting-terrestrial system in doubly-selective channels and determine the normalized MSE and uncoded bit error rate.

In this paper, we constructed a class of low correlation zone sequence sets derived from the interleaved technique and DFT matrices. When p is a prime such that p > 3, p-ary LCZ sequence sets with parameters LCZ(pn-1,pm-1,(pn-1)/(pm-1),1) are constructed based on a DFT matrix with order pp, which is optimal with respect to the Tang-Fan-Matsufuji bound. When p is a prime such that p ≥ 2, pk-ary LCZ sequence sets with parameters LCZ(pn-1,pk-1,(pn-1)/(pk-1),1) are constructed based on a DFT matrix with order pkpk, which is also optimal. These sequence sets are useful in certain quasi-synchronous code-division mutiple access (QS-CDMA) communication systems.

High-performance FFT processor is indispensable for real-time OFDM communication systems. This paper presents a CORDIC based design of variable-length FFT processor which can perform various FFT lengths of 64/128/256/512/1024/2048/4096/8192-point. The proposed FFT processor employs memory based architecture in which mixed radix 4/2 algorithm, pipelined CORDIC, and conflict-free parallel memory access scheme are exploited. Besides, the CORDIC rotation angles are generated internally based on the transform of butterfly counter, which eliminates the need of ROM making it memory-efficient. The proposed architecture has a lower hardware complexity because it is ROM-free and with no dedicated complex multiplier. We implemented the proposed FFT processor and verified it on FPGA development platform. Additionally, the processor is also synthesized in 0.18 µm technology, the core area of the processor is 3.47 mm2 and the maximum operating frequency can be up to 500 MHz. The proposed FFT processor is better trade off performance and hardware overhead, and it can meet the speed requirement of most modern OFDM system, such as IEEE 802.11n, WiMax, 3GPP-LTE and DVB-T/H.