Simple iterative receivers for MIMO LP-OFDM systems

In this paper,Lp-ofdm is combined with differentMimo schemes in order to improve performance in terms of diversity gain and to exploit capacity brought by theMimo channel. The original contribution is the development of a generic iterative receiver designed forLp mimo transmission able to work whatever the antenna configuration and the spatial coding scheme. By using a globalMmse criterion, interference terms coming from space-time coding and linear precoding are jointly treated leading to a very good trade-off between performance and complexity compared to trellis based detectors particularly for high order modulations, high number of antennas and/or large size of precoding matrices.     

A MC-CDMA system analysis in a software radio context

This paper presents a Multi-Carrier Code Division Multiple Access (Mc-Cdma) system analysis in a software radio context. Based on a combination of multi-carrier modulation and code division multiple access,Mc-Cdma benefits from the main advantages from both schemes: high spectral efficiency, high flexibility, multiple access capabilities, etc. It is firstly shown why, nowadays,Mc-Cdma is undoubtedly a high potential candidate for the air interface of the 4G cellular networks. TheMc-Cdma concept and the block-diagrams of the transmitter and the receiver are presented first. Afterwards, the technical issues concerning the processing devices for the implementation ofMc-Cdma systems in a software radio context are analysed. The advantages and disadvantages of Digital Signal Processors (Dsps) and Field Programmable Gate Arrays (Fgpas) components are discussed. The implementation ofMc-Cdma systems and the integration of signal processing algorithms as Fast Hadamard Transform (Fht) and Inverse Fast Fourier Transform (Ifft) are considered and analysed for the first time. Finally, implementation results with a mixed prototyping board are presented. Then, it is shown that a new combination of the flow graphs ofFht andIfft leads to interesting computation savings and that hardware structures asFgpas are more adapted thanDsps to those intensive computation functions. Finally, for the completeMc-Cdma modem implementation, the necessity of a Co-Design methodology is highlighted in order to obtain the best matching between algorithms and architecture.     

Iterative low-complexity receiver for the UMTS downlink

In this paper, an iterative low-complexity receiver is proposed for Code Division Multiple Access (cdma) systems with small spreading factors. Theumts (Universal Mobile Télecommunication System) radio interface based oncdma has been designed to offer a wide range of data rates using variable spreading factors. High data rate services are obtained by using small spreading factors. For such services, the spreading sequences have bad autocor-relation properties causing the degradation of the Rake receiver performance because of the InterSymbol Interférence (isi). In order to improve the receiver performance, we propose to add a Decision Feedback Sequence Estimation (dfse) equalizer at the Rake receiver output. Thedfse is a low complexity equalizer which is able to take into accounta priori probability ratios and to deliver a posteriori probability ratios on bits in order to exchange soft information with the channel decoder, so that the proposed receiver benefits from the turbo-processing gains. Channel estimation is also treated in an iterative fashion. The complete receiver is well suited to theumts downlink system as it drastically reduces theisi while keeping a reasonable computational complexity.     

Iterative successive interference cancellation for multi-user DS/CDMA detectors in multipath channels

This paper deals with uplink Direct-Sequence Code Division Multiple Access (DS-CDMA) transmissions over mobile radio channels. A new interference cancellation scheme for multiuser detection, calledSIC/RAKE, is presented. It is based on a modified multistage Successive Interference Cancellation (sic) structure that enables efficient detection in multipath propagation environments, thanks to a single userRAKE receiver incorporated in each unit of thesic structure. Furthermore, a modified version of thesic structure, calledSIC/MMSE, that ensures convergence to theMMSE detector rather than to the decorrelating detector has been suggested. The convergence of theSIC/RAKE andSIC/MMSE methods is proved. Simulation results for the Universal Mobile Telecommunication System (UMTS) have been carried out for flat fading Rayleigh multipath channels, showing that the proposed detector is resistant to the near-far effect and that low performance loss is obtained compared to the single-user bound.     

10 gigabit Ethernet long-haul transmission without in-line EDFAs

In this contribution, we present experimental results on optical packet transmission of two 10 gigabit ethernet channels (10Ge) over 252 km link of standard single mode fibre (Ssmf, itu-t Recommendation G.652) and 287 km long link composed of 85 km ofSsmf and 202 km of non-zero dispersion-shifted (Nz DSF, itu-t Recommendation G.655) without deployment of in-line erbium-doped fiber amplifiers (Edfas). All the active components, dispersion compensating fibre (Dcf) modules and optical band-pass filters were placed at the transmitter and at the receiver side of the link. To our best knowledge, this is the first report of pure Ethernet transmission without in-lineEdfas over such a distance. The results are encouraging especially for operators of national research and educational networks who rely on leased dark fibres and prefer as long transmission as possible without deployment of in-line amplifiers.     

