Input Power Normalization of Zero-Error Probability based Algorithms
نویسندگان
چکیده
منابع مشابه
Audio Watermarking Based on Echo Hiding with Zero Error Probability
A new audio watermarking technique is proposed. It executes wet paper codes in embedding procedure of watermarks into audio cover objects using echo signals. Technique of echo signals results in a high quality of audio covers after embedding and robustness against natural signal transforms. Wet paper codes usage provides zero extraction error probability even for blind decoder at the cost of a ...
متن کاملMinimum Probability of Error-Based Equalization Algorithms for Fading Channels
Novel channel equalizer algorithms are introduced for wireless communication systems to combat channel distortions resulting from multipath propagation. The novel algorithms are based on newly derived bounds on the probability of error (PE) and guarantee better performance than the traditional zero forcing (ZF) or minimum mean square error (MMSE) algorithms. The new equalization methods require...
متن کاملapplication of upfc based on svpwm for power quality improvement
در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...
15 صفحه اولNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملQuantum Zero-Error Algorithms Cannot be Composed
We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In oracle terms, we give a relativized world where ZQP 6= ZQP, while classically we always have ZPP = ZPP.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korean Institute of Communications and Information Sciences
سال: 2017
ISSN: 1226-4717
DOI: 10.7840/kics.2017.42.1.1