نتایج جستجو برای: fountain theorem

تعداد نتایج: 145524  

2016
Takayuki Nozaki

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...

Journal: :CoRR 2015
Wen Ji Bo-Wei Chen Yiqiang Chen

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...

1998
Christopher R. Ekstrom Eric A. Burt

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...

2014
Feng-Yun Lu Gui-Qian Deng

We study the following p-Laplacian equation with nonlinear boundary conditions: -Δ(p)u + μ(x)|u|(p-2)u = f(x,u) + g(x,u),x ∈ Ω, | ∇u|(p-2)∂u/∂n = η|u|(p-2)u and x ∈ ∂Ω, where Ω is a bounded domain in ℝ(N) with smooth boundary ∂Ω. We prove that the equation has infinitely many weak solutions by using the variant fountain theorem due to Zou (2001) and f, g do not need to satisfy the (P.S) or (P.S...

Journal: :CoRR 2014
Shenghao Yang Soung Chang Liew Lizhao You Yi Chen

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...

2014
Stephen J. Onufrak Sohyun Park Cara Wilking

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....

Journal: :IEEE Trans. Instrumentation and Measurement 2001
Gregor Dudle Alain Joyet Patrick Berthoud Gaetano Mileti Pierre Thomann

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...

2009
Vivian Lucia Orozco

Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several international standards to recover lost packets at the application layer. These include multimedia broadcast/multicast sessions and digital video broadcasting on global internet-protocol. The rateless property of Fountain codes holds great promise for noisy channels. The...

Journal: :Physical Review Letters 2016

2005
David J.C. MacKay

Fountain codes are record-breaking sparse-graph codes for channels with erasures – such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file-transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back-channel is ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید