Results 251 to 260 of about 164,698 (293)
Optics and Spectroscopy, 2000 Light scattering by a two-layer “soft” sphere is studied. The analysis is made by the method of expansion in the spatial spectrum in Kotel’nikov-Shannon choice functions. In the case where changes of relative refractive indices of the first (Δn 1 and the second ((Δn 2) layers have the same sign, the scattering indicatrices are found to be close to the ...
V. M. Rysakov, M. Stoń
openalex +2 more sources
Quaternary reversible logic synthesis based on GF(4) Shannon expansion
WIT Transactions on Information and Communication Technologies, 2014 Lu Cangang, Zhijin Guan, Jinfeng He
openalex +2 more sources
The Distribution and Expansion of Ornamental Plants on the Shannon Navigation
Biology and Environment: Proceedings of the Royal Irish Academy, 2012 Dan Minchin, Rick Boelens
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Shannon’s expansion theorem-based multiplexer synthesis using QCA
Nanomaterials and Energy, 2016Quantum dot-cellular automata (QCA) achieved their fame in designing low-power nanodevices for logic computation. Shannon’s expansion theorem helps to achieve a design for digital logic circuits that has three or more levels of logic with minimum implementation cost – that is, a smaller number of logic gates.
Jadav Chandra Das, Debashis De
openaire +1 more source
Symbolic reliability analysis via Shannon's expansion and statistical independence
Microelectronics Reliability, 1985Abstract A simple procedure for evaluating the symbolic reliability of a complex system in presented. The switching (Boolean) functions of system success and system failure are expressed as the intersections of complements to the prime implicants of these functions. Shannon's expansion about suitable keystone variables is repeatedly applied to either
Ali M. Rushdi, Azza S. Goda
openaire +1 more source
Disjoint Boolean Products via Shannon's Expansion
IEEE Transactions on Reliability, 1984It is shown how the well-known expansion theorem of Boolean (switching) functions theory can be used as the kernel of a powerful and extremely simple algorithm for producing a short disjoint products form of a Boolean function. Its efficiency may challenge other algorithms.
openaire +1 more source
Error Bounds for Multi-dimensional Whittaker-Shannon Sampling Expansion
2011 International Conference on Multimedia and Signal Processing, 2011Let B p v(R d ), 1 ≤ p< ∞, be the space of all bounded bandlimited functions from Lp(R d ). The uniform bounds for truncated multi-dimensional Whittaker-Shannon se- ries based on local sampling are derived for signal functions f ∈ B p v(R d ) without decay assumption.
openaire +1 more source
An area-efficient timing closure technique for FPGAs using Shannon's expansion
Integration, 2007This paper presents a technique to optimize the speed performance of circuits implemented in FPGAs. After synthesis, technology mapping and placement are complete, we apply Shannon's expansion to the most critical sections of the circuit. This approach allows us to precompute the values of functions that depend on late-arriving critical signals and use
Deshanand P. Singh, Stephen D. Brown
openaire +1 more source
A Folding Strategy for SAT solvers based on Shannon's expansion theorem
23rd IEEE International SOC Conference, 2010SAT problem has been an active research subject and many impressive SAT solvers have been proposed. Most of algorithms used in modern SAT solvers are based on tree structured searching strategy, combining with heuristic approaches to reduce the search space.
Siwat Saibua +3 more
openaire +1 more source