Channel Estimation for Time-Varying MIMO Relay Systems

In this paper, we investigate the channel estimation problem for multiple-input multiple-output (MIMO) relay communication systems with time-varying channels. The time-varying characteristic of the channels is described by the complexexponential basis expansion model (CE-BEM). We propose a superimposed channel training algorithm to estimate the individual first-hop and second-hop time-varying channel matrices for MIMO relay systems. In particular, the estimation of the secondhop time-varying channel matrix is performed by exploiting the superimposed training sequence at the relay node, while the first-hop time-varying channel matrix is estimated through the source node training sequence and the estimated second-hop channel. To improve the performance of channel estimation, we derive the optimal structure of the source and relay training sequences that minimize the mean-squared error (MSE) of channel estimation. We also optimize the relay amplification factor that governs the power allocation between the source and relay training sequences. Numerical simulations demonstrate that the proposed superimposed channel training algorithm for MIMO relay systems with time-varying channels outperforms the conventional two-stage channel estimation scheme

Collaborative modulation multiple access for single hop and multihop networks

While the bandwidth available for wireless networks is limited, the world has seen an unprecedented growth in the number of mobile subscribers and an ever increasing demand for high data rates. Therefore efficient utilisation of bandwidth to maximise link spectral efficiency and number of users that can be served simultaneously are primary goals in the design of wireless systems. To achieve these goals, in this thesis, a new non-orthogonal uplink multiple access scheme which combines the functionalities of adaptive modulation and multiple access called collaborative modulation multiple access (CMMA) is proposed. CMMA enables multiple users to access the network simultaneously and share the same bandwidth even when only a single receive antenna is available and in the presence of high channel correlation. Instead of competing for resources, users in CMMA share resources collaboratively by employing unique modulation sets (UMS) that differ in phase, power, and/or mapping structure. These UMS are designed to insure that the received signal formed from the superposition of all users’ signals belongs to a composite QAM constellation (CC) with a rate equal to the sum rate of all users. The CC and its constituent UMSs are designed centrally at the BS to remove ambiguity, maximize the minimum Euclidian distance (dmin) of the CC and insure a minimum BER performance is maintained. Users collaboratively precode their transmitted signal by performing truncated channel inversion and phase rotation using channel state information (CSI ) obtained from a periodic common pilot to insure that their combined signal at the BS belongs to the CC known at the BS which in turn performs a simple joint maximum likelihood detection without the need for CSI. The coherent addition of users’ power enables CMMA to achieve high link spectral efficiency at any time without extra power or bandwidth but on the expense of graceful degradation in BER performance. To improve the BER performance of CMMA while preserving its precoding and detection structure and without the need for pilot-aided channel estimation, a new selective diversity combining scheme called SC-CMMA is proposed. SC-CMMA optimises the overall group performance providing fairness and diversity gain for various users with different transmit powers and channel conditions by selecting a single antenna out of a group of L available antennas that minimises the total transmit power required for precoding at any one time. A detailed study of capacity and BER performance of CMMA and SC-CMMA is carried out under different level of channel correlations which shows that both offer high capacity gain and resilience to channel correlation. SC-CMMA capacity even increase with high channel correlation between users’ channels. CMMA provides a practical solution for implementing the multiple access adder channel (MAAC) in fading environments hence a hybrid approach combining both collaborative coding and modulation referred to as H-CMMA is investigated. H-CMMA divides users into a number of subgroups where users within a subgroup are assigned the same modulation set and different multiple access codes. H-CMMA adjusts the dmin of the received CC by varying the number of subgroups which in turn varies the number of unique constellation points for the same number of users and average total power. Therefore H-CMMA can accommodate many users with different rates while flexibly managing the complexity, rate and BER performance depending on the SNR. Next a new scheme combining CMMA with opportunistic scheduling using only partial CSI at the receiver called CMMA-OS is proposed to combine both the power gain of CMMA and the multiuser diversity gain that arises from users’ channel independence. To avoid the complexity and excessive feedback associated with the dynamic update of the CC, the BS takes into account the independence of users’ channels in the design of the CC and its constituent UMSs but both remain unchanged thereafter. However UMS are no longer associated with users, instead channel gain’s probability density function is divided into regions with identical probability and each UMS is associated with a specific region. This will simplify scheduling as users can initially chose their UMS based on their CSI and the BS will only need to resolve any collision when the channels of two or more users are located at the same region. Finally a high rate cooperative communication scheme, called cooperative modulation (CM) is proposed for cooperative multiuser systems. CM combines the reliability of the cooperative diversity with the high spectral efficiency and multiple access capabilities of CMMA. CM maintains low feedback and high spectral efficiency by restricting relaying to a single route with the best overall channel. Two possible variations of CM are proposed depending on whether CSI available only at the users or just at the BS and the selected relay. The first is referred to Precode, Amplify, and Forward (PAF) while the second one is called Decode, Remap, and Forward (DMF). A new route selection algorithm for DMF based on maximising dmin of random CC is also proposed using a novel fast low-complexity multi-stage sphere based algorithm to calculate the dmin at the relay of random CC that is used for both relay selection and detection

