All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 29 Next

Displaying 561 – 580 of 1497

Showing per page

GLS: New class of generalized Legendre sequences with optimal arithmetic cross-correlation

Huijuan WANG, Qiaoyan WEN, Jie ZHANG (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The Legendre symbol has been used to construct sequences with ideal cross-correlation, but it was never used in the arithmetic cross-correlation. In this paper, a new class of generalized Legendre sequences are described and analyzed with respect to their period, distributional, arithmetic cross-correlation and distinctness properties. This analysis gives a new approach to study the connection between the Legendre symbol and the arithmetic cross-correlation. In the end of this paper, possible application...

Graph fibrations, graph isomorphism, and PageRank

Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna (2006)

RAIRO - Theoretical Informatics and Applications

PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...

Gravitational waves from coalescing binaries: a hierarchical signal detection strategy

S. Mohanty, S. Dhurandhar (1997)

Banach Center Publications

The detection of gravitational waves from coalescing compact binaries would be a computationally intensive process if a single bank of template waveforms (i.e., a one step search) is used. We present, in this paper, an alternative method which is a hierarchical search strategy involving two template banks. We show that the computational power required by such a two step search, for an on-line detection of the one parameter family of Newtonian signals, is 1/8 of that required when an on-line one...

Grid and Simulation of Digital Communication Systems

Manev, Nikolai (2010)

Serdica Journal of Computing

The purpose of this paper is to turn researchers' attention to the use of grid computing for simulating digital communications and its large potential for decreasing significantly the duration of the experiments and for improving the statistical representativeness and reliability of the obtained results.* This work is partly supported by the National Science Fund of Bulgaria under Grant No. D002-146/16.12.2008.

Hermite functions and uncertainty principles for the Fourier and the windowed Fourier transforms.

Aline Bonami, Demange, Bruno, Jaming, Philippe (2003)

Revista Matemática Iberoamericana

We extend an uncertainty principle due to Beurling into a characterization of Hermite functions. More precisely, all functions f on Rd which may be written as P(x)exp(-(Ax,x)), with A a real symmetric definite positive matrix, are characterized by integrability conditions on the product f(x)f(y). We then obtain similar results for the windowed Fourier transform (also known, up to elementary changes of functions, as the radar ambiguity function or the Wigner transform). We complete the paper with...

Hierarchical models, marginal polytopes, and linear codes

Thomas Kahle, Walter Wenzel, Nihat Ay (2009)

Kybernetika

In this paper, we explore a connection between binary hierarchical models, their marginal polytopes, and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.

Hierarchical residue number systems with small moduli and simple converters

Tadeusz Tomczak (2011)

International Journal of Applied Mathematics and Computer Science

In this paper, a new class of Hierarchical Residue Number Systems (HRNSs) is proposed, where the numbers are represented as a set of residues modulo factors of 2k ± 1 and modulo 2k . The converters between the proposed HRNS and the positional binary number system can be built as 2-level structures using efficient circuits designed for the RNS (2k-1, 2k, 2k+1). This approach allows using many small moduli in arithmetic channels without large conversion overhead. The advantages resulting from the...

Currently displaying 561 – 580 of 1497