Improving parallel EKF-based nonlinear channel equalization using unscented transformation

The paper presents a new review of parallel Kalman filtering for nonlinear channel equalization. A Network of Extended Kalman Filters (nekf) has already been suggested for this purpose. This equalizer gives recursively a minimum mean squared error (mmse) estimation of a sequence of transmitted symbols according to a state formulation of a digital communication scheme. It is essentially based on two mechanisms: the approximation of the non Gaussiana posteriori probability density function (pdf) of the symbol sequence by a Weighted Gaussian Sum (wgs); and the local linearization of the nonlinear channel function for each branch of the network. Since the linearization, bearing on scattered symbol states, is one of the major limitations of thenekf, a new Kalman filtering approach, the Unscented Kalman Filter (ukf) suggested by Julier and Uhlman is considered in this paper for an interesting adaptation to the equalization context. Theukf algorithm is based on the equations of a Kalman filter, as the optimal linear minimum variance estimator, and on determining conditional expectations based on a kind of deterministic Monte-Carlo simulations. The new equalizer referred to as the Network ofukf (nukf), thus combines density approximation by awgs and the Unscented Transformation (ut) principle to circumvent the linearization brought within eachekf and is shown to perform better than thenekf based equalizer for severe nonlinear channels. Also, an adaptive version of thenukf is developed using the k-means clustering algorithm for noise-free channel output identification, since thenukf-based algorithm does not require the knowledge of the channel nonlinearity model.     

Parallel interference cancellation efficiency for noisy signals in O-CDMA system

The aim of this paper is to evaluate the robustness of Parallel Interference Cancellation (Pic) to noise contribution for an optical Code Division Multiple Access system. The theoretical expression of thePic error probability is developed in the case of white additive Gaussian noise. From theoretical analysis, we show that, even with noise contribution, thePic receiver outperforms the Conventional Correlation Receiver (Ccr). Moreover, the results highlight that, for a given performance, thePic receiver relaxes not only the constraint on the code length, but also the Signal to Noise Ratio compared toCcr. Particularly, this is proofed in access network context, i.e. 30 users withBer lt; 10^?9.     

Étude théorique et expérimentale d’une modulation simplifiée par déplacement de fréquence d’indice 1/2 à phase continue

The minimum shift keying modulation (MSK)to which a lot of recent publications have been done,presents some advantage about linear and non-linear distortions towards common 2 or 4 Phase Shift Keying (PSK)modulations. The simplified MSK modulation described in this paper is obtained by linear filtering of a coherent 2 phase shift keying modulation. Then the demodulator can be implemented with a matched filter followed by a coherent demodulator using only one carrier recovery circuit. In the first part of this paper, the modulator and the demodulator are described. After, some theorical results in the presence of noise and other impairments are given. In CCETT laboratories at Rennes, a modem has been realized at a data rate of 2,048 Mbit/s and performs at 0,8 dB of the theoretical results.     

Rogue-base station detection in WiMax/802.16 wireless access networks

We address the problem of detecting a rogue base station (Bs) in WiMax/802.16 wireless access networks. A rogueBs is a malicious station that impersonates a legitimate access point (Ap). The rogueBs attack represents a major denial-of-service threat against wireless networks. Our approach is based on the observation that inconsistencies in the signal strength reports received by the mobile stations (Mss) can be seen if a rogueBs is present in a network. These reports can be assessed by the legitimate base stations, for instance, when a mobile station undertakes a handover towards anotherBs. Novel algorithms for detecting violations of received signal strength reports consistency are described in this paper. These algorithms can be used by an intrusion detection system localized on the legitimateBss or on a global network management system operating theBss.     

Application level framing applied to image compression

Two well-known wavelet zerotree encoding algorithms, Embedded Zerotree Encoding (Ezw) and Set Partitioning in Hierarchical Trees (Spiht), provide excellent progressive display when images are transmitted over reliable networks. However, both algorithms are state-dependent and can perform poorly over unreliable networks. We apply the concept of network-conscious image compression to theSpiht wavelet zerotree encoding algorithm, to improve its performance over unreliable networks. Experimental results confirm the utility of network-conscious image compression concept.     

Robust time-frequency distributions based on the robust short time fourier transform

