کد مقاله کد نشریه سال انتشار مقاله انگلیسی ترجمه فارسی نسخه تمام متن
4973751 1451708 2018 8 صفحه PDF سفارش دهید دانلود کنید
عنوان انگلیسی مقاله ISI
Frame expansions with probabilistic erasures
ترجمه فارسی عنوان
قاب با محو شدن احتمالات ممکن است
کلمات کلیدی
فریم ها، فریم های پارساوال، پاک کردن کد ها، زنجیره مارکوف،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر پردازش سیگنال
چکیده انگلیسی

In modern communication network such as a public Internet, random losses of information can be recovered by frame expansions. In this paper, we think about the transport protocol that delivers a coefficient of frame expansions with some probability of failure via multiple intermediate nodes. By this protocol, we abstract the transmission as a Markov process. In this case, even if the probabilities of erasures are close to the 1/2, we show that the reconstruction error can be minimized as small as possible by using frames with high redundancy. Furthermore, we set up a probability model for constructing optimal Parseval frames that are robust to one probabilistic erasure. It is shown that probabilistic modeled Parseval frames are more effective than traditional Parseval frames on recovering the signal with probabilistic erasures.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Digital Signal Processing - Volume 72, January 2018, Pages 75-82
نویسندگان
, , , ,