Half-duplex Channel Research Articles

Self-interference cancellation in underwater acoustic communications systems using orthogonal pilots in IBFD

This paper proposes a Self-interference (SI) cancellation system model of Underwater acoustic (UWA) communication for in-band full-duplex (IBFD) technology. The SI channel is separated from the Far channel by exploiting a concurrently orthogonal pilot channel estimation technique using two orthogonal frequency-division multiplexing (OFDM) blocks to establish orthogonality between them based on a unitary matrix. Compared to the half-duplex channel estimator, the mean squared error (MSE) and the bit error rate (BER) provided strong evidence for the efficiency of the proposed SI cancellation. Since full-duplex systems are more efficient than half-duplex ones, the proposed approach might be seen as a viable option for them. The proposed method proved effective when used with a fixed full-duplex (FD) position and FD shifting of up to 4°. Different channel lengths and distances are adopted to evaluate the proposed method. Initial findings indicate that MSE for the SI channel minimum mean-square error (MMSE) estimator at 20 dB is 0.118 · 10−3, for fixed FD. In addition, this paper presents a geometry channel model for the Far channel in the IBFD underwater communication system that describes the propagation delay of the multipath reflection. The simulation results for the multipath propagation delay spread are similar to the traditional results, with the delay spread of the suggested model reaching (79 ms), which is close to the Bellhop simulator result (78 ms).

A FULL DUPLEX 5G WIRELESS COMMUNICATION SYSTEM USING NI USRP 2944

Full-duplex (FD) transmission is an emerging wireless technology that holds a great promise in improving the wireless throughput. The concept of fullduplex communication is simple. A single device can simultaneously transmit and receive on the same frequency channel. However, as the transmitted signal is many orders of magnitude stronger than the desired signal at the input of the receiver, it is extremely challenging to recover the desired signal and enable such a communication. In particular, the self-interfering (SI) signal needs to be suppressed by a factor of a billion to a trillion, requiring 90 − 120 dB of self-interference cancellation (SIC). Full-duplex wireless transceivers are typically operated over two concurrent half duplex channels, one for the transmitter (Tx) and one for the receiver (Rx). These half-duplex links have RF carriers separated in the frequency domain, namely using a TDD or Frequency Division Duplexing (FDD) scheme. This allows the receiver’s sensitive front-end to be isolated from the high power generated by the co-located transmitter. In this paper, a full duplex communication system is implemented using Universal Software Radio Peripheral (USRP) and interfaced to a system installed with LabVIEW software. IQ signals transmission scenario was applied and tested.

Multiparty half-duplex systems and synchronous communications

FIFO automata are finite state machines communicating through FIFO queues. They can be used, for instance, to model distributed protocols. Due to the unboundedness of the FIFO queues, several verification problems are undecidable for these systems. In order to model check such systems, one may look for decidable subclasses of FIFO systems. Binary half-duplex systems are systems of two FIFO automata exchanging over a half-duplex channel. They were studied by Cécé and Finkel who established the decidability in polynomial time of several properties. There is no obvious way to generalize the half-duplex property to multiparty systems. Cécé and Finkel proposed some generalizations but concluded that their notions of multiparty half-duplex systems were either too restrictive or too expressive.We explore in this paper other ways of generalizing half-duplex systems to multiparty. First, we introduce systems realizable with synchronous communications (RSC) and we show that RSC systems generalize half-duplex systems and retain the same good properties as binary half-duplex systems. Second, we introduce a notion of multiparty half-duplex systems that differs from the ones explored by Cécé and Finkel, and we show two results about this notion: (1) for mailbox communications, half-duplex systems are essentially the same as RSC systems, and (2) for peer-to-peer communications, the two notions are distinct, and RSC systems appear to be “the good one”, since peer-to-peer half-duplex systems are Turing powerful.

Towards Generalised Half-Duplex Systems

