اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدApplication of DAC Codeword Spectrum: Expansion Factor
179
0
0.0
(
0
)
تأليف
Yong Fang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Distributed Arithmetic Coding (DAC) proves to be an effective implementation of Slepian-Wolf Coding (SWC), especially for short data blocks. To study the property of DAC codewords, the author has proposed the concept of DAC codeword spectrum. For equiprobable binary sources, the problem was formatted as solving a system of functional equations. Then, to calculate DAC codeword spectrum in general cases, three approximation methods have been proposed. In this paper, the author makes use of DAC codeword spectrum as a tool to answer an important question: how many (including proper and wrong) paths will be created during the DAC decoding, if no path is pruned? The author introduces the concept of another kind of DAC codeword spectrum, i.e. time spectrum, while the originally-proposed DAC codeword spectrum is called path spectrum from now on. To measure how fast the number of decoding paths increases, the author introduces the concept of expansion factor which is defined as the ratio of path numbers between two consecutive decoding stages. The author reveals the relation between expansion factor and path/time spectrum, and proves that the number of decoding paths of any DAC codeword increases exponentially as the decoding proceeds. Specifically, when symbols `0 and `1 are mapped onto intervals [0, q) and [(1-q), 1), where 0.5<q<1, the author proves that expansion factor converges to 2q as the decoding proceeds.
قيم البحث
اقرأ أيضاً
Distributed Arithmetic Coding (DAC) is an effective implementation of Slepian-Wolf coding, especially for short data blocks. To research its properties, the concept of DAC codeword distribution along proper and wrong decoding paths has been introduce
d. For DAC codeword distribution of equiprobable binary sources along proper decoding paths, the problem was formatted as solving a system of functional equations. However, up to now, only one closed form was obtained at rate 0.5, while in general cases, to find the closed form of DAC codeword distribution still remains a very difficult task. This paper proposes three kinds of approximation methods for DAC codeword distribution of equiprobable binary sources along proper decoding paths: numeric approximation, polynomial approximation, and Gaussian approximation. Firstly, as a general approach, a numeric method is iterated to find the approximation to DAC codeword distribution. Secondly, at rates lower than 0.5, DAC codeword distribution can be well approximated by a polynomial. Thirdly, at very low rates, a Gaussian function centered at 0.5 is proved to be a good and simple approximation to DAC codeword distribution. A simple way to estimate the variance of Gaussian function is also proposed. Plenty of simulation results are given to verify theoretical analyses.
In this paper we compute the Fourier spectrum of the Fractal Interpolation Functions FIFs as introduced by Michael Barnsley. We show that there is an analytical way to compute them. In this paper we attempt to solve the inverse problem of FIF by using the spectrum
Spectrum sensing is a fundamental operation in cognitive radio environment. It gives information about spectrum availability by scanning the bands. Usually a fixed amount of time is given to scan individual bands. Most of the times, historical inform
ation about the traffic in the spectrum bands is not used. But this information gives the idea, how busy a specific band is. Therefore, instead of scanning a band for a fixed amount of time, more time can be given to less occupied bands and less time to heavily occupied ones. In this paper we have formulated the time assignment problem as integer linear programming and source coding problems. The time assignment problem is solved using the associated stochastic optimization problem.
This paper presents a novel successive factor-graph permutation (SFP) scheme that significantly improves the error-correction performance of Reed-Muller (RM) codes under successive-cancellation list (SCL) decoding. In particular, we perform maximum-l
ikelihood decoding on the symmetry group of RM codes to carefully select a good factor-graph permutation on the fly. We further propose an SFP-aided fast SCL decoding that significantly reduces the decoding latency while preserving the error-correction performance of the code. The simulation results show that for the third and fourth order RM codes of length $256$, the proposed decoder reduces up to $85%$ of the memory consumption, $78%$ of the decoding latency, and more than $99%$ of the computational complexity of the state-of-the-art recursive projection-aggregation decoder at the frame error rate of $10^{-3}$.
We consider the problem of two wireless networks operating on the same (presumably unlicensed) frequency band. Pairs within a given network cooperate to schedule transmissions, but between networks there is competition for spectrum. To make the probl
em tractable, we assume transmissions are scheduled according to a random access protocol where each network chooses an access probability for its users. A game between the two networks is defined. We characterize the Nash Equilibrium behavior of the system. Three regimes are identified; one in which both networks simultaneously schedule all transmissions; one in which the denser network schedules all transmissions and the sparser only schedules a fraction; and one in which both networks schedule only a fraction of their transmissions. The regime of operation depends on the pathloss exponent $alpha$, the latter regime being desirable, but attainable only for $alpha>4$. This suggests that in certain environments, rival wireless networks may end up naturally cooperating. To substantiate our analytical results, we simulate a system where networks iteratively optimize their access probabilities in a greedy manner. We also discuss a distributed scheduling protocol that employs carrier sensing, and demonstrate via simulations, that again a near cooperative equilibrium exists for sufficiently large $alpha$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