Estimation of bit error rate in 2×2 and 4×4 multi-input multi-output-orthogonal frequency division multiplexing systems

Multiple-input, multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems with multiple input antennas and multiple output antennas in dynamic environments face the challenge of channel estimation. To overcome this challenge and to improve the performance and signal-to-noise ratio, in this paper we used the Kalman filter for the correct estimation of the signal in dynamic environments. To obtain the original signal at the receiver end bit error rate factor plays a major role. If the signal to noise ratio is high and the bit error rate is low then signal strength is high, the signal received at the receiver end is almost similar to the ith transmitted signal. The dynamic tracking characteristic of Kalman filter is used to establish a dynamic space-time codeword and a collection of orthogonal pilot sequences to prevent interference among transmissions in this paper. Using the simulation, the Kalman filter method can be compared to the other channel estimation method presented in this paper that can track time-varying channels rapidly

Long Term Evolution-Advanced and Future Machine-to-Machine Communication

Long Term Evolution (LTE) has adopted Orthogonal Frequency Division Multiple Access (OFDMA) and Single Carrier Frequency Division Multiple Access (SC-FDMA) as the downlink and uplink transmission schemes respectively. Quality of Service (QoS) provisioning is one of the primary objectives of wireless network operators. In LTE-Advanced (LTE-A), several additional new features such as Carrier Aggregation (CA) and Relay Nodes (RNs) have been introduced by the 3rd Generation Partnership Project (3GPP). These features have been designed to deal with the ever increasing demands for higher data rates and spectral efficiency. The RN is a low power and low cost device designed for extending the coverage and enhancing spectral efficiency, especially at the cell edge. Wireless networks are facing a new challenge emerging on the horizon, the expected surge of the Machine-to-Machine (M2M) traffic in cellular and mobile networks. The costs and sizes of the M2M devices with integrated sensors, network interfaces and enhanced power capabilities have decreased significantly in recent years. Therefore, it is anticipated that M2M devices might outnumber conventional mobile devices in the near future. 3GPP standards like LTE-A have primarily been developed for broadband data services with mobility support. However, M2M applications are mostly based on narrowband traffic. These standards may not achieve overall spectrum and cost efficiency if they are utilized for serving the M2M applications. The main goal of this thesis is to take the advantage of the low cost, low power and small size of RNs for integrating M2M traffic into LTE-A networks. A new RN design is presented for aggregating and multiplexing M2M traffic at the RN before transmission over the air interface (Un interface) to the base station called eNodeB. The data packets of the M2M devices are sent to the RN over the Uu interface. Packets from different devices are aggregated at the Packet Data Convergence Protocol (PDCP) layer of the Donor eNodeB (DeNB) into a single large IP packet instead of several small IP packets. Therefore, the amount of overhead data can be significantly reduced. The proposed concept has been developed in the LTE-A network simulator to illustrate the benefits and advantages of the M2M traffic aggregation and multiplexing at the RN. The potential gains of RNs such as coverage enhancement, multiplexing gain, end-to-end delay performance etc. are illustrated with help of simulation results. The results indicate that the proposed concept improves the performance of the LTE-A network with M2M traffic. The adverse impact of M2M traffic on regular LTE-A traffic such as voice and file transfer is minimized. Furthermore, the cell edge throughput and QoS performance are enhanced. Moreover, the results are validated with the help of an analytical model

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks

