3,839 research outputs found
Joint Source-Channel Coding Optimized On End-to-End Distortion for Multimedia Source
In order to achieve high efficiency, multimedia source coding usually relies on the use of predictive coding. While more efficient, source coding based on predictive coding has been considered to be more sensitive to errors during communication. With the current volume and importance of multimedia communication, minimizing the overall distortion during communication over an error-prone channel is critical. In addition, for real-time scenarios, it is necessary to consider additional constraints such as fix and small delay for a given bit rate. To comply with these requirements, we seek an efficient joint source-channel coding scheme.
In this work, end-to-end distortion is studied for a first order autoregressive synthetic source that represents a general multimedia traffic. This study reveals that predictive coders achieve the same channel-induced distortion performance as memoryless codecs when applying optimal error concealment. We propose a joint source-channel system based on incremental redundancy that satisfies the fixed delay and error-prone channel constraints and combines DPCM as a source encoder and a rate-compatible punctured convolutional (RCPC) error control codec. To calculate the joint source-channel coding rate allocation that minimizes end-to-end distortion, we develop a Markov Decision Process (MDP) approach for delay constrained feedback Hybrid ARQ, and we use a Dynamic Programming (DP) technique. Our simulation results support the improvement in end-to-end distortion compared to a conventional Forward Error Control (FEC) approach with no feedback
Joint Scheduling and ARQ for MU-MIMO Downlink in the Presence of Inter-Cell Interference
User scheduling and multiuser multi-antenna (MU-MIMO) transmission are at the
core of high rate data-oriented downlink schemes of the next-generation of
cellular systems (e.g., LTE-Advanced). Scheduling selects groups of users
according to their channels vector directions and SINR levels. However, when
scheduling is applied independently in each cell, the inter-cell interference
(ICI) power at each user receiver is not known in advance since it changes at
each new scheduling slot depending on the scheduling decisions of all
interfering base stations. In order to cope with this uncertainty, we consider
the joint operation of scheduling, MU-MIMO beamforming and Automatic Repeat
reQuest (ARQ). We develop a game-theoretic framework for this problem and build
on stochastic optimization techniques in order to find optimal scheduling and
ARQ schemes. Particularizing our framework to the case of "outage service
rates", we obtain a scheme based on adaptive variable-rate coding at the
physical layer, combined with ARQ at the Logical Link Control (ARQ-LLC). Then,
we present a novel scheme based on incremental redundancy Hybrid ARQ (HARQ)
that is able to achieve a throughput performance arbitrarily close to the
"genie-aided service rates", with no need for a genie that provides
non-causally the ICI power levels. The novel HARQ scheme is both easier to
implement and superior in performance with respect to the conventional
combination of adaptive variable-rate coding and ARQ-LLC.Comment: Submitted to IEEE Transactions on Communications, v2: small
correction
Feedback Communication Systems with Limitations on Incremental Redundancy
This paper explores feedback systems using incremental redundancy (IR) with
noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\em
finite-length} codes (with blocklength ) and decoding attempts only at {\em
certain specified decoding times}, this paper presents the asymptotic expansion
achieved by random coding, provides rate-compatible sphere-packing (RCSP)
performance approximations, and presents simulation results of tail-biting
convolutional codes.
The information-theoretic analysis shows that values of relatively close
to the expected latency yield the same random-coding achievability expansion as
with . However, the penalty introduced in the expansion by limiting
decoding times is linear in the interval between decoding times. For binary
symmetric channels, the RCSP approximation provides an efficiently-computed
approximation of performance that shows excellent agreement with a family of
rate-compatible, tail-biting convolutional codes in the short-latency regime.
For the additive white Gaussian noise channel, bounded-distance decoding
simplifies the computation of the marginal RCSP approximation and produces
similar results as analysis based on maximum-likelihood decoding for latencies
greater than 200. The efficiency of the marginal RCSP approximation facilitates
optimization of the lengths of incremental transmissions when the number of
incremental transmissions is constrained to be small or the length of the
incremental transmissions is constrained to be uniform after the first
transmission. Finally, an RCSP-based decoding error trajectory is introduced
that provides target error rates for the design of rate-compatible code
families for use in feedback communication systems.Comment: 23 pages, 15 figure
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
Green Communication via Power-optimized HARQ Protocols
Recently, efficient use of energy has become an essential research topic for
green communication. This paper studies the effect of optimal power controllers
on the performance of delay-sensitive communication setups utilizing hybrid
automatic repeat request (HARQ). The results are obtained for repetition time
diversity (RTD) and incremental redundancy (INR) HARQ protocols. In all cases,
the optimal power allocation, minimizing the outage-limited average
transmission power, is obtained under both continuous and bursting
communication models. Also, we investigate the system throughput in different
conditions. The results indicate that the power efficiency is increased
substantially, if adaptive power allocation is utilized. For instance, assume
Rayleigh-fading channel, a maximum of two (re)transmission rounds with rates
nats-per-channel-use and an outage probability constraint
. Then, compared to uniform power allocation, optimal power
allocation in RTD reduces the average power by 9 and 11 dB in the bursting and
continuous communication models, respectively. In INR, these values are
obtained to be 8 and 9 dB, respectively.Comment: Accepted for publication on IEEE Transactions on Vehicular Technolog
First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory
This article considers the performance of digital communication systems
transmitting messages over finite-state erasure channels with memory.
Information bits are protected from channel erasures using error-correcting
codes; successful receptions of codewords are acknowledged at the source
through instantaneous feedback. The primary focus of this research is on
delay-sensitive applications, codes with finite block lengths and, necessarily,
non-vanishing probabilities of decoding failure. The contribution of this
article is twofold. A methodology to compute the distribution of the time
required to empty a buffer is introduced. Based on this distribution, the mean
hitting time to an empty queue and delay-violation probabilities for specific
thresholds can be computed explicitly. The proposed techniques apply to
situations where the transmit buffer contains a predetermined number of
information bits at the onset of the data transfer. Furthermore, as additional
performance criteria, large deviation principles are obtained for the empirical
mean service time and the average packet-transmission time associated with the
communication process. This rigorous framework yields a pragmatic methodology
to select code rate and block length for the communication unit as functions of
the service requirements. Examples motivated by practical systems are provided
to further illustrate the applicability of these techniques.Comment: To appear in IEEE Transactions on Information Theor
Optimal Control of a Single Queue with Retransmissions: Delay-Dropping Tradeoffs
A single queue incorporating a retransmission protocol is investigated,
assuming that the sequence of per effort success probabilities in the Automatic
Retransmission reQuest (ARQ) chain is a priori defined and no channel state
information at the transmitter is available. A Markov Decision Problem with an
average cost criterion is formulated where the possible actions are to either
continue the retransmission process of an erroneous packet at the next time
slot or to drop the packet and move on to the next packet awaiting for
transmission. The cost per slot is a linear combination of the current queue
length and a penalty term in case dropping is chosen as action. The
investigation seeks policies that provide the best possible average packet
delay-dropping trade-off for Quality of Service guarantees. An optimal
deterministic stationary policy is shown to exist, several structural
properties of which are obtained. Based on that, a class of suboptimal
-policies is introduced. These suggest that it is almost optimal to use a
K-truncated ARQ protocol as long as the queue length is lower than L, else send
all packets in one shot. The work concludes with an evaluation of the optimal
delay-dropping tradeoff using dynamic programming and a comparison between the
optimal and suboptimal policies.Comment: 29 pages, 8 figures, submitted to IEEE Transactions on Wireless
Communication
Reliable Transmission of Short Packets through Queues and Noisy Channels under Latency and Peak-Age Violation Guarantees
This work investigates the probability that the delay and the peak-age of
information exceed a desired threshold in a point-to-point communication system
with short information packets. The packets are generated according to a
stationary memoryless Bernoulli process, placed in a single-server queue and
then transmitted over a wireless channel. A variable-length stop-feedback
coding scheme---a general strategy that encompasses simple automatic repetition
request (ARQ) and more sophisticated hybrid ARQ techniques as special
cases---is used by the transmitter to convey the information packets to the
receiver. By leveraging finite-blocklength results, the delay violation and the
peak-age violation probabilities are characterized without resorting to
approximations based on large-deviation theory as in previous literature.
Numerical results illuminate the dependence of delay and peak-age violation
probability on system parameters such as the frame size and the undetected
error probability, and on the chosen packet-management policy. The guidelines
provided by our analysis are particularly useful for the design of low-latency
ultra-reliable communication systems.Comment: To appear in IEEE journal on selected areas of communication (IEEE
JSAC
- …