FIFO automata are finite state machines communicating through FIFO queues. They can be used for instance to model distributed protocols. Due to the unboundedness of the FIFO queues, several verification problems are undecidable for these systems. In order to model-check such systems, one may look for decidable subclasses of FIFO systems. Binary half-duplex systems are systems of two FIFO automata exchanging over a half-duplex channel. They were studied by Cece and Finkel who established the decidability in polynomial time of several properties. These authors also identified some problems in generalising half-duplex systems to multi-party communications. We introduce greedy systems, as a candidate to generalise binary half-duplex systems. We show that greedy systems retain the same good properties as binary half-duplex systems, and that, in the setting of mailbox communications, greedy systems are quite closely related to a multiparty generalisation of half-duplex systems.

Max-Min Fairness and Sum Throughput Maximization for In-Band Full-Duplex IoT Networks: User Grouping, Bandwidth and Power Allocation

The skyrocketing growth in the number of Internet of Things (IoT) devices has posed a huge traffic demand for fifth-generation (5G) wireless networks and beyond. In-band full-duplex (IBFD), which is theoretically expected to double the spectral efficiency of a half-duplex wireless channel and connect more devices, has been considered as a promising technology in order to accelerate the development of IoT. In order to exploit the full potential of IBFD, the key challenge is how to handle network interference (including self-interference, co-channel interference, and multiuser interference) more effectively. In this paper, we propose a simple yet efficient user grouping method, where a base station (BS) serves strong downlink users and weak uplink users and vice versa in different frequency bands, mitigating severe network interference. First, we aim to maximize a minimum rate among all of the users subject to bandwidth and power constraints, which is formulated as a nonconvex optimization problem. By leveraging the inner approximation framework, we develop a very efficient iterative algorithm for solving this problem, which guarantees at least a local optimal solution. The proposed iterative algorithm solves a simple convex program at each iteration, which can be further cast to a conic quadratic program. We then formulate the optimization problem of sum throughput maximization, which can be solved by the proposed algorithm after some slight modifications. Extensive numerical results are provided to show not only the benefit of using full-duplex radio at BS, but also the advantage of the proposed user grouping method.

Coded Cooperative Data Exchange in Multichannel Multihop Wireless Networks

This article investigates the coded cooperative data exchange (CCDE) problem, where a set of nodes initially hold a subset of packets and wish to retrieve all desired packets via direct wireless communication with neighbors. The CCDE problem in multihop wired networks has seen significant research recently and is proved to be NP-hard. The CCDE problem in multihop wireless networks (MWNs) must additionally consider half-duplex constraint, interference constraint, and channel constraint. Channel assignment brings new challenges to the CCDE problem in MWN, since it is also a well-known NP-hard problem even with one channel. In this article, we study the CCDE problem in MWN with multiple channels. We first construct a path network to evaluate the priority for each possible transmission and then construct a conflict graph (CG). This graph depicts the half-duplex, interference, and channel constraints. After that, a greedy channel assignment algorithm is proposed to obtain the nonconflict transmissions based on the constructed CG and assign a channel for each selected transmission. Finally, based on the selected transmissions, we construct a single-source multicast network exploiting the time expanded network, with which the network encoding and decoding schemes can be computed within polynomial time. Extensive simulations are conducted to demonstrate the efficiency of the proposed algorithm.

Channel Estimators for Full-Duplex Communication Using Orthogonal Pilot Sequences

Full-duplex communication is desirable to maximize the spectral efficiency, despite the challenges it puts forth. The key challenge inhibiting the operation of radios in full-duplex mode is self-interference. In this paper, we propose a pilot-based channel estimation to estimate both self-interference and communication channels simultaneously at both ends of a full-duplex link using orthogonal sequences. The Cramer-Rao Lower Bound for estimators of both the channels was determined and compared with the half-duplex channel estimator. We performed simulations varying sequence length and channel taps and studied the performance of the estimators. We also studied the effect of synchronization between the sequences on the performance of the estimators. Thus, providing a solution to balance the trade-off between the accuracy of the channel estimation and the overhead added to the transmissions for full-duplex communication.

Performance of cooperative multiple‐input multiple‐output NOMA in Nakagami‐ m fading channels with channel estimation errors