Design of time-frequency distributions (Tfds) that are robust to the impulse noise influence is considered. The robustTfds based on the robust short-time Fourier transform (Stft) are proposed. An efficient procedure to evaluate the robustStft is given. RobustTfds based on the robustStft have better energy concentration around the signal instantaneous frequency (If) than the robustStft itself. Also, theseTfds are more resistant to higher impulse noise than the robustTfds obtained using the local autocorrelation function (Laf) based minimization problem.     

Bandwidth sharing under the assured forwarding Per-Hop behavior

The DiffServ’s Assured Forwarding (af) Per-Hop Behavior (phb) Group defines a differentiated forwarding of packets in four independent classes, each class having three levels of drop precedence. Specific end-to-end services based on thisphb are still being defined. A particular type of service that could assure a given rate to a traffic aggregate has been outlined elsewhere. In such a service, a fair distribution of bandwidth is one of the main concerns. This paper presents experimental work carried out to evaluate howaf distributes bandwidth among flows under different load conditions and traffic patterns. We focused on the effect that marking mechanisms have on bandwidth sharing among flows within a singleaf class. The traffic types we used includeudp flows, individual and aggregatedtcp flows, mix oftcp andudp, tcp sessions with heterogeneous round-trip times, as well as color-blind and color-aware re-marking at the aggregation point fortcp flows. Tests were performed on real and simulated networks. We have found certain conditions under whichaf distributes bandwidth fairly among nonadaptiveudp flows andtcp aggregates. Finally, we evaluate a basic rule for setting the parameters of the two-rate Three-Color Marker conditioning algorithm (trtcm) in order to achieve a better bandwidth distribution fortcp flows.     

Characterization and evaluation of TCP and UDP-based transport on real networks

StandardTcp (RenoTcp) does not perform well on fast long distance networks, due to its AMD congestion control algorithm. In this paper we consider the effectiveness of various alternatives, in particular with respect to their applicability to a production environment. We then characterize and evaluate the achievable throughput, stability and intra-protocol fairness of differentTcp stacks (Scalable,Hstcp,Htcp, FastTcp, Reno,Bictcp, hstcp-lp andLtcp) and aUdp based application level transport protocol (Udtv2) on both production and testbed networks. The characterization is made with respect to both the transient traffic (entry and exit of different streams) and the steady state traffic on production Academic and Research networks, using paths withRtts differing by a factor of 10. We also report on measurements made with 10 Gbit/secNics with and withoutTcp Offload Engines, on 10 Gbit/s dedicated paths set up forSc2004.     

Performance evaluation of DCCP: A focus on smoothness and TCP-friendliness

Recent years have seen dramatic increases of the use of multimedia applications on the Internet, which typically either lack congestion control or use proprietary congestion control mechanisms. This can easily cause congestion collapse or compatibility problems. Datagram Congestion Control Protocol (Dccp) fills the gap betweenUdp andTcp, featuring congestion control rather than reliability for packet-switched rich content delivery with high degree of flexibility. We present aDccp model designed and implemented withOpnet Modeler, and the experiments and evaluation focused on largely the smoothness of the data rates, and the fairness between concurrentDccp flows andTcp flows. We foundDccp-ccid3 demonstrates stable data rates under different scenarios, and the fairness betweenDccp andTcp is only achieved under certain conditions. We also validated that the throughput ofDccp-Ccid3 is proportional to the average packet size, and relatively fixed packet size is critical for the optimal operation ofDccp. Problems in the slow start phase and insufficient receiver buffer size were identified and we hereby proposed solutions on this.     

Optimizing IP networks in a hybrid IGP/MPLS environment

In this paper, we consider a traffic engineering (te) approach toip networks in a hybridigp/mpls environment. Thoughigp (Interior Gateway Protocol) routing has proven its scalability and reliability, effective traffic engineering has been difficult to achieve in public IP networks because of the limited functional capabilities of conventionalip technologies.mpls (Multi-Protocol Label Switching) on the one hand enhances the possibility to engineer traffic onip networks by allowing explicit routes. But on the other hand it suffers from the scalability (n-square) problem. Hybridigp/mpls approaches rely onip native routing as much as possible and usempls only if necessary. In this work we propose a novel hybrid traffic engineering method based on genetic algorithms, which can be considered as an offlinete approach to handle long or medium-term traffic variations in the range days, weeks or months. In our approach the maximum number of hops anlsp (Label Switched Path) may take and the number oflsps which are applied solely to improve the routing performance, are treated as constraints due to delay considerations and the complexity of management. We apply our method to the German scientific network (b-win) for which a traffic matrix is available and also to some other networks with a simple demand model. We will show results comparing this hybridigp/mpls routing scenario with the result of pureigp routing and that of a full meshmpls with and without traffic splitting.     

On turbo encodedBicm

The superior performance of the binary turbo codes has stimulated vigorous efforts in generating bandwidth efficient modulation schemes adhering to these codes. Several approaches for the integration of turbo-coding and modulation have emerged in recent years but none seem to dominate. In the bit interleaved coded modulation (Bicm) scheme is used to achieve high bandwidth and power efficiency, while separating coding and modulation. As is now well known, theBicm scheme achieves capacity remarkably close to the constellation channel capacity. The turbo-Bicm scheme enjoys high coding diversity (well suited for fading channels), high flexibility as well as design and implementation simplicity, while maintaining good power efficiency. The system comprises one standard turbo code, an interleaver, a mapper and a modulator at the transmitter, corresponding to a demodulator, a de-interleaver and a turbo decoder at the receiver. A modified system, which improves on performance by incorporating the demodulation in the iterative decoding procedure, is investigated, and some performance gain is demonstrated, especially for low rate codes. Information theoretic arguments for the somewhat minor potential improvement in performance are detailed. The preferred mapper and interleaver for this system are considered. Extending previous works, for higher level modulations, we analyze a system including a convolutional code, an interleaver, a differential encoder (De), a mapper and a modulator at the transmitter. As for theBpsk modulation, the serial concatenation of a convolutional code withDe outperforms the single convolutional code. The serial concatenation withDe approach is analyzed also for a turbo code, where it is found to fail in achieving performance improvement. Several structures for the serial concatenation withDe are examined. These results are substantiated through the ‘spectral thinning’ phenomena of the weight distribution of the convolutional and turbocodes.     

Variational principles compete with numerical iterative methods for analyzing distributed electromagnetic structures

An explicit variational principle (Evp) for the propagation constant of em waves is compared with four numerical tools: the Newton-Raphson algorithm solving a transcendental equation, the spectral domain approach (Sda) applied to the Galerkin method, the 3-D simulatorHfss fromHp, and the finite element method (Fem). Each tool analyses a different planar topology: a lossy dielectric slab supporting surface waves, a planar slotline modelled by transmission line parameters (Tlp), a multilayered high-loss co-planar waveguide, and a shielded microstrip line. For these various structures, the evp is more efficient than previous tools yielding the propagation constant; its explicit form and variational nature yield a drastic reduction of the number of iterations.     

Présentation de quelques modèles stochastiques de canal MIMO et comparaison expérimentale

Performances ofMimo systems are dependant on the propagation channel properties. These properties must be correctly introduced in theMimo channel propagation models. Several model families exist. We will particularly investigate those relying on the use of second order statistic parameters. No comparison of these models was found in a same propagation environment. As a result, this paper deals with a comparison of six different stochastic models in “indoor” and “outdoor” environments. The principle and the mathematical representation ofMimo systems are introduced. Then, we present the different models considered. The statistical parameters used in the models are computed using an experimental characterization of the two environments. The six models are then compared to measurements using the channel coefficient envelope distribution and the channel capacity. The ability of the models to express the correlation level in the channel is analysed and discussed.     

Measurement-based admission control in UMTS

In this paper, we develop an efficient Call Admission Control (cac) algorithm forumts systems. We first introduce the expressions that we developed for Signal-to-Interference (sir) for both uplink and downlink, to obtain a novelcac algorithm that takes into account, in addition tosir constraints, the effects of mobility, coverage as well as the wired capacity behind the base station, for the uplink, and the maximal transmission power of the base station, for the downlink. As of its implementation, we investigate the measurement-based approach as a means to predict future, both handoff and new, call arrivals and thus manage different priority levels depending on a tunable coefficient. Compared to classicalcac algorithms, ourcac mechanism achieves better performance in terms of outage probability and QoS management.     

IP-based transport of voice traffic in the UMTS radio access network: analytical study and empirical validation

In this paper, we investigate theIp protocol as a transport option for the user traffic in the UMTS Terrestrial Radio Access Network (Utran), where stringent delay bounds are to be met for both real-time and non real-time traffic. We focus on real-time voice traffic and present an analytical model for the multiplexing and transport of voice channels in theUtran usingIp. The novelty of our model is that it analytically includes and quantifies the performance of the timer used in multiplexing arriving Frame Protocol (Fp) frames into largerIp packets. We then validate our work through empirical results on a test-bed emulating theUtran transport functionalities. We show the trade-offs between performance, in terms of delay and link utilization, and quantify optimal values for the timer as well as the number ofFp frames perIp packet for a given output link capacity.