Signal Processing and Learning for Next Generation Multiple Access in 6G

Wireless communication systems to date primarily rely on the orthogonality of resources to facilitate the design and implementation, from user access to data transmission. Emerging applications and scenarios in the sixth generation (6G) wireless systems will require massive connectivity and transmission of a deluge of data, which calls for more flexibility in the design concept that goes beyond orthogonality. Furthermore, recent advances in signal processing and learning have attracted considerable attention, as they provide promising approaches to various complex and previously intractable problems of signal processing in many fields. This article provides an overview of research efforts to date in the field of signal processing and learning for next-generation multiple access, with an emphasis on massive random access and non-orthogonal multiple access. The promising interplay with new technologies and the challenges in learning-based NGMA are discussed

EXTRINSIC CHANNEL-LIKE FINGERPRINT EMBEDDING FOR TRANSMITTER AUTHENTICATION IN WIRELESS SYSTEMS

We present a physical-layer fingerprint-embedding scheme for wireless signals, focusing on multiple input multiple output (MIMO) and orthogonal frequency division multiplexing (OFDM) transmissions, where the fingerprint signal conveys a low capacity communication suitable for authenticating the transmission and further facilitating secure communications. Our system strives to embed the fingerprint message into the noise subspace of the channel estimates obtained by the receiver, using a number of signal spreading techniques. When side information of channel state is known and leveraged by the transmitter, the performance of the fingerprint embedding can be improved. When channel state information is not known, blind spreading techniques are applied. The fingerprint message is only visible to aware receivers who explicitly preform detection of the signal, but is invisible to receivers employing typical channel equalization. A taxonomy of overlay designs is discussed and these designs are explored through experiment using time-varying channel-state information (CSI) recorded from IEEE802.16e Mobile WiMax base stations. The performance of the fingerprint signal as received by a WiMax subscriber is demonstrated using CSI measurements derived from the downlink signal. Detection performance for the digital fingerprint message in time-varying channel conditions is also presented via simulation

Some aspects of traffic control and performance evaluation of ATM networks

The emerging high-speed Asynchronous Transfer Mode (ATM) networks are expected to integrate through statistical multiplexing large numbers of traffic sources having a broad range of statistical characteristics and different Quality of Service (QOS) requirements. To achieve high utilisation of network resources while maintaining the QOS, efficient traffic management strategies have to be developed. This thesis considers the problem of traffic control for ATM networks. The thesis studies the application of neural networks to various ATM traffic control issues such as feedback congestion control, traffic characterization, bandwidth estimation, and Call Admission Control (CAC). A novel adaptive congestion control approach based on a neural network that uses reinforcement learning is developed. It is shown that the neural controller is very effective in providing general QOS control. A Finite Impulse Response (FIR) neural network is proposed to adaptively predict the traffic arrival process by learning the relationship between the past and future traffic variations. On the basis of this prediction, a feedback flow control scheme at input access nodes of the network is presented. Simulation results demonstrate significant performance improvement over conventional control mechanisms. In addition, an accurate yet computationally efficient approach to effective bandwidth estimation for multiplexed connections is investigated. In this method, a feed forward neural network is employed to model the nonlinear relationship between the effective bandwidth and the traffic situations and a QOS measure. Applications of this approach to admission control, bandwidth allocation and dynamic routing are also discussed. A detailed investigation has indicated that CAC schemes based on effective bandwidth approximation can be very conservative and prevent optimal use of network resources. A modified effective bandwidth CAC approach is therefore proposed to overcome the drawback of conventional methods. Considering statistical multiplexing between traffic sources, we directly calculate the effective bandwidth of the aggregate traffic which is modelled by a two-state Markov modulated Poisson process via matching four important statistics. We use the theory of large deviations to provide a unified description of effective bandwidths for various traffic sources and the associated ATM multiplexer queueing performance approximations, illustrating their strengths and limitations. In addition, a more accurate estimation method for ATM QOS parameters based on the Bahadur-Rao theorem is proposed, which is a refinement of the original effective bandwidth approximation and can lead to higher link utilisation