Lower bound for average delay in unblocked random access algorithm with orthogonal preambles
نویسندگان
چکیده
منابع مشابه
Adaptive random access algorithm with improved delay performance
We propose an adaptive random access algorithm for mobile environments with capture. The algorithm has a dynamic window size which is updated according to the tra$c intensity. The packet arrival rate is tracked by employing sequential detection procedures. Simulations indicate that reducing the window size adaptively under heavy load conditions improves the average delay signi"cantly. Copyright...
متن کاملAn Average-Case Lower Bound against ACC
In a seminal work, Williams [26] showed that NEXP (non-deterministic exponential time) does not have polynomial-size ACC circuits. Williams’ technique inherently gives a worst-case lower bound, and until now, no average-case version of his result was known. We show that there is a language L in NEXP (resp. EXP) and a function ε(n) = 1/ log(n) (resp. 1/n) such that no sequence of polynomial size...
متن کاملLow Power March Memory Test Algorithm for Static Random Access Memories (TECHNICAL NOTE)
Memories are most important building blocks in many digital systems. As the Integrated Circuits requirements are growing, the test circuitry must grow as well. There is a need for more efficient test techniques with low power and high speed. Many Memory Built in Self-Test techniques have been proposed to test memories. Compared with combinational and sequential circuits memory testing utilizes ...
متن کاملA Lower Bound for Average Values of Dynamical Green’s Functions
We provide a Mahler/Elkies-style lower bound for the average values of dynamical Green’s functions on P over an arbitrary valued field, and give some dynamical and arithmetic applications.
متن کاملAdversary Lower Bound for the Orthogonal Array Problem
We prove a quantum query lower bound Ω(n) for the problem of deciding whether an input string of size n contains a k-tuple which belongs to a fixed orthogonal array on k factors of strength d ≤ k − 1 and index 1, provided that the alphabet size is sufficiently large. Our lower bound is tight when d = k − 1. The orthogonal array problem includes the following problems as special cases: • k-sum p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Информационно-управляющие системы
سال: 2020
ISSN: 2541-8610,1684-8853
DOI: 10.31799/1684-8853-2020-3-79-85