We study the transmission techniques in orthogonal frequency division multiplexing (OFDM) systems with imperfect channel state information at the transmitter (CSIT). We focus on the issue of utilizing the available CSIT by a single forward error control (FEC) code. We first analyze the system performance for the ideal coding case. We then develop a simple but efficient scheme for the practical coding case, which is based on joint FEC coding and linear precoding at the transmitter and iterative linear minimum-mean-square-error (LMMSE) detection at the receiver. Numerical results show that significant performances gains can be achieved by the proposed scheme.

This letter is concerned with cellular controlled short-range communication (CCSRC) systems, which can provide a significant performance gain over the traditional cellular systems as shown in the literature. However, to obtain such a gain, CCSRC systems need perfect channel state information (CSI) of all users and the complexity of setting up the optimal cooperative clusters is factorial with respect to the number of potentially cooperative users, which is very unrealistic in practical systems. To solve this problem, we propose a novel cooperative strategy, where CCSRC systems only need the distances between all user pairs and the complexity of setting up the cooperative clusters is relatively low. Simulation results show that the performance of the proposed strategy is close to optimal.

In this letter, we enhance Complementary Code Keying (CCK) modulation with Pseudo-Periodic Sequence. It has been proved that the new Pseudo-Periodic CCK modulation is more efficient and robust fighting against multi-path interference. In order to support our new scheme, we design and implement the corresponding simulation. The in-depth analysis of the reason why Pseudo-Periodic Sequence can do a favor to CCK is also presented and emphasized.

Large Area Synchronized (LAS)-CDMA, actually composed of LA codes and pulse compressing LS codes, has been proposed as a most promising scheme in 3G and 4G wireless communications. LS codes are famous for the Zero Correlation Zone (ZCZ) in the auto-correlation and cross-correlation functions, which endows the codes with the capability to perfectly reduce the Multiple Access Interference (MAI) and Inter Symbol Interference (ISI) if the maximum transmission delay is less than the length of ZCZ. In this letter, we provide a general and systematic method to construct LS codes from the set of complete complementary sequences. Our method is much more general than the ordinary LS construction method revealed previously.

Internet traffic engineering is much important for Internet Service Providers (ISPs) today, since it can be used to fully utilize already deployed network resources. For ISPs, the requirements for traffic engineering should be simple, easy to configure, cost-effective and efficient. Based on these considerations, we propose an algorithm called Web First Adaptive Traffic Engineering (WFATE). Since World Wide Web (WWW) services dominate most of the total Internet traffic and WWW flows are not long-lived, we only apply load balancing to WWW traffic in the algorithm. It can be shown that the number of coexistent WWW flows at an ingress node is almost certainly below a bound, and thus a forward-per-flow mechanism without keeping track of the state of each flow is feasible. This mechanism can balance traffic load at fine granularity and therefore get better performance. Through simulations and performance comparison, it is shown that WFATE is quite efficient, which can improve the network throughput averagely by 26% under the "dense source" traffic pattern and 9% under the "sparse source" traffic pattern.

In this paper a multi-channel MAC protocol with dynamic channel allocation (MMAC-DCA) in CDMA Ad Hoc networks is proposed. Under MMAC-DCA, the service sub-channels are dynamically allocated by the RTS/CTS dialogue on the common sub-channel, only when a node has a packet to transmit. In addition, a Markov mode is presented to analyze the performance of MMAC-DCA.

The traditional selection cooperation scheme selects the relay with best instantaneous receive signal-to-noise ratio to forward the message and achieves good outage performance, which may however cause poor fairness among relays. In this letter, we propose two practical selection cooperation schemes in Decode-and-Forward (DF) fashion to improve the fairness of relay selection. Numerical results suggest that both of the proposed schemes can achieve fairness close to the strict fairness scheme without outage performance deterioration. It is also validated that these schemes have lower complexities than traditional ones and therefore are practical for real networks.

Without recourse to the Shannon-Nyquist sampling theorem, a novel information sampling (IS) concept is proposed for ultra-wideband (UWB) communications. To implement IS, a random pre-coding system architecture is designed and system performance is studied. Simulation results from one of UWB channel models show that the proposed system is effective to detect UWB signals with a low-sampling-rate analog-to-digital converter (ADC) at the receiver. Moreover, it can operate in a regime of heavy inter-symbol interference (ISI).

The bit-error-rate (BER) performance predicted by the semi-analytical evolution technique proposed by Li Ping et al. becomes inaccurate for parallel concatenated coded interleave-division multiple-access (PCC-IDMA) systems. To solve this problem, we develop a novel evolution technique of such systems. Numerical results show that the predicted performance agrees well with the simulation results, and that this technique is useful for system optimization.

Multi-Carrier CDMA (MC-CDMA) has been considered as a combination of the techniques of Code Division Multiple Access (CDMA) and Orthogonal Frequency Division Multiplex (OFDM). However, even until now, the efficient MC-CDMA scheme is still under study because of the inherent bugs in OFDM, such as the troubles caused by Multiple Access Interference (MAI) and Peak to Average Power Ratio (PAPR). In this paper, we present a novel two-dimensional spreading sequence named "Two Dimensional Combined Complementary Sequence" (TDC). If we take this kind of sequences as spreading codes, several prominent advantages can be achieved compared with traditional MC-CDMA. First, it can achieve MAI free in the multi-path transmission both in uplink and downlink. Second, it offers low PAPR value within 3 dB with a quite simple architecture. The last but not the least, the proposed MC-CDMA scheme turns out to be an efficient approach with high bandwidth efficiency, high spreading efficiency and flexible transmission rate enriched by a special shift-and-add modulation. Meanwhile, an algorithm that constructs TDC sequences is discussed in details. Based on above results, we can get the conclusion that the novel TDC sequences and corresponding MC-CDMA architecture have great potential for applications in next generation wireless mobile communications, which require high transmission rate in hostile and complicated channels.

In this paper, we present a set of sequence pairs which produce zero correlation windows not only in the middle part of the sum of aperiodic correlation functions, but also in the two terminal parts. We name it "Ear Windows." In approximately synchronous CDMA communication system, this set of sequences is able to completely remove the inter-symbol interference (ISI) and multi-user interference (MUI) caused by the multi-path effect if the maximum delay is shorter than the length of the "Ear windows." In addition, it is also feasible in M-ary modulation. The inter-code interference will be mitigated drastically.

A number of on-line and off-line algorithms for load balancing on multiple paths for MPLS (MultiProtocol Label Switching) traffic engineering have now been proposed, in which it is always assumed that sets of LSPs (Label Switched Path) have already been established between node pairs. While how to choose these paths is an important issue in traffic engineering, it has not been well studied yet. In this paper, we attempt to fill in this gap. As the shortest paths are always preferred in routing problems, we evaluate several k shortest path algorithms from the viewpoint of bandwidth use efficiency and the number of the found paths. Extensive simulations have been performed in different kinds of topologies to factor out effects of network characteristics on these algorithms' path calculation performances. It is found out that the performances of the evaluated algorithms are limited in some cases and the design of new algorithms for the path calculation problem is worth studying in the future.

Multipath is a big problem for TCP traffic in traffic engineering. To solve it, hash functions such as CRC-16 are usually applied over source and destination address segments in packet headers. Through simulations and performance comparison of several multipath algorithms, it is found out that high network utilization achieved by using hash functions is at the expense of low fairness among coexisting TCP flows. It is also illustrated that packet size has significant influence on performance.

An approach based on signal subspace analysis is proposed to blind estimation of the PN (Pseudo Noise) sequence from lower SNR (Signal to Noise Ratios) DS/SS (Direct Sequence Spread Spectrum) signals. The received signal is divided into vectors according to a temporal window, from which an autocorrelation matrix is computed and accumulated. The PN sequence can be reconstructed from principal eigenvectors of the matrix.