The performance of a downlink non-orthogonal multiple access based cooperative network with maximum ratio transmission/receive antenna selection (MRT/RAS) over Nakagami- m fading channels in the presence of channel estimation errors (CEEs) is studied. In the system, a base station communicates with multiple mobile users through a half-duplex channel state information-based amplify-and-forward relay. All nodes are equipped with multiple antennas and the hybrid diversity technique MRT/RAS is employed in both hops. The outage behaviour of the system is investigated by driving closed-form expression for outage probability (OP). In addition, the corresponding lower and upper bounds of the derived OP are obtained. Moreover, the behaviour of the system is studied in high signal-to-noise ratio region by obtaining an error floor value in the presence of CEE as well as achieving diversity and array gains in the absence of CEE. Finally, the analytical results in the presence and absence of the CEEs are verified by the Monte Carlo simulations. Results show that the MRT/RAS scheme enhances the OP significantly and is much more robust to the CEEs in comparison with the single antenna case.

Secrecy Rate and Optimal Power Allocation of the Amplify-and-Forward Relay Wire-Tap System

In this research work, we investigate the secrecy rate and optimal power allocation schemes for a half-duplex (HD) wire-tap Rayleigh fading channel in which a source wishes to communicate securely to a destination in the presence of an eavesdropper and under the aid of an amplify-and-forward (AF) relay. The secrecy capacity and the corresponding optimal power allocation schemes are examined under both individual and joint power constraints. Due to the absence of an insightful expression of the secrecy rate for a given power allocation scheme, determining such secrecy capacity is challenging. To overcome this issue, we first propose a novel method to calculate the expectation of an exponentially distributed random variable using the exponential integral function. By exploiting this calculation, we then establish the average secrecy rate of the considered AF relay channel in closed-form. By examining the quasi-concavity of the optimal power allocation problem, it is then concluded that the problem is quasi-concave. As such, the globally optimal solution exists and is unique for both individual and joint power constraints. A simple root finding method then can be applied into the derived close-formed formula to approximately calculate the optimal power allocation scheme to achieve the secrecy capacity. Numerical results are then provided to confirm the accuracy of the derived formula and the optimality of the proposed power allocation.

Decode and forward polar coding for Half-duplex two-relay channels based on multilevel construction

ABSTRACTPolar codes represent an emerging class of error-correcting codes with power to approach the capacity of the physically degraded relay channel and relevant coding schemes have been proposed in the literature. This paper aims to design new cooperative decode-and-forward (DF) polar coding schemes for half-duplex two-relay channel based on the Plotkin’s construction illustrating their performances gain. In these schemes, we consider the use of time-division process in transmission. The source node transmits its polar-coded information to both relays and the destination nodes during the first time slot. Each relay node receives the data from the source and processes it using the DF protocol. For the second transmission period, each relay first decodes the source signal then after reconstruction of the information reduction matrix based on the multilevel characteristics of polar codes, the extracted data at each relay are recoded using another polar code and transmitted to the destination. At destination node, the signals received from each relay and source nodes are processed by using multi-joint successive cancellation decoding for retrieving the original information bits. We demonstrate via simulation results that by carefully constructed polarisation matrix at each relay node, we can achieve the theoretical capacity in the half-duplex relay channel.

Analysis of Amplify-and-Forward Cooperative Networks with Nakagami-m fading Channels For MRC Diversity Combining

In this paper we study the effect of diversity combining for Nakagami -m fading Channels in the amplify-and-forward cooperative networks.We derive the cumulative density function (CDF), probability density function (PDF) and moment generating function (MGF) for the multiple relay amplify-and-forward network with single half duplex channel maximal ratio combiner (MRC). In this network we investigate the cases of MRC at the destination, as well derive the exact Symbol Error Rate (SER) of M-ary phase-shift keying (M-PSK), and quadrature amplitude modulation (M-QAM) in Nakagami -m fading environment. We present a comparison between M-PSK and M-QAM modulation schemes in some representative scenarios where an arbitrary number of cooperative relays is considered.

Analysis of Amplify-and-Forward Cooperative Networks with Nakagami-m fading Channels For MRC Diversity Combining

