156 research outputs found
Rateless Coding for Gaussian Channels
A rateless code-i.e., a rate-compatible family of codes-has the property that
codewords of the higher rate codes are prefixes of those of the lower rate
ones. A perfect family of such codes is one in which each of the codes in the
family is capacity-achieving. We show by construction that perfect rateless
codes with low-complexity decoding algorithms exist for additive white Gaussian
noise channels. Our construction involves the use of layered encoding and
successive decoding, together with repetition using time-varying layer weights.
As an illustration of our framework, we design a practical three-rate code
family. We further construct rich sets of near-perfect rateless codes within
our architecture that require either significantly fewer layers or lower
complexity than their perfect counterparts. Variations of the basic
construction are also developed, including one for time-varying channels in
which there is no a priori stochastic model.Comment: 18 page
Error and Congestion Resilient Video Streaming over Broadband Wireless
In this paper, error resilience is achieved by adaptive, application-layer rateless channel coding, which is used to protect H.264/Advanced Video Coding (AVC) codec data-partitioned videos. A packetization strategy is an effective tool to control error rates and, in the paper, source-coded data partitioning serves to allocate smaller packets to more important compressed video data. The scheme for doing this is applied to real-time streaming across a broadband wireless link. The advantages of rateless code rate adaptivity are then demonstrated in the paper. Because the data partitions of a video slice are each assigned to different network packets, in congestion-prone wireless networks the increased number of packets per slice and their size disparity may increase the packet loss rate from buffer overflows. As a form of congestion resilience, this paper recommends packet-size dependent scheduling as a relatively simple way of alleviating the buffer-overflow problem arising from data-partitioned packets. The paper also contributes an analysis of data partitioning and packet sizes as a prelude to considering scheduling regimes. The combination of adaptive channel coding and prioritized packetization for error resilience with packet-size dependent packet scheduling results in a robust streaming scheme specialized for broadband wireless and real-time streaming applications such as video conferencing, video telephony, and telemedicine
Error resilient packet switched H.264 video telephony over third generation networks.
Real-time video communication over wireless networks is a challenging problem because
wireless channels suffer from fading, additive noise and interference, which translate
into packet loss and delay. Since modern video encoders deliver video packets with
decoding dependencies, packet loss and delay can significantly degrade the video quality
at the receiver. Many error resilience mechanisms have been proposed to combat packet
loss in wireless networks, but only a few were specifically designed for packet switched
video telephony over Third Generation (3G) networks.
The first part of the thesis presents an error resilience technique for packet switched
video telephony that combines application layer Forward Error Correction (FEC) with
rateless codes, Reference Picture Selection (RPS) and cross layer optimization. Rateless
codes have lower encoding and decoding computational complexity compared to traditional
error correcting codes. One can use them on complexity constrained hand-held
devices. Also, their redundancy does not need to be fixed in advance and any number of
encoded symbols can be generated on the fly. Reference picture selection is used to limit
the effect of spatio-temporal error propagation. Limiting the effect of spatio-temporal
error propagation results in better video quality. Cross layer optimization is used to
minimize the data loss at the application layer when data is lost at the data link layer.
Experimental results on a High Speed Packet Access (HSPA) network simulator for
H.264 compressed standard video sequences show that the proposed technique achieves
significant Peak Signal to Noise Ratio (PSNR) and Percentage Degraded Video Duration
(PDVD) improvements over a state of the art error resilience technique known as
Interactive Error Control (IEC), which is a combination of Error Tracking and feedback
based Reference Picture Selection. The improvement is obtained at a cost of higher
end-to-end delay.
The proposed technique is improved by making the FEC (Rateless code) redundancy
channel adaptive. Automatic Repeat Request (ARQ) is used to adjust the redundancy
of the Rateless codes according to the channel conditions. Experimental results show
that the channel adaptive scheme achieves significant PSNR and PDVD improvements
over the static scheme for a simulated Long Term Evolution (LTE) network.
In the third part of the thesis, the performance of the previous two schemes is
improved by making the transmitter predict when rateless decoding will fail. In this
case, reference picture selection is invoked early and transmission of encoded symbols
for that source block is aborted. Simulations for an LTE network show that this results
in video quality improvement and bandwidth savings.
In the last part of the thesis, the performance of the adaptive technique is improved
by exploiting the history of the wireless channel. In a Rayleigh fading wireless channel,
the RLC-PDU losses are correlated under certain conditions. This correlation is
exploited to adjust the redundancy of the Rateless code and results in higher Rateless
code decoding success rate and higher video quality. Simulations for an LTE network
show that the improvement was significant when the packet loss rate in the two wireless
links was 10%.
To facilitate the implementation of the proposed error resilience techniques in practical
scenarios, RTP/UDP/IP level packetization schemes are also proposed for each
error resilience technique.
Compared to existing work, the proposed error resilience techniques provide better
video quality. Also, more emphasis is given to implementation issues in 3G networks
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
Reconfigurable rateless codes
We propose novel reconfigurable rateless codes, that are capable of not only varying the block length but also adaptively modify their encoding strategy by incrementally adjusting their degree distribution according to the prevalent channel conditions without the availability of the channel state information at the transmitter. In particular, we characterize a reconfigurable ratelesscode designed for the transmission of 9,500 information bits that achieves a performance, which is approximately 1 dB away from the discrete-input continuous-output memoryless channel’s (DCMC) capacity over a diverse range of channel signal-to-noise (SNR) ratios
- …