Adaptation of Near-Perfect Packet-Level FEC Interleaving in Mobile Media Streaming

Tong, Sheau-Ru; Yu, Yuan-Tse

doi:10.1093/comjnl/bxt104

Cited by 3 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A correlation coefficient

ρ

, defined as

ρ = 1 - p - q

, describes the probability of remaining in the current state [22]. When interleaving is added with an interleaving depth of d , the distance between two formerly adjacent packets in an FEC frame will be d , so the new parameters in the DTMC model become

\begin{matrix} right left right left right left right left right left right left0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em3pt \\ p^{normal′} = \frac{p (1 - ρ^{d})}{p + q} and q^{normal′} = \frac{q (1 - ρ^{d})}{p + q} \end{matrix}

and the new correlation coefficient will be

ρ^{'} = 1 - p^{'} - q^{'}

[23]. From the formulae above, we know that when

p + q

is close to 1, the channel correlation is very small and hence the channel is almost memoryless, so adding interleaving will not give a large improvement.…”

Section: Fso Channel Modelmentioning

confidence: 99%

“…When S is fixed, the final PLR of the system is essentially fixed. On the basis of this assumption, the parameters n and d are optimised to reduce the overhead under the condition that the system performance is similar [23].…”

Section: Analysis Of Packet Layer Fec Codes and Interleaving Withoumentioning

confidence: 99%

“…Optimization between the codeword length and interleaving depth was first discussed with consideration of overhead [8], with the assumption of constant buffering size, which means the product of codeword length and interleaving depth is fixed. And based on that, later work [9] proposed a near-perfect interleaving depth to define an upper bound of the effective interleaving depth and used the interleaving-first (IF) algorithm to achieve better performance with lower complexity of coding and decoding. Recent work [10] focuses on reducing FEC processing delay by adopting a short block size and controlling the interleaving depth flexibly.…”

Section: Introductionmentioning

confidence: 99%

“…With the assumption of constant buffering size, optimisation between the codeword length and interleaving depth was first discussed with consideration of overhead [22]. Moreover, based on that, later work [23] proposed a near‐perfect (NP) interleaving depth to define an upper bound of the effective interleaving depth when it is possible to select very large interleaving depth, and an interleaving‐first algorithm to achieve better performance with lower complexity of coding and decoding. However, today memory devices are cheaper and cheaper, so that it is practical to use much larger buffering size, and therefore we have to consider how the buffering size influences the transmission performance, which has not been addressed in existing works.…”

Section: Introductionmentioning

confidence: 99%

“…Correlation coefficient as a function of the interleaving depthFromFig 3.1 we can see that the correlation coefficient asymptotically approaches zero for large d, thus increasing d becomes an increasingly inefficient way to reduce the channel correlation. To find a proper d, a threshold θ is defined in[9]: when…”

mentioning

confidence: 99%

See 4 more Smart Citations

Performance analysis of packet layer FEC codes and interleaving in FSO channels

et al. 2017

View full text Add to dashboard Cite

The combination of forward-error-correction (FEC) and interleaving can be used to improve free-space optical (FSO) communication systems. Recent research has optimized the codeword length and interleaving depth under the assumption of a fixed buffering size, however, how the buffering size influences the system performance remains unsolved. This paper models the system performance as a function of buffering size and FEC recovery threshold, which allows system designers to determine optimum parameters in consideration of the overhead. The modelling is based on statistics of temporal features of correct data reception and burst error length through the measurement of the channel good time and outage time. The experimental results show good coherence with the theoretical values. This method can also be applied in other channels if a Continuous-Time-Markov-Chain (CTMC) model of the channel can be derived.

show abstract

“…A correlation coefficient

ρ

, defined as

ρ = 1 - p - q

\begin{matrix} right left right left right left right left right left right left0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em3pt \\ p^{normal′} = \frac{p (1 - ρ^{d})}{p + q} and q^{normal′} = \frac{q (1 - ρ^{d})}{p + q} \end{matrix}

and the new correlation coefficient will be

ρ^{'} = 1 - p^{'} - q^{'}

[23]. From the formulae above, we know that when

p + q

is close to 1, the channel correlation is very small and hence the channel is almost memoryless, so adding interleaving will not give a large improvement.…”

Section: Fso Channel Modelmentioning

confidence: 99%

Section: Analysis Of Packet Layer Fec Codes and Interleaving Withoumentioning

confidence: 99%