In this paper we study the effect of diversity combining for Nakagami -m fading Channels in the amplify-and-forward cooperative networks.We derive the cumulative density function (CDF), probability density function (PDF) and moment generating function (MGF) for the multiple relay amplify-and-forward network with single half duplex channel maximal ratio combiner (MRC). In this network we investigate the cases of MRC at the destination, as well derive the exact Symbol Error Rate (SER) of M-ary phase-shift keying (M-PSK), and quadrature amplitude modulation (M-QAM) in Nakagami -m fading environment. We present a comparison between M-PSK and M-QAM modulation schemes in some representative scenarios where an arbitrary number of cooperative relays is considered.

Differential successive relaying scheme for fast and reliable data delivery in vehicular ad hoc networks

The high-speed mobility of modern transportation worsens the situation of unstable direct links and imprecise channel estimation, which poses challenges on fast and reliable data delivery in vehicular ad hoc networks (VANETs). The goal of the proposed scheme is to provide high-speed full-duplex relaying connectivity for unstable direct links, and reliable information detection without precise channel state information (CSI) in VANETs. In the proposed scheme, full-duplex relaying connectivity is provided by differential successive relays (DSRs) at roadside or inside other vehicles. To improve robustness of DSR without specific CSI, efficient blind interference cancellation is presented to mitigate inter-relay interference. Meanwhile, reliable information detection without precise CSI is enabled by superposition coding with differential modulation. Furthermore, the advantages, applications of DSR and complexities for real-world implementation are discussed, and the decision rule, bit error probability and ergodic capacity are theoretically obtained. Numerical results verify significant improvements in the performance of the proposed scheme when compared with conventional schemes with half-duplex relays and frequent channel estimation in VANETs.

Multiple Relay Selection for Delay-Limited Applications

A multiple relay selection system model that implements the decode-and-forward mode is investigated. All communication nodes are assumed to be equipped by multiple antennas. Furthermore, lattices space-time coded multiple-input multiple-output half duplex channel is applied. The main goal is to increase the throughput of the system by selecting multiple number of relays. The selection criteria depends on the maximum decoding delay at relays where the system implements a decoding time-out algorithm at each relay. This leads to a significant saving in the overall system power consumptions and attempts to solve the relays synchronization problem. All results are presented using numerical simulations.

OFDM Modulated Cooperative Multiple-Access Channel with Network-Channel Coding

In this paper, we consider the half-duplex cooperative multiple-access channel (CMAC) with frequency-selective block-fading. Each link employs an orthogonal frequency division multiplexing (OFDM) system, where modulated symbols are drawn from a finite constellation set. We first obtain the diversity order of the CMAC, as a function of the time sharing variables of the users and the rates of the codes. To achieve this rate-diversity tradeoff, we use the principle of network coding where messages of the two sources are jointly encoded. Both separate and joint network-channel coding approaches are considered. Specifically, we design multiple turbo codes that minimize the outage probabilities of these approaches. We also give a code structure for the multiple turbo codes to achieve full diversity of the system. The codes are optimized using the extrinsic information transfer (EXIT) chart analysis with iterative decoding tailored for OFDM modulated CMAC. Numerical examples show that with our proposed design technique, the achieved frame error rate is within 0.5dB from the information outage. Without network-channel coding, the outage probability of distributed coding cannot achieve the diversity order given in the rate-diversity tradeoff.

Achievable Rate Regions and Performance Comparison of Half Duplex Bi-Directional Relaying Protocols

In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and compare these to four existing half-duplex protocols and outer bounds. In time, our protocols consist of either two or three phases. In the two phase protocols, both users simultaneously transmit during the first phase and the relay alone transmits during the second phase, while in the three phase protocol the two users sequentially transmit followed by a transmission from the relay. The relay may forward information in one of four manners; we outline existing amplify and forward (AF), decode and forward (DF), lattice based, and compress and forward (CF) relaying schemes and introduce the novel mixed forward scheme. The latter is a combination of CF in one direction and DF in the other. We derive achievable rate regions for the CF and Mixed relaying schemes for the two and three phase protocols. We provide a comprehensive treatment of eight possible half-duplex bi-directional relaying protocols in Gaussian noise, obtaining their relative performance under different SNR and relay geometries.

