107 research outputs found
Turbo Packet Combining for Broadband Space-Time BICM Hybrid-ARQ Systems with Co-Channel Interference
In this paper, efficient turbo packet combining for single carrier (SC)
broadband multiple-input--multiple-output (MIMO) hybrid--automatic repeat
request (ARQ) transmission with unknown co-channel interference (CCI) is
studied. We propose a new frequency domain soft minimum mean square error
(MMSE)-based signal level combining technique where received signals and
channel frequency responses (CFR)s corresponding to all retransmissions are
used to decode the data packet. We provide a recursive implementation algorithm
for the introduced scheme, and show that both its computational complexity and
memory requirements are quite insensitive to the ARQ delay, i.e., maximum
number of ARQ rounds. Furthermore, we analyze the asymptotic performance, and
show that under a sum-rank condition on the CCI MIMO ARQ channel, the proposed
packet combining scheme is not interference-limited. Simulation results are
provided to demonstrate the gains offered by the proposed technique.Comment: 12 pages, 7 figures, and 2 table
On the Performance of Millimeter Wave-based RF-FSO Links with HARQ Feedback
This paper studies the performance of hybrid radio-frequency (RF) and
free-space optical (FSO) links in the cases with and without hybrid automatic
repeat request (HARQ). Considering millimeter wave (mmwave) characteristics in
the RF link and pointing errors in the FSO link, we derive closed-form
expressions for the message decoding probabilities as well as the throughput
and the outage probability of the RF-FSO setups. We also evaluate the effect of
various parameters such as power amplifiers efficiency, different transmission
techniques in the FSO link, pointing errors in the FSO link as well as
different coherence times/symbol rates of the RF and the FSO links on the
throughput and outage probability. The results show the efficiency of the
RF-FSO links in different conditions. Moreover, the HARQ can effectively
improve the outage probability/energy efficiency, and compensate the effect of
hardware impairments in RF-FSO links.Comment: Under review in PIMRC'201
Turbo Packet Combining Strategies for the MIMO-ISI ARQ Channel
This paper addresses the issue of efficient turbo packet combining techniques
for coded transmission with a Chase-type automatic repeat request (ARQ)
protocol operating over a multiple-input--multiple-output (MIMO) channel with
intersymbol interference (ISI). First of all, we investigate the outage
probability and the outage-based power loss of the MIMO-ISI ARQ channel when
optimal maximum a posteriori (MAP) turbo packet combining is used at the
receiver. We show that the ARQ delay (i.e., the maximum number of ARQ rounds)
does not completely translate into a diversity gain. We then introduce two
efficient turbo packet combining algorithms that are inspired by minimum mean
square error (MMSE)-based turbo equalization techniques. Both schemes can be
viewed as low-complexity versions of the optimal MAP turbo combiner. The first
scheme is called signal-level turbo combining and performs packet combining and
multiple transmission ISI cancellation jointly at the signal-level. The second
scheme, called symbol-level turbo combining, allows ARQ rounds to be separately
turbo equalized, while combining is performed at the filter output. We conduct
a complexity analysis where we demonstrate that both algorithms have almost the
same computational cost as the conventional log-likelihood ratio (LLR)-level
combiner. Simulation results show that both proposed techniques outperform
LLR-level combining, while for some representative MIMO configurations,
signal-level combining has better ISI cancellation capability and achievable
diversity order than that of symbol-level combining.Comment: 13 pages, 7 figures, and 2 table
Using Channel Output Feedback to Increase Throughput in Hybrid-ARQ
Hybrid-ARQ protocols have become common in many packet transmission systems
due to their incorporation in various standards. Hybrid-ARQ combines the normal
automatic repeat request (ARQ) method with error correction codes to increase
reliability and throughput. In this paper, we look at improving upon this
performance using feedback information from the receiver, in particular, using
a powerful forward error correction (FEC) code in conjunction with a proposed
linear feedback code for the Rayleigh block fading channels. The new hybrid-ARQ
scheme is initially developed for full received packet feedback in a
point-to-point link. It is then extended to various different multiple-antenna
scenarios (MISO/MIMO) with varying amounts of packet feedback information.
Simulations illustrate gains in throughput.Comment: 30 page
Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies
The paradigm shift from 4G to 5G communications, anticipated to enable ultra-reliable low-latency communications (URLLC), will enforce a radical change in the design of wireless communication systems. Unlike in 4G systems, where the main objective is to provide a large transmission rate, in URLLC, as implied by its name, the objective is to enable transmissions with low latency and, simultaneously, very high reliability. Since low latency implies the use of short data packets, the tension between blocklength and reliability is studied in URLLC.Several key enablers for URLLC communications have been designated in the literature. Of special importance are diversity-enabling technologies such as multiantenna systems and feedback protocols. Furthermore, it is not only important to introduce additional diversity by means of the above examples, one must also guarantee that thescarce number of channel uses are used in an optimal way. Therefore, it is imperative to develop design guidelines for how to enable reliable detection of incoming data, how to acquire channel-state information, and how to construct efficient short-packet channel codes. The development of such guidelines is at the heart of this thesis. This thesis focuses on the fundamental performance of URLLC-enabling technologies. Specifically, we provide converse (upper) bounds and achievability (lower) bounds on the maximum coding rate, based on finite-blocklength information theory, for systems that employ the key enablers outlined above. With focus on the wireless channel, modeled via a block-fading assumption, we are able to provide answers to questions like: howto optimally utilize spatial and frequency diversity, how far from optimal short-packet channel codes perform, how multiantenna systems should be designed to serve a given number of users, and how to design feedback schemes when the feedback link is noisy. In particular, this thesis is comprised out of four papers. In Paper A, we study the short-packet performance over the Rician block-fading channel. In particular, we present achievability bounds for pilot-assisted transmission with several different decoders that allow us to quantify the impact, on the achievable performance, of imposed pilots and mismatched decoding. Furthermore, we design short-packet channel codes that perform within 1 dB of our achievability bounds. Paper B studies multiuser massive multiple-input multiple-output systems with short packets. We provide an achievability bound on the average error probability over quasistatic spatially correlated Rayleigh-fading channels. The bound applies to arbitrary multiuser settings, pilot-assisted transmission, and mismatched decoding. This makes it suitable to assess the performance in the uplink/downlink for arbitrary linear signal processing. We show that several lessons learned from infinite-blocklength analyses carry over to the finite-blocklength regime. Furthermore, for the multicell setting with randomly placed users, pilot contamination should be avoided at all cost and minimum mean-squared error signal processing should be used to comply with the stringent requirements of URLLC.In Paper C, we consider sporadic transmissions where the task of the receiver is to both detect and decode an incoming packet. Two novel achievability bounds, and a novel converse bound are presented for joint detection-decoding strategies. It is shown that errors associated with detection deteriorates performance significantly for very short packet sizes. Numerical results also indicate that separate detection-decoding strategies are strictly suboptimal over block-fading channels.Finally, in Paper D, variable-length codes with noisy stop-feedback are studied via a novel achievability bound on the average service time and the average error probability. We use the bound to shed light on the resource allocation problem between the forward and the feedback channel. For URLLC applications, it is shown that enough resources must be assigned to the feedback link such that a NACK-to-ACK error becomes rarer than the target error probability. Furthermore, we illustrate that the variable-length stop-feedback scheme outperforms state-of-the-art fixed-length no-feedback bounds even when the stop-feedback bit is noisy
Multi-Antenna Assisted Virtual Full-Duplex Relaying with Reliability-Aware Iterative Decoding
In this paper, a multi-antenna assisted virtual full-duplex (FD) relaying
with reliability-aware iterative decoding at destination node is proposed to
improve system spectral efficiency and reliability. This scheme enables two
half-duplex relay nodes, mimicked as FD relaying, to alternatively serve as
transmitter and receiver to relay their decoded data signals regardless the
decoding errors, meanwhile, cancel the inter-relay interference with
QR-decomposition. Then, by deploying the reliability-aware iterative
detection/decoding process, destination node can efficiently mitigate
inter-frame interference and error propagation effect at the same time.
Simulation results show that, without extra cost of time delay and signalling
overhead, our proposed scheme outperforms the conventional selective
decode-and-forward (S-DF) relaying schemes, such as cyclic redundancy check
based S-DF relaying and threshold based S-DF relaying, by up to 8 dB in terms
of bit-error-rate.Comment: 6 pages, 4 figures, conference paper has been submitte
Symbol-Level Selective Full-Duplex Relaying with Power and Location Optimization
In this paper, a symbol-level selective transmission for full-duplex (FD)
relaying networks is proposed to mitigate error propagation effects and improve
system spectral efficiency. The idea is to allow the FD relay node to predict
the correctly decoded symbols of each frame, based on the generalized square
deviation method, and discard the erroneously decoded symbols, resulting in
fewer errors being forwarded to the destination node. Using the capability for
simultaneous transmission and reception at the FD relay node, our proposed
strategy can improve the transmission efficiency without extra cost of
signalling overhead. In addition, targeting on the derived expression for
outage probability, we compare it with half-duplex (HD) relaying case, and
provide the transmission power and relay location optimization strategy to
further enhance system performance. The results show that our proposed scheme
outperforms the classic relaying protocols, such as cyclic redundancy check
based selective decode-and-forward (S-DF) relaying and threshold based S-DF
relaying in terms of outage probability and bit-error-rate. Moreover, the
performances with optimal power allocation is better than that with equal power
allocation, especially when the FD relay node encounters strong
self-interference and/or it is close to the destination node.Comment: 34 pages (single-column), 14 figures, 2 tables, accepted pape
- …