Analysis on Tailed Distributed Arithmetic Codes for Uniform Binary Sources
نویسندگان
چکیده
منابع مشابه
Hybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملArithmetic Constructions Of Binary Self-Dual Codes
The goal of this thesis is to explore the interplay between binary self-dual codes and the \'etale cohomology of arithmetic schemes. Three constructions of binary self-dual codes with arithmetic origins are proposed and compared: Construction $\Q$, Construction G and the Equivariant Construction. In this thesis, we prove that up to equivalence, all binary self-dual codes of length at least $4$ ...
متن کاملdistributed arithmetic با کارایی بالا
در این تحقیق، روش های پیاده سازی فیلتر با پاسخ ضربه محدود (فیلتر fir) مورد بررسی قرار می گیرد. برای پیاده سازی فیلتر fir از دو واحد(mac) multiply accumulate و distributed arithmetic (da) استفاده می شود. پیاده سازی فیلتر fir با da از 50 تا 80 درصد مساحت اشغالی را بهبود می دهد؛ همچنین توان مصرفی را نیز کاهش می دهد. روش هایی برای بهبود ساختار اولیه ی da نیز ارائه می شود که باعث افزایش کارایی فیلتر...
15 صفحه اولBinary codes from reflexive uniform subset graphs on 3-sets
We examine the binary codes C2(Ai + I) from matrices Ai + I where Ai is an adjacency matrix of a uniform subset graph Γ(n, 3, i) of 3-subsets of a set of size n with adjacency defined by subsets meeting in i elements of Ω, where 0 ≤ i ≤ 2. Most of the main parameters are obtained; the hulls, the duals, and other subcodes of the C2(Ai + I) are also examined. We obtain partial PD-sets for some of...
متن کاملPerformance Analysis of MAP Decoded Space-Time Orthogonal Block Codes for Non-Uniform Sources*
We derive a closed-form expression for the exact pairwise error probability (PEP) of a non-uniform memoryless binary source transmitted over a Rayleigh fading channel using space-time orthogonal block codes and maximum a posteriori (MAP) detection. The expression is easy to evaluate and holds for any signaling scheme. We then use this result to minimize the bit error rate of the binary antipoda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2016
ISSN: 0090-6778
DOI: 10.1109/tcomm.2016.2599535