Amplify-and-Forward Two-Way Relay Networks: Error Exponents and Resource Allocation

In a two-way relay network, two terminals exchange information over a shared wireless half-duplex channel with the help of a relay. Due to its fundamental and practical importance, there has been an increasing interest in this channel. However, there has been little work that characterizes the fundamental tradeoff between the communication reliability and transmission rate across all signal-to-noise ratios. In this paper, we consider amplify-and-forward (AF) two-way relaying due to its simplicity. We first derive the random coding error exponent for the link in each direction. From the exponent expression, the capacity and cutoff rate for each link are also deduced. We then put forth the notion of bottleneck error exponent, which is the worst exponent decay between the two links, to give us insight into the fundamental tradeoff between the rate pair and information-exchange reliability in the two-way relay network. As applications of the error exponent analysis to design a reliable AF two-way relay network, we present two optimization framework to maximize the bottleneck error exponent, namely: i) the optimal rate allocation under a sum-rate constraint and its closed-form quasi-optimal solution that requires only knowledge of the capacity and cutoff rate of each link; and ii) the optimal power allocation under a total power constraint and perfect global channel state information, which is shown equivalently to a quasi-convex optimization problem. Numerical results verify our analysis and the effectiveness of the optimal rate and power allocations in maximizing the bottleneck error exponent, i.e. the network information-exchange reliability.

Performance Bounds for Bidirectional Coded Cooperation Protocols

In coded bidirectional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this correspondence, we derive performance bounds for this problem for each of three decode-and-forward protocols. The first protocol is a two phase protocol where both users simultaneously transmit during the first phase and the relay alone transmits during the second. In this protocol, our bounds are tight. The second protocol considers sequential transmissions from the two users followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. In the latter two protocols the bounds are not identical. Numerical evaluation shows that in some cases of interest our bounds do not differ significantly. Finally, in the Gaussian case with path loss, we derive achievable rates and compare the relative merits of each protocol. This case is of interest in cellular systems. Surprisingly, we find that in some cases, the achievable rate region of the four phase protocol contains points that are outside the outer bounds of the other two protocols.

On cooperative source transmission with partial rate and power control

The problem of transmitting a Gaussian source over a half-duplex fading relay channel with limited channel state feedback is studied. It is shown that under a short-term power constraint, combining a simple feedback scheme with separate source and channel coding outperforms the best known no-feedback strategies even with only a few bits of feedback information. Partial power control is shown to be instrumental in achieving a very fast decaying average distortion, especially in the regime of high bandwidth ratios. Performance limitation due to the lack of full channel state information at the destination is also investigated, where the degradation in terms of the distortion exponent is shown to be significant. However, even in such restrictive scenarios, using partial feedback still yields distortion exponents superior to any no-feedback schemes.

Effect of cooperative and selection relaying schemes on multiuser diversity in downlink cellular systems with relays

In this paper, we investigate the effect of cooperative and selection relaying schemes on multiuser diversity in downlink cellular systems with fixed relay stations (RSs). Each mobile station (MS) is either directly connected to a base station (BS) and/or connected to a relay station. We first derive closed-form solutions or upper-bound of the ergodic and outage capacities of four different downlink data relaying schemes: A direct scheme, a relay scheme, a selection scheme, and a cooperative scheme. The selection scheme selects the best access link between the BS and an MS. For all schemes, the capacity of the BS-RS link is assumed to be always larger than that of RS-MS link. Half-duplex channel use and repetition based relaying schemes are assumed for relaying operations. We also analyze the system capacity in a multiuser diversity environment in which a maximum signal-to-noise ratio (SNR) scheduler is used at a base station. The result shows that the selection scheme outperforms the other three schemes in terms of link ergodic capacity, link outage capacity, and system ergodic capacity. Furthermore, our results show that cooperative and selection diversity techniques limit the performance gain that could have been achieved by the multiuser diversity technique.