ИНФОРМАЦИОННЫЕ КАНАЛЫ И СРЕДЫ /
UDC 621.39
doi:10.15217/issnl684-8853.2017.1.72
OPTIMIZATION OF ERROR CONCEALMENT BASED ON ANALYSIS OF FADING TYPES
Part 1: Statistical Description of the Wireless Video Channel, Models of BER Determination and Error Concealment of Video Signals
Ofer Hadara, PhD, Associate Professor, hadar@cse.bgu.ac.il Irina Bronfmana, MScStudent, irinamo@post.bgu.ac.il
Nathan Blaunsteina'b, Dr. Sc., Phys.-Math., Professor, nathan.blaunstein@hotmail.com aBen-Gurion Universityofthe Negev, POB 653,1, Ben Gurion St., BeerSheva, 74105, Israel bJerusalem College ofTechnology—Lev Academic Center, 21 Havaad Haleumi, P.O.B. 16031, Jerusalem, 91160, Israel
Purpose: This work is based on the recent research investigations in the combination of two subjects: Fading and Error Concealment. The main aim of the work is to present a more effective method of calculations of fading channel's parameters and to devise methods of achieving of better and more effective performance of Error Concealment, which will lead to higher quality of the video signals after passing through the fading channel. Methods: We explore the influence of fading on a communication channel, by studying the Gaussian, Gaussian, and Ricean distributions. Additionally, we explore existing methods of prediction and of Error Concealment and their influence on the video quality after its exit from the fading channel. Results: It is demonstrated that the Ricean distribution is broader and that it includes the other distributions, Gaussian (ideal channel) and Rayleigh (channel with a strong fading). Therefore, this distribution is used for tests of practical cases occurring in the video channel. On the issue of Error Concealment, a method of Symmetrical CALIC which is an optimization of the CALIC method, was implemented and compared with the original CALIC and with other methods. It has been determined that the proposed optimization yields better results than all the methods used for comparison. In addition, a new method of Error Concealment, named Balanced Percentage Calculation, is proposed. In comparison, its results are two times better on average than the results of Symmetrical CALIC, and are much better than the results of other methods used. Two themes have been combined in such a way that fading influenced the appearance of errors in the video. Those errors have been replaced by the proposed methods of Error Concealment. All practical tests and comparisons were performed using the MatLab. Practical relevance: The proposed method of calculations of fading channel's parameters allows to perform calculations for all types of channels. This method significantly facilitates work with channels in general and with necessary calculations for channels in particular. The suggested optimization of the existing method of Error Concealment and the new proposed method of Error Concealment allow to receive higher quality video after passing through the fading channel.
Keywords — Ricean Distribution, Ricean Fading, Bit Error Rate, Error Concealment, Level Crossing Rate, Average Fade Duration, CALIC, Symmetrical CALIC, Balanced Percentage Calculation, Weighted Averaging, Intra Prediction using System of Linear Equations.
Introduction
This article is based on the research of a combination of two fields: Fading and Error Concealment (EC).
Initially, the impact of three types of fading — Gaussian, Rayleigh and Ricean — in the communication channel is investigated. Typically, studies use the Rayleigh distribution for the description of the worst situation in the channel and the Gaussian distribution for the description of the best (ideal) situation in the channel. In this work, we propose using the modification of the Ricean distribution for the description of all situations in the channel. The work demonstrates that the Ricean distribution is much broader than the Gaussian and the Rayleigh types, and incorporates the latter distributions. Therefore, in the practical section of this paper, the tests and the effects of fast fading are performed using the Ricean distribution.
In addition, Symmetrical CALIC, which constitutes an optimization of one of the existing methods of EC named CALIC (Context-based, Adaptive, Lossless Image Codec) [1], has been introduced. A comparative analysis versus the original CALIC and versus the other methods is performed, and its outcome determines that the proposed optimization gives better results than all the methods used for comparison. Additionally, a new method of EC, called Balanced Percentage Calculation is proposed. The comparative analysis shows that in terms of average signal estimations, this method performs twice as well as the Symmetrical CALIC, and much better than other methods used for comparison.
There are many works on processing and transmitting video over wireless communication channels. For example, [2] proposes an adaptive hybrid digital-analog video transmission scheme for robust video streaming in mobile networks with realistic fading channels. This scheme differs from other
researches by not assuming wireless channels to be Gaussian, which is critical for fading channels [3] proposes a joint source-channel coding scheme for the delivery of scalable video over Multi Input Multi Output (MIMO) wireless systems. In it, aiming to improve the power efficiency of the MIMO-system, authors explore how to allocate sub-channels and transmit power to the video layers under constraints of video quality and delay. [4] analyzes the impact of bit errors on the perceived video quality. This impact depends on error resilience of the data format, EC mechanism used and characteristics of the bit error pattern. In tests the authors implement various error resilient tools at the transmitter side and at the receiver. Errors that require interactive feedback on dynamic channel conditions are discussed. [5] presents a rate-optimization procedure for the transmission of scalable video sequences of the H.264/AVC standard over wireless channels. Currently existing studies present neither a wireless channel with Ricean fading nor the influence of this type of fading on the appearance of errors in the video file, whereas our study addresses this issue.
There is also a lot of research on the topic of EC for video and especially on EC for video transmitted over wireless channels. For instance, [6] presents an EC system for overcoming visible distortions in video sequences which are transmitted over a losses prone communication network. This system provides an EC solution from the point of receiving the transmitted sequence by the decoder without human interference. [7] presents a hybrid EC algorithm for compressed video sequences, based on temporal and spatial concealment methods. The article develops post-processing techniques for the reconstruction of missing or damaged macroblocks. The authors propose a support of decision tree for efficiently choosing the best appropriate EC method, according to the spatial and temporal characteristics of the sequence. [8] studies the effectiveness of Flexible Macroblock Ordering in mitigating the impact of errors on the decoded video and proposes solutions to improve the EC on H.264 decoders. Study [9] proposes hybrid EC technique. In spatial domain, three methods: Weighted Average Interpolation, Directional Interpolation and Transformed Based Concealment are implemented and compared on various noises. To reduce the computational complexity and better quality, proposed a hybrid spatial-temporal video EC technique is proposed. It includes mode selection based on boundary matching decision. [10] presents a progressive block matching algorithm (PBMA) that performs EC in order to recover visual quality. The PBMA utilizes the Euclidean distance to consider the affection of corrupted-residual in block matching principle. The PBMA successively recovers the corrupted macroblock with minimizing the impact of corrupted-residual by Euclidean
distance information. Prior to our work, EC by symmetrical method has not been introduced in a previous study. Moreover, the CALIC method [1], on which the Symmetrical CALIC Concealment method is based, has not been used for EC, only for the prediction of the lost pixels. We also considered the possibility of using this method for both asymmetric and symmetric EC. In addition, no one has previously used balanced calculations to perform EC, a method proposed and tested in our work.
The main aim of the work is devising a method for more accurate analysis of EC. This goal was achieved as can be seen in the results of practical simulation.
The first Section's work deals with the background and defines the main goal of the work. The second section of this article presents a theoretical base of Slow and Fast fading, and Temporal and Spatial EC Methods. The third section presents Mathematical and Statistical Description of Wireless Channel with fading. The fourth section constitutes a description of Modified and New Models of EC in Channel with Fading. The fifth section of the article talks about the simulation, the sixth section shows the comparative results of the calculations, and the seventh section summarizes the work and gives recommendations for future research.
The article is divided into two parts. First (this) part presents statistical description of the wireless video channel, existing and modified models of Bit Error Rate (BER) determination and existing models of EC of video signals. Second part presents a description of modified and new models of EC of video signals in channel with fading, and then it shows the practical simulation and its results.
Overview
Slow and Fast Fading
Slow fading. The slow variations of spatial signals (expressed in decibels, dB) typically have a lognormal distribution or Gaussian distribution (expressed in watts, W) [11-19]. The probability density function (PDF) of the signal changes in accordance with the corresponding standard deviation and with the mean over a certain period of time or in a separate small area. This function depends on the nature of the terrain and on the nature of the atmospheric and ionospheric conditions. This PDF is determined by:
PDF(r) = exp J- ^^ L (1) aL\l2n [ 2<Jl J
where r is the value of the received signal strength or voltage envelope; r = (r) is the mean value
of the random signal level; ctl r2 -(r j ^ is
the variance or time-average power ((r) indicates
the averaging operation of a variable r of the received signal envelope).
Fast fading. In the case of a stationary transmitter and receiver (static multipath channel), due to multiple reflections and scattering from various obstacles surrounding the transmitter and receiver, the radio signals travel along different paths of varying lengths, thereby producing such fast deviations from the signal strength (in volts, V) or power (in watts) at the receiver.
In the case of dynamic multipath situation, subscribers' antenna is moving, and the spatial variation of the resultant signal at the receiver can be regarded as the time variations [20, 21]. The signal received by the mobile antenna at any point in space may consist of a plurality of signals having randomly distributed amplitudes, phases and angles of signal arrival, as well as different time delays. All these features change the relative phase shift depending on the spatial position and, finally, lead to signal fading in the space domain. In the dynamic (mobile) multipath situation, the signal fading happens in the mobile receiver in the time domain. This is a temporary fading due to the frequency shift of the emitted stationary transmitter. In fact, the changes in time or dynamic changes of the propagation path lengths associated with the Doppler effect, which is created due to relative movement between the stationary base station and the moving subscriber.
To illustrate the effects of changes in the phase in the time domain due to the Doppler frequency shift (Doppler effect [11-19]), let consider a helicopter moving at a constant velocity V along the path XY (Fig. 1). The difference in path lengths driven by the signal from the source S to a mobile phone at the points X and Y is Al = lcos6 = VAtcos6, where At is the time required for moving receiver to move from point X to point Y along the way, and 6 is the angle between the mobile direction along the XY and the direction to the source at the current point Y, that is, YS. The change of phase of the resultant received signal is created due to the difference in path length, thus:
A® = kAl = — I cos 0= cos 0. (2)
X X
Hence it is evident that a change of the radiated frequency, or Doppler shift, is given by fD:
fn = — = — cos 0. v 2% At X
(3)
It is important to note from Fig. 1, that the angles at points X and Y are equal only when the corresponding lines XS and YS are parallel. Therefore, this figure is valid only in the limit, when the ter-
Remote source (S)
Y
X
—W Iif
V ^ - ■
Fig. 1. Geometry of the mobile link for Doppler effect estimation
minal S is far away from the moving antenna at the points X and Y. The maximum Doppler shift is fn = V / X, it is denoted as fm here.
max m
There exist a large number of probability distribution functions that could be used to describe the fast fading effects, such as Rayleigh, Suzuki, Ricean, Gamma, Gamma-Gamma and etc. The Ricean distribution is very general [11-19] as it includes both the line-of-sight (LOS) with scattering and diffraction and the non-LOS. In order to evaluate the contribution of each component of the signal at the receiver, i.e. dominant (or LOS) and secondary (or multipath), the Ricean parameter K is usually introduced as a ratio between these components [11-19], i.e.:
K =
LOS-Component power Multipath-Component power
(4)
The Ricean PDF distribution of the signal strength or voltage envelope r can be defined as [1-19]:
PDF(r ) = — exp
r 2 + A2
CT- L 2ctz for A > 0, r > 0,
(5)
where ct is the standard deviation of signal envelope; A is the peak strength or voltage of the dominant component envelope; 70(-) is the modified Bessel function of the first kind and zero-order.
According to (4), it's possible rewrite the parameter K, which was defined above, as the ratio be-
d
tween the dominant and the multipath component power. This parameter is given as follows:
K =-
2<5¿
(6)
Using (6), it's possible rewrite (5) as a function of K only [11-13, 18]:
PDF(r) = ^ exp J 1 exp(-tf) !01 ~J¿K I. (7)
2ctz
Using such presentation of Ricean PDF, one can easily obtain the mean value and the variance as functions of the parameter K, called also the fading parameter. Thus, according to definitions of the mean value and the variance [13, 14], is get:
|ar (K) = J r ■ PDF(r)dr =
o
(1 + K)I0 ^2Kr) + KI1 (K / 2)
(8)
<3;
'(K) = J
r2 • PDF(r)dr = 2(1 + K) -y?r. (9)
Here, /1() is the modified Bessel function of the first kind and first-order. For K = 0: exp(-K) = 1 and 70(0)=1, that is the worst case of the fading channel.
The Rayleigh PDF, when there is no LOS signal and is equal to:
2 ]
(10)
PDF(r) = ^ exp
ct I 2ct
Temporal and Spatial Error Concealment Methods
Temporal EC. In the natural form of a sequence of low resolution, the correlation between two consecutive frames is higher than the correlation of pixel values in the same block (frame) [22, 23]. Consequently, in most instances the temporal interpolation provides better means for masking errors than spatial interpolation.
If the remains are lost, but the motion vectors were taken correctly, the easiest way to decipher the missing blocks is to reset the missing remains to zero. This scenario occurs when data sharing is used. "Decoding without residues" method performs well if the missing remains are small. On the other hand, the residues are small if the sequence contains mainly linear movement, which can be easily predicted.
If all the information macroblock is lost, a simpler method, called the "copy-paste" method (also
called zero-motion EC) [22], can be applied: the lost block is replaced by a spatially corresponding block in the previous frame. This method performs well only for sequences with low traffic. The best performance is provided by motor-compensated interpolation techniques. Methods for assessing the motion vector predicted the motion vector of the missing block in accordance with motion vectors of neighboring blocks (spatial — within one frame, or time — from previous frames).
Motion vector interpolation may lead to formation of blocking artifacts, especially in case of video sequences with non-uniform motion, and/or non-linear motion. Thus, in Chen et al. (1997) an improved method is provided. It sets weight in accordance with the "side match criterion". The side match criterion measures the difference between the pixel values at the boundary and inside the block, a motion vector obtained by interpolation. Parts with higher coincidence receive higher weights. In implementing substitutions, the side match criterion is used to select a motion vector — the vector of the block with the best side match is selected.
The motion vectors are correlated in the temporal domain in addition to the spatial one. Thus, besides the spatial interpolation of a motion vector, or in cases where spatially adjacent motion vectors are not available, temporary interpolation motion vector is the best one. The efficiency of a temporal interpolation of motion vector depends strongly on the temporal characteristics of the video stream. Performance of this interpolation method is greatly reduced as the frame rate decreases. Applying the average of the previous and subsequent frames may improve performance of the method, although it may lead to increased delay and storage.
Spatial EC. The spatial EC only uses information from the processed image to reconstruct the lost area. The quality of the reconstruction essentially depends on the spatial characteristics of the latent image, given only the distribution of edges [22, 23]. The approaches to concealment of missing parts with different spatial characteristics are not necessarily equal. While smooth portions may be interpolated by a simple averaging or by optimizing a cost function of smoothness, more complicated methods have to deal with regions containing edges [22, 23]. The smoothing should be done only along the edges, and the edges must be extended. The image resolution together with the size and shape of lost area determines solutions of an interpolation problem.
The simplest method of spatial EC is an interpolation of the missing block using the average value of the boundary pixel values. However, this leads to a monotonic interpolation of the block, indistinguishable from the rest of the picture, especially if the missing block is not smooth. The method of
a)
Mi
M2
(1-^2)
b)
left
up
right
ddown
Fig. 2. Weighted Averaging: b — scheme 2
a — scheme 1;
"weighted average" (Sun and Reibmann, 2001) improves on average the previous weighting contributions boundary points, depending on the distance between the interpolated pixel and the other abroad (opposite boundary).
It should be noted that this method works well in restoring parts containing only one dominant direction. However, it does not provide satisfactory results, if a larger number of dominant edges are included in the lost region. Furthermore, if the intersecting edges of the missing block that are based on the aimed pixel are not linear, interpolation may lead to creation of unpleasant artifacts.
In our work we suggest the spatial method of EC. This method is compared to existing spatial techniques and to their variants which have been suggested during our research. These techniques are presented below.
Weighted Averaging. Weighted averaging is a method that recovers the missing pixel value by calculating the average pixel values from the four pixels in the four one-pixel wide boundaries of the damaged block weighted by the distance be-
Fig. 3. Partial Weighted Averaging
tween the missing pixel and the four blocks boundaries (upper, down, left and right boundaries) as shown on Fig. 2, a and b [24]. The formula for calculating the missing pixel value (scheme 1) is:
missed
[Ml • Pleft + (1 -Mi )• Pright\
2
[M2 ' Pup + (1 _M2 )' Pdown ]
or (scheme 2):
P.'missed = (dleft ' P.'left + dright ' Pright + ^ ddown ' Pdown ) /
+ d ■ P
^ "up -*■ up
/(dieft + dright + dup + ddown ).
(12)
Partial Weighted Averaging. Partial Weighted Averaging method based on the original Weighted Averaging method. It recovers the missing pixel value by calculating the average pixel values from the two pixels in the two nearest one-pixel wide boundaries of the damaged block weighted by the distance between the missing pixel and the two blocks boundaries (upper and left, upper and right, down and right, down and left boundaries) as shown on Fig. 3. The formulas for calculating the missing pixels values are:
P =
missed _ left _ up _ d-left _ up ' Pleft _ up + dUp _ ieff • PUp _ ieff ^
dleft _ up + dup _ left
p —
■'■missed _ right _ up
d ■ P + d ■ P
_"right _ up ■'■right _ up^"up _ right ±up _ right _
d-right _ up + dUp _righf
MHOOPMAUMOHHblE KAHAAbl M CPEAbl
B E
\ / P1 P2 \ P4
F y P3 /
/ G P5 \ P6 / P7 P8
H P9 P10 P11 P12
I P13 P14 P15 P16
Fig. 4. Intra Prediction using System of Linear Equations by left top down scanning
^missed _ right_down right_down ' right_down ddown _ right ' 'down _ right) /
/ {d-right _
down ddown _ right
'missed _ left _ down
>>
~(dleft _ down ' ^left _ down ddown _left ' ^down _ left) /
/ (dleft _
down ddown _ left)'
(13)
Intra Prediction using System of Linear Equations (ISLE) by left top down scanning. Intra Prediction using System of Linear Equations uses the system of linear equations, which is a simple and effective tool applied almost everywhere [25, 26] for missing pixels value calculation. In the calculation, each pixel is the average of its nearest neighbours, when the top row and left column are known (pixels A-I on Fig. 4).
A (NxN)-size block generates N2 unknowns (number of pixels in lost block) and correspondingly N2 equations, which are solved using the matrix representation. The formulas for calculating the missing pixels values for block on Fig. 4 are (clockwise from left top pixel):
P =■
A + B + C + P2 + Pq + P5 + G + F
P? =-
B + C + D + P3 + Pj + Pfi + P; + p
5 ^ n
8
Pq =
C + D + E + P4 + P8 + Pj + PQ + P2 8 :
Pa =
D + E + P8 + Pj + P3
P5 =
F + Pi + P2 + Pq + Pio + Pg + H + G 8
Pfi =
Pi + P2 + P3 + Pj + Pn + P10 + Pg + P5 8
Pj =■
P> + Pq + Pa + P« + P\2 + Pi + Pn + P
rll
P« =-
Pq + Pa + P\2 + Pi + P
rll
Pq =
G + P, + PQ + P10 + P14 + P13 +1 + H 8 '
PlO =
P, + Pq + Pj + pn + pi5 + pi4 + pi3 + P9 8
Pll =■
Pfi + Pj + Pa. + Pi2 + Pfi + Pk + PA + P
16
r15
r14
r10 ,
Pl2 =■
P7 + P8 + P16 + Pfi + P
"15
r14
Pis =■
H + PQ + P10 + P14 + I
8
Pl4 =-
Pq + P10 + Pi + Pfi + P
'11
r15 -r -TL3
^15 =
P10 + Pi + Pl9 + Pfi + P
rll
'12 + ^16
r14
Pl6 =
Pn + P9 + P
'12 T ^15
(14)
Now there are 16 equations for 16 unknowns P1-P16 which are solved using the matrix form of system of linear equations Ax=B, where vector x is
P1-P16.
Intra Prediction using System of Linear Equations by symmetric scanning (ISLE). The Symmetric Intra Prediction using System of Linear Equations, as ISLE [25, 26], uses the system of linear equations for missing pixels value calculation. In the calculation, each pixel is the average of its nearest neighbours, when the top and bottom rows, and left and right columns are known (pixels A-T on Fig. 5).
Here, as in ISLE, (NxN)-size block generates N2 unknowns (number of pixels in lost block) and correspondingly N2 equations, which are solved using the matrix representation. This technique is more effective than ISLE due to additional known information (additional known pixels). It should be noted that due to the symmetry, the number of the lost pixels changes.
The formulas for calculating the missing pixels values for block on Fig. 6 are (clockwise from left top pixel):
P =:
A + B + C + P9 + Pa + Pq + S + T
8
B
T
R
prn
P1 * k >i
P3
P15
P13
P
O
D
P4
P16
P14
N
E F
P6--P5 -G
\
P7
P8
P12
P10
M
P11
X f XI P9
l
H
j
K
Fig. 5. Intra Prediction using System of Linear Equations by symmetric scanning
P2 =
B + C + D + p6 + p8 + p4 + P3 + Pi
Po =-
T + Px + P2 + P4 + PiQ + Pi5 + # + s_
Pi =
+ p2 + pfi + p« + p19 + p1fi + p1fi + p
8 ^ ^12 T ^16 ^ ^15 ^ ^3
.d + E + p + g + # + p7 + p8 + p
3s =-
8
=
c + d + e + p5 + pj + p8 + p4 + p2 8
Pj =
PQ + p, + G + H +1 + pn + p12 + p8 8
P« =
p2 + p6 + p5 + pj + pn + p12 + p16 + p4
Pq =
8
p12 + pn +1 + j + K + l + M + p
'10 .
P10 =
p16 + p12 + pn + p9 + L + M + N + p
'14
P11 =
p8 + p7 + h + i + j + pq + p1n + p
9 ^ -TLO ^12
Pl2 =
p4 + p8 + p7 + pn + pg + p10 + pl4 + pie
PlZ =
8
# + p15 + p16 + p14 + n + o + p + q 8 5
Pn =
p15 + p16 + p12 + p10 + m + n + o + p
'13
P15 =
8
S + p3 + p4 + p16 + p14 + p13 + q + R 8 '
nn n ne
nw n _ \ ne
ww \ w P1 P2 P3 P4
P5 P6 P7 P8
P9 P10 P11 P12
P13 P14 P15 P16
Fig. 6. Neighboring pixels used in prediction and modeling, and the estimated gradients of the image for standard CALIC by left top down scanning
P16 =
p3 + p4 + p8 + p12 + p10 + p14 + p13 + p15 (15) 8 . ( )
Now there are 16 equations for 16 unknowns P1-P16 which are solved using the matrix form of system of linear equations Ax=B, where vector x is
P1-P16.
Standard CALIC by left top down scanning. CALIC is the special framework that obtains higher lossless compression of continuous-tone images than other lossless image coding techniques mentioned in the literature [1]. This high coding efficiency is achieved with relatively low time and space complexities. CALIC is a sequential coding scheme that encodes and decodes in raster scan order with a single pass through the image. The coding process uses prediction and context templates that involve only the two previous scan lines of coded pixels. Consequently, the encoding and decoding algorithms require a simple two-line buffer that holds the two rows of pixels that immediately precede the current pixel.
Fig. 6 presents the neighboring pixels used in prediction and modeling, and the estimated gradients of the image, when P1 is the first (in missed block) predicted pixel Ip[i, j], let's mark it Ip. All the definitions and the prediction (that is concealment) showed in [1] and it is the procedure for left corner in our suggested modified method.
Mathematical and Statistical Description of Wireless Channel with Fading
Following [27, 28] we propose using the Ricean law, described by Ricean cumulative distribution function (CDF) and probability density function, for all the situations in the channel, including the worst
2
S
I
and the best cases. From a practical point of view, the mean and the variance of Ricean distribution are used applying the Ricean fading parameter, K. Following expression (8), according to [29], for K < 2:
- <*> =1+U
where as for K > 2:
^ (K)=V2K Ii--L+J_
K 4 K K2
(16)
(17)
The same approximations can be obtained for the variance following derivations of expression (9) made in [29]. Thus, for K < 2:
a? w = 1 -I i -1) exp {-*
where as for K > 2:
^ =1 " ^l1 + i - £
(18)
(19)
Using relations between the PDF and CDF, expression (10) allows us to obtain the Rayleigh CDF presentation:
R
CDF(R) = Pr(r < R) = J PDF(r )dr =
o
-,2 1
= 1 - exp <!-
2 ct2
(20)
Using (7) for the Ricean PDF, there is a more difficult formula for Ricean CDF with respect to Rayleigh CDF due to summation of an infinite number of terms, such as:
CDF(R) = 1 - exp<>-
.2 >
K +-
2a
<s
m=0
r J
f<3r-j2K \ f r-4ÏK ^
Gr
\ r y
(21)
Here Im() is the modified Bessel function of the first kind and m-th order. Once more, the Ricean CDF depends only on parameter K and is limited to the Raleigh CDF and the Gaussian CDF for K = 0 and for K-^<x> respectively. Clearly, the CDF formula (21) is more complicated to evaluate analytically or numerically than the PDF formula (7). However, in practical terms, it is sufficient to use m up to the value where the last term's contribution becomes less than 0.1%. It was shown in [17] that for a Ricean CDF with K = 2, the 14 dB of a fading outage probability is about 10-2.
New method for the determining of BER in Ricean fading channel is offered by [30]. In order to calculate the BER, this method uses level crossing rate (LCR) and average fade duration (AFD).
Level crossing rate, Nx, is the expected rate at which the received signal envelope crosses the threshold in a positive-going or negative-going direction [31]. AFD, <x>, is the average period of time for which the receiver signal envelope is below a threshold X [31]. We present the formulas of the LCR and the AFD according to [32]. The LCR formula is:
, , 2xJ2ç -ix2 +p2 V^(o)
ZK (0)
f ^ cosh Jo
2Xp cos a
^psma+V^psinaQ(£psina)]da, (22)
where X is the level of the received input signal (threshold); Q() is the error function [29, 31, 33]:
(23)
where
erf^JLjV^dy; (24)
p is the amplitude of the LOS component of the signal strength [31]:
P =
K
(25)
CT is the standard deviation [31]:
1 b Im[T(0 )}2 g K 2K(0)
(26)
and I is presented from [31] by the following expression:
1 =
aD cosa0 --
T(oT
V2ç
(27)
where a and a0 are the angle and the initial angle between the transmitting and receiving antennas and the functions K(0), K'(0) and K"(0) are defined in [32] as:
K (°)= *
K +1
*'(0) = -
К +1
'JD
2(К +1)
cos6-12 {k)
I о (k) ;29-!2(k)
1 +
^o (k)
(28)
where K (K-factor) is one of inputs that defines the relative strength of LOS component and the multipath scattered component; In(k), n=1, 2, 3, ... are the n-th order modified Bessel functions of the first kind; k is the beamwidth of arriving waves, 6 is the angle between the average scattering direction and the mobile vehicle direction.
The AFD can be defined as:
<x>
= CDF (X )>
N
(29)
where CDF(X) is the probability of the event in which the received signal envelope does not exceed a specific level X, that is:
^ ) = ^ S ^ •
(30)
where xi is the duration of the fade and T is the observation interval of the fading signal (see Fig. 7), when:
Nx =1
M
(31)
After inserting the (30) in the (28), the resulting AFD defines percent of the bit time duration affected by Ricean fading. In order to calculate the BER the following formula is used:
BER = PR =
number of bits in error per second number of bits in data per second
(32)
in which the number of bits in data per second constitutes the rate (R) of bit stream and the number of bits in error per second constitutes the LCR [31]. Put differently, LCR is the number of crosses per second, Nx. Therefore, (32) can be written as:
BER = -
R
(33)
In further computations the above formula is used to estimate the BER in the channel with the Ricean fading. It is necessary to note that the LCR (Nx) is a general expression for the envelope LCR and contains the formula of Rayleigh Nx from [29, 34, 35], taking into account as well the notion that it is a formula of LCR for the channel with Rayleigh fading:
Nx =-j2nfm qe
,-ç
(34)
Thus, (22) contains a special case of Rayleigh fading, usually used for Doppler effect estimation through the LCR estimates [19, 36, 37]. On this basis, it can be assumed that the formula of BER calculating for the channel with Ricean fading using different K-factor values allows us to get the BER of the channel with Rayleigh fading (low K) and the BER of the channel with Gaussian fading (high K). It follows that Ricean distribution law covers both the Rayleigh and Gauss laws. This is achieved by using the Ricean parameter of fading, K, which in situations of bad clearance between two terminals (K^0) transforms Ricean CDF and PDF to their Rayleigh counterparts [described by (10)], and in situations of good clearance between two terminals without any multipath components (K^xi) transforms Ricean CDF and PDF to their Gaussian counterparts yielding "Dirac-delta shaped" PDF [described by (1)] (Fig. 8) [29].
Such it is clear that the Ricean channel behaves like AWGN channel in the limit as K-^x>, and like Rayleigh multipath channel when K = 0 or K-^0.
И
о
S £
£ £ m w
l1 l2 l3 4 5
Fig. 7. The illustration of definitions of the signal fading statistical parameters LCR and AFD
■ Fig. 8. Ricean PDF distribution versus ratio of signal to rms
1. Wu X., and Memon N. CALIC — a Context Based Adaptive Lossless Image Codec. Proc. Int. Conf. on Acoust., Speech, Signal Processing, Atlanta, GA, May 1996, pp. 1891-1894.
2. Zhao X., Lu H., Chen C. W., and Wu J. Adaptive Hybrid Digital-analog Video Transmission in Wireless Fading Channel. IEEE Trans. on Circuits and Systems for Video Technology, 2016, no. 6, pp. 1215-1223.
3. Shen X., Tang L., and Zhang X. A Video Transmission Scheme Based on Scalable Video Coding over MIMO Wireless Systems. Intern. Conf. on Wireless Communication and Sensor Network, 2014, 6 p.
4. Purandare R. G., Kshirsagar S. P., Kol S. M., and Go-hokar V. V. Impact of Bit Error on Video Transmission over Wireless Networks and Error Resiliency. Intern. Conf. on Image Information Processing (ICIIP), 2011, 6 p.
5. Bocus M. Z., and Coon J. P. Rate-Optimization for Scalable Video Transmission over Wireless Networks. IEEE Press, 2014. 287 p.
6. Hadar O., Huber M., and Huber R. Hybrid Error Concealment with Automatic Error Detection for Transmitted MPEG-2 Video Streams over Wireless Communication Network. Intern. Conf. on Information Technology: Research and Education, 2006, 6 p.
7. Hadar O., Huber M., Huber R., and Greenberg S. New Hybrid Error Concealment for Digital Compressed Video. EURASIP Journal on Applied Signal Processing, 2005, no. 6, pp. 1821-1833.
8. Mazataud C. Error Concealment for H.264 Video Transmission. A Thesis Presented to the Academic Faculty, In Partial Fulfillment of the Requirements for the Degree of Master of Science in the School of Electrical and Computer Engineering, Georgia Institute of Technology, 2009. 94 p.
It should be noted that the using of the formula for calculating the BER in the Ricean channel with the aim of receiving BER of AWGN and Rayleigh channels is logical and convenient, because usually there exists a spectrum of "average" cases with "medium" levels of noise, interferences and errors. These average cases produce the Ricean channel, and in "extreme" cases it is possible to quickly get the BER for Rayleigh and Gaussian channels without changing the concept.
To demonstrate the veracity of the BER, calculated using LCR formula for three models of channels, the graph has been constructed. This graph demonstrates that different values of K are obtained curve BER. The graph also shows that a low K leads to the BER closer to Rayleigh case, while a high K leads to the BER closer to Gauss occasion. All the results are shown and described in the Part 2.
9. Patel D., and Patel J. Hybrid Spatio-Temporal Error Concealment Technique for Image/Video Transmission. IEEE Proc., 2014, no. 5, pp. 814-823.
10. Lee Y. H., and Wu T. H. Video Error Concealment Using Progressive Block Matching Algorithm with Euclidean Distance. Eighth Intern. Conf. on Intelligent Information Hiding and Multimedia Signal Processing, 2012, 6 p.
11. Jakes W. C. Microwave Mobile Communications. New York, John Wiley & Son, 1974. 480 p.
12. Steele R. Mobile Radio Communication. IEEE Press, 1992. 395 p.
13. Stuber G. L. Principles of Mobile Communications. Boston-London, Kluwer Academic Publishers, 1996. 497 p.
14. Blaunstein N., and Andersen J. B. Multipath Phenomena in Cellular Networks. Boston-London, Artech Houses, 2002. 296 p.
15. Saunders S. R. Antennas and Propagation for Wireless Communication Systems. New York, John Wiley & Sons, 1999. 409 p.
16. Bertoni H. L. Radio Propagation for Modern Wireless Systems. New Jersey, Prentice Hall PTR, 2000. 258 p.
17. Blaunstein N. Wireless Communication Systems. Chapter 12. In: Handbook of Engineering Electromagnetics. Ed. by Rajeev Bansal. New York, Marcel Dekker, 2004. 67 p.
18. Rappaport T. S. Wireless Communications. New York, Prentice Hall PTR, 1996. 642 p.
19. Lee W. Y. C. Mobile Cellular Telecommunications Systems. New York, McGraw Hill, 1989. 563 p.
20. Leon-Garcia A. Probability and Random Processes for Electrical Engineering. New York, Addison-Wesley Publishing Company, 1994. 349 p.
21. Stark H., and Woods J. W. Probability, Random Processes, and Estimation Theory for Engineers. New Jersey, Prentice Hall, 1994. 376 p.
22. Goldsmith A. J., and Chua S. G. Variable-Rate Variable-Power MQAM for Fading Channels. IEEE Trans. Communia., 1997, no. 11, pp. 1218-1230.
23. Chen T. P.-C., and Chen T. Second-Generation Error Concealment for Video Transport over Error-Prone Channels. Wireless Communie. and Mobile Computing, 2002, no. 4, pp. 607-624. doi:10.1002/wcm.83
24. Sun M. T., and Reibman A. R. Compressed Video over Networks. New York, Marcel Dekker, 2001. 358 p.
25. Doshkov D., Ndjiki-Nya P., Lakshman H., Koppel M., and Wiegand T. Towars Efficient Intra Prediction Based on Image Impainting Methods. 28th Picture Coding Symp, PCS2010, December 8-10, 2010, Nagoya, Japan, 6 p.
26. Chen B. N., and Lin Y. Selective Motion Field Interpolation for Temporal Error Concealment. Intern. Conf. on Computer and Communication Engineering 2006 (ICCCE 2006), Kuala Lumpur, Malaysia, May 9-11, 2006, 6 p.
27. Blaunstein N., Arnon S., Zilberman A., and Kopeika N. Applied Aspects of Optical Communication and LIDAR. Taylor and Francis Group, 2010. 262 p.
28. Blaunstein N. Radio Propagation in Cellular Networks. Boston-London, Artech House, 2000. 386 p.
29. Blaunstein N., and Christodoulou C. G. Radio Propagation and Adaptive Antennas for Wireless Communication Networks. New Jersey, John Wiley & Sons, 2007. 614 p.
30. Blaunstein N., and Yarkoni N. Data Stream Parameters Prediction in Land and Atmospheric MIMO Wireless Communication Links with Fading. 2nd European Conf. on Antennas and Propagation (EUCAP 2007), Edinburgh, November 2007, pp. 123-126.
31. Tepedelenlioglu C., et al. Estimation of Doppler Spread and Spatial Strength in Mobile Communications with Applications to Handoff and Adaptive Transmissions. J. Wireless Communie. Mobile Computing, 2001, no. 2, pp. 221-241.
32. Goldsmith A. J. Wireless Communications. New Jersey, Wiley & Sons, 2004. 419 p.
33. Modulation and Coding Techniques in Wireless Communications. Ed. by E. Krouk and S. Semenov. United Kingdom, Wiley, 2011. 662 p.
34. Katz B., Greenberg S., Yarkoni N., Blaunstien N., and Giladi R. New Error-Resilient Scheme Based on FMO and Dynamic Redundant Slices Allocation for Wireless Video Transmission. IEEE Trans. on Broadcasting, 2007, no. 1, pp. 127-135.
35. Rappaport T. S. Wireless Communications Principles and Practice. New York, Prentice Hall, 1996. 452 p.
36. Blaunstein N., and Cristodoulou Ch. Radio Propagation and Adaptive Antennas for Wireless Communication Networks. New Jersey, Hoboken, John Wiley & Sons, 2014. 683 p.
37. Molisch A. F. Wireless Communications. London, Wiley and Sons, 2006. 622 p.
УДК 621.39
doi:10.15217/issn1684-8853.2017.1.72
Оптимизация маскирования ошибок на основе анализа затухания типов фадинга Часть 1: Статистическое описание беспроводного видеоканала, модели определения BER и маскирования ошибок видеосигналов
Хадар Офера, Phd, доцент Бронфман Ирина6, MSc студент
Блаунштейн Натана>6, доктор физ.-мат. наук, профессор аНегевский университет им. Бен-Гуриона, г. Беэр-Шева, Израиль
6Иерусалимский технологический институт, Иерусалим, Израиль
Цель исследования: представить наиболее эффективный метод расчетов параметров канала с затуханием и разработать методы достижения лучшего и более эффективного выполнения замещения ошибок, что повысит качество видео после прохождения через канал с затуханием. Методы: исследованы влияние затухания на канал связи при помощи изучения распределений Гаусса, Рейли и Райса, а также существующие методы прогнозирования и замещения ошибок и их влияние на качество видео после выхода из канала с затуханием. Результаты: показано, что распределение Райса более широкое и охватывает другие виды распределения — Гаусса (идеальный канал) и Рейли (канал с затуханием), поэтому, именно это распределение было использовано для тестирования практических случаев, возникающих в видеоканале. По теме замещения ошибок проведена оптимизация метода CALIC, названная Симметричный CALIC (Symmetric CALIC). Реализовано сравнение данной оптимизации с оригинальным методом CALIC и с другими методами и определено, что предлагаемая оптимизация показывает лучшие результаты, чем все использованные для сравнения методы. Предложен новый метод замещения ошибок, названный Сбалансированным Процентарным Расчетом (Balanced Percentage Calculation), в сравнении показавший в среднем в два раза лучшие результаты, чем Симметричный CALIC, и намного лучшие результаты, чем остальные использованные для сравнения методы. Две темы объединены таким образом, что затухание повлияло на появление в видеофайле ошибок, которые были исправлены при помощи предложенных методов замещения ошибок. Все практические тесты и сравнения проведены в MatLab. Практическая значимость: предложенный способ расчета параметров канала с затуханием позволяет выполнять расчеты для любых видов каналов, что значительно облегчает работу с каналами в общем и с необходимыми для них расчетами в частности. Предложенные оптимизация существующего метода замещения ошибок и новый метод замещения ошибок позволяют получать видео более высокого качества после прохождения через канал с затуханием.
Ключевые слова — распределение Райса, затухание Райса, скорость ошибочных битов, BER, замещение ошибок, коэффициент уровня пересечения, средняя продолжительность затухания, CALIC, симметричный CALIC, сбалансированный процентар-ный расчет, средняя взвешенность, внутрикадровое прогнозирование с помощью системы линейных уравнений.