نتایج جستجو برای: کد fountain
تعداد نتایج: 7863 فیلتر نتایج به سال:
یکی از کانال های مخابراتی پرکاربرد، کانال پاک شوندگی باینری (bec) است که برای مدل سازی انتقال داده ها روی اینترنت نیز مورد استفاده قرار می گیرد. در اینترنت معمولاً قابلیت اطمینان در انتقال داده ها با استفاده از پروتکل ها تضمین می گردد که در برخی کاربردها از جمله انتقال داده روی لینک های ماهواره ای یا بدون سیم، عملکرد چندان مطلوبی ندارند. راه حل دیگر برای ایجاد اطمینان در انتقال داده ها استفاده ا...
Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalisation for fountain codes operating on erasure channels, and we generalise the problem formalisation to more general channels. We introduce a novel type of rateless codes based on the Turbo Principle: the Turbo-Fountain. The Turbo-Fountain is able to consi...
Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalization for fountain codes operating on erasure channels and we generalize the problem formalization to arbitrary types of channels. We introduce a novel type of rateless codes based on the turbo principle: the Turbo-Fountain. The TurboFountain is able to c...
An on-line fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper we formalize the problem of on-line fountain code construction, and propose new on-line fountain codes that outperform known ones in having factor 3-5 l...
This paper proposes a fountain coding system which has lower space decoding complexity and lower decoding erasure rate than the Raptor coding systems. The main idea of the proposed fountain code is employing shift and exclusive OR to generate the output packets. This technique is known as the zigzag decodable code, which is efficiently decoded by the zigzag decoder. In other words, we propose a...
Decoding performance of Fountain codes for the binary erasure channel (BEC) depends on two aspects. One is the essential code structure, on which stopping set analysis operates. The other is the effect from the channel characteristic, which is difficult to give a precise estimation. To tackle these problems, in this paper, we propose a solution to analyzing the performance of Fountain codes bas...
Atomic fountain clocks are showing great promise as primary frequency standards (1). In light of this, we have started a program to develop atomic fountain clocks at the U. S. Naval Observatory. The mission of the observatory, however, dictates different design goals than that of a standards institution. In this paper we will discuss the goals of our atomic fountain project, a scheme for reduci...
Network-coded multiple access (NCMA) is a communication scheme for wireless multiple-access networks where physical-layer network coding (PNC) is employed. In NCMA, a user encodes and spreads its message into multiple packets. Time is slotted and multiple users transmit packets (one packet each) simultaneously in each timeslot. A sink node aims to decode the messages of all the users from the s...
INTRODUCTION Caloric intake among children could be reduced if sugar-sweetened beverages were replaced by plain water. School drinking water infrastructure is dictated in part by state plumbing codes, which generally require a minimum ratio of drinking fountains to students. Actual availability of drinking fountains in schools and how availability differs according to plumbing codes is unknown....
We report on the design, construction, and preliminary measurements on the resonator of a continuous Cs fountain frequency standard. The construction of the resonator is described, preliminary measurements of the available atomic flux, and of the beam temperature are presented, along with the first Ramsey fringes (width 1 Hz) obtained in this new type of fountain. We discuss theoretical aspects...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید