نتایج جستجو برای: spread spectrum method

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

Journal: :Des. Codes Cryptography 2016
Siaw-Lynn Ng Maura B. Paterson

Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of difference families and the variations in priorities in constructions. We propose a definition of disjoint difference families that encompasses these variations and...

Journal: :CoRR 2017
Ahmad Adib Shaar Lenny Fukshansky

We present a new family of one-coincidence sequence sets suitable for frequency hopping code division multiple access (FH-CDMA) systems with dispersed (low density) sequence elements. These sets are derived from one-coincidence prime sequence sets, such that for each one-coincidence prime sequence set there is a new one-coincidence set comprised of sequences with dispersed sequence elements, re...

2010
M. Kaminaga M. Krishna

In this paper we consider the Anderson type model and show that the density of states is analytic in an interval for large disorder. The examples we have allow for the single site distributions to have some singular components. We also allow non-nearest neighbour hopping terms.

2007
ALFRED LIEMANT

From a hopping rate equation for disordered materials we derive a macroscopic drift{di usion equation. For this purposes two space{time scales are simultaneously considered. The microscopic dynamics is characterized by the distribution of localized states and the hopping rate. On the macroscopic space scale both the hopping rate and the disordered material are allowed to be inhomogeneous.

Journal: :IEEE Trans. Communications 1988
Alex W. Lam Dilip V. Sarwate

Time-hopping patterns can be constructed from simple difference sets. By studying such constructions, we prove that whenever n 2, n, n 1, or n + 1 is a prime power, then we can construct timehopping patterns that have n terms, and are of length less than n2. We show by computation that such patterns can have length less then n2 n’ for all n 5 150. We also show that time-hopping patterns of n te...

Journal: :Journal of Engineering and Applied Sciences 2019

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

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