969 resultados para Geometrical transforms
Resumo:
This letter presents the development of simplified algorithms based on Haar functions for signal extraction in relaying signals. These algorithms, being computationally simple, are better suited for microprocessor-based power system protection relaying. They provide accurate estimates of the signal amplitude and phase.
Resumo:
In this paper, a new incremental algorithm for layout compaction is proposed. In addition to its linear time performance in terms of the number of rectangles in the layout, we also describe how incremental compaction can form a good feature in the design of a layout editor. The design of such an editor is also described. In the design of the editor, we describe how arrays can be used to implement quadtrees that represent VLSI layouts. Such a representation provides speed of data access and low storage requirements.
Resumo:
In this paper, we develop a cipher system based on finite field transforms. In this system, blocks of the input character-string are enciphered using congruence or modular transformations with respect to either primes or irreducible polynomials over a finite field. The polynomial system is shown to be clearly superior to the prime system for conventional cryptographic work.
Resumo:
The rates of alkaline hydrolysis of methyl &benzoylpropionate (I), methyl y-benzoylbutyrate (11) and methyll6-benzoylvalerate (In) decrease in the order I > I1 > III. Keto participation is the predominant pathway in the case of y-keto esters. Evidence has also been obtained for keto participation in the case of 6-keto esters, whereas no such evidence is available in the case of r-keto esters studied.
Resumo:
The Inönü-Wigner contractions which interrelate the Lie algebras of the isometry groups of metric spaces are discussed with reference to deformations of the absolutes of the spaces. A general formula is derived for the Lie algebra commutation relations of the isometry group for anyN-dimensional metric space. These ideas are illustrated by a discussion of important particular cases, which interrelate the four-dimensional de Sitter, Poincaré, and Galilean groups.
Resumo:
The transforms dealt with in this paper are defined in terms of the transform kernels which are Kroneeker products of the two or more component kernels. The signal flow-graph for the computation of such a transform is obtained with the flow-graphs for the component transforms as building blocks.
Resumo:
We derive expressions for convolution multiplication properties of discrete cosine transform II (DCT II) starting from equivalent discrete Fourier transform (DFT) representations. Using these expressions, a method for implementing linear filtering through block convolution in the DCT II domain is presented. For the case of nonsymmetric impulse response, additional discrete sine transform II (DST II) is required for implementing the filter in DCT II domain, where as for a symmetric impulse response, the additional transform is not required. Comparison with recently proposed circular convolution technique in DCT II domain shows that the proposed new method is computationally more efficient.
Resumo:
The scope of application of Laplace transforms presently limited to the study of linear partial differential equations, is extended to the nonlinear domain by this study. This has been achieved by modifying the definition of D transforms, put forth recently for the study of classes of nonlinear lumped parameter systems. The appropriate properties of the new D transforms are presented to bring out their applicability in the analysis of nonlinear distributed parameter systems.
Resumo:
Hamilton’s theory of turns for the group SU(2) is exploited to develop a new geometrical representation for polarization optics. While pure polarization states are represented by points on the Poincaré sphere, linear intensity preserving optical systems are represented by great circle arcs on another sphere. Composition of systems, and their action on polarization states, are both reduced to geometrical operations. Several synthesis problems, especially in relation to the Pancharatnam-Berry-Aharonov-Anandan geometrical phase, are clarified with the new representation. The general relation between the geometrical phase, and the solid angle on the Poincaré sphere, is established.
Resumo:
A brief qualitative comparison is made of perovskite ABO sub 3 and layered perovskite ABO sub 3 and layered perovskite A sub 2 BO sub 4 oxides with special emphasis on the influence of geometrical factors on certain physico-chemical properties. The layered perovskite oxides are distinguished from three-dimensional oxides by a looser packing, frustration in three-dimensional interactions, more internal pressure on B--O bonds for small tolerance factors, and by different values of site-percolation thresholds. Their influence on electronic configurations of metal ions, stabilities and syntheses of compounds is discussed. The influence of increased anisotropy in layered oxides on localisation of charge carriers and in suppressing the onset of long-range ferromagnetic ordering is also discussed.
Resumo:
Molecular dynamics simulations on Xe in NaY and Ar in NaCaA zeolite are reported. Rates of cage-to-cage crossovers in the two zeolites exhibit trends which are contrary to that expected from geometrical considerations. The results suggest the important role of the sorbate-zeolite interactions in determining the molecular sieve properties of zeolites for small sized sorbates. The results are explained in terms of the barrier height for cage-to-cage crossover in the two zeolites.
Resumo:
We present a technique for irreversible watermarking approach robust to affine transform attacks in camera, biomedical and satellite images stored in the form of monochrome bitmap images. The watermarking approach is based on image normalisation in which both watermark embedding and extraction are carried out with respect to an image normalised to meet a set of predefined moment criteria. The normalisation procedure is invariant to affine transform attacks. The result of watermarking scheme is suitable for public watermarking applications, where the original image is not available for watermark extraction. Here, direct-sequence code division multiple access approach is used to embed multibit text information in DCT and DWT transform domains. The proposed watermarking schemes are robust against various types of attacks such as Gaussian noise, shearing, scaling, rotation, flipping, affine transform, signal processing and JPEG compression. Performance analysis results are measured using image processing metrics.
Resumo:
The use of Wiener–Lee transforms to construct one of the frequency characteristics, magnitude or phase of a network function, when the other characteristic is given graphically, is indicated. This application is useful in finding a realisable network function whose magnitude or phase curve is given. A discrete version of the transform is presented, so that a digital computer can be employed for the computation.