Algorithm for cosine transform of Toeplitz matrices

An algorithm for calculating the 2D cosine transform of a Toeplitz matrix is presented. The algorithm is based on the application of 1D cosine transforms. More specifically, four 1D cosine transforms of size N are needed to obtain the transform of a Toeplitz matrix of size N×N. This is an improvement over previously published algorithms. The algorithm is also simple and regular     

Electro-optic sampling system for the testing of high-speedintegrated circuits using a free running solid-state laser

This paper deals with the indirect electro-optic sampling technique for the low-invasive detection of periodical voltage waveforms on lines in high-speed integrated circuits. The system introduced here is based on a passive mode-coupled Ti:Sapphire-Laser as light source for generating optical pulses in the subpicosecond regime. Therefore, we have to synchronize the resulting electric measurement signal and its external trigger onto the pulse repetition rate of this free running solid-state laser. The multi user function of the laser system forces us to transmit the pulses via a single-mode fiber into the measurement setup. For that purpose we developed a special optical arrangement to minimize the widening of the pulses in the time domain. The system's high-temporal resolution of nearly 10 ps in combination with its high-voltage sensitivity of about 800 μV/√(Hz) is demonstrated by measurements of an integrated microwave frequency divider     

Magnetic resonance imaging: a new window into industrial processing.

Although the most important use of nuclear magnetic resonance imaging (MRI) continues to be for diagnostic medicine, recognition is being gained for many nonmedical applications. Examples include the following areas: petrogeology, food, agriculture, polymers and polymer-composites, and pharmaceuticals. These areas all involve studies of species that have short spin-spin relaxation times, and consequently need far fast gradient switching. These technical details are discussed and typical applications given.     

A Primitive Non-symmetric 3-Class Association Scheme on 36 Elements with p11 = 0 Exists and is Unique

In this paper we construct a primitive, non-symmetric 3-class association scheme with parameters v = 36, v₁ = 7, p¹₁₁ = 0 and p²₁₁ = 4 and show that such a scheme is determined by its parameters.     

Expression of theSU(2) rotation matrices D( j ) in terms of normalized irreducible tensorial matrices

TheSU(2) rotation matricesD ^(j), specified in terms of axis and angle of rotation, are expressed as linear combination of normalized irreducible tensorial matricces (NITM) of rankl = 0 to 2j rotated to the polar angles of the axis. The rotated NITM are constructed from spherical harmonics of the same rank. Since this formulation requires no matrix products, it may be computationally more efficient than Euler angle formulas, particularly for largej. Rotated NITM and formulas for theD ^(j) withj = 1/2 andj = 1 are written out explicitly. A formula for the structure constants of the products of conformable NITM is also given in terms of 3-j and 6-j symbols.     

Silver nitrate-acetonitrile and iodine-benzene complexes as studied by NMR in thermotropic liquid crystals

Silver nitrate-acetonitrile and π iodine-benzene complexes in thermotropic liquid crystals have been studied by ¹H, ²H, and ¹³C NMR spectroscopy and by optical microscopy. Evidence for at least two silver complexes in each liquid crystal is presented.     

Cost Effective VLSI Architectures for Full-Search Block-Matching Motion Estimation Algorithm

In this paper, we present efficient VLSI architectures for full-search block-matching motion estimation (BMME) algorithm. Given a search range, we partition it into sub-search arrays called tiles. By fully exploiting data dependency within a tile, efficient VLSI architectures can be obtained. Using the proposed VLSI architectures, all the block-matchings in a tile can be processed in parallel. All the tiles within a search range can be processed serially or concurrently depending on various requirements. With the consideration of processing speed, hardware cost, and I/O bandwidth, the optimal tile size for a specific video application is analyzed. By partitioning a search range into tiles with appropriate size, flexible VLSI designs with different throughput can be obtained. In this way, cost effective VLSI designs for a wide range of video applications, from H.261 to HDTV, can be achieved.     

On finite element approximation and stabilization methods for compressible viscous flows

This work is devoted to the numerical solution of the Navier–Stokes equations for compressible viscous fluids. Finite element approximations and stabilization techniques are addressed. We present methods to implement discontinuous approximations for the pressure and the density. An upwinding methodology is being investigated which combines the ideas behind the stream line Petrov–Galerkin method and the flux limiter methods aiming to introduce numerical diffusion only where it is necessary.     

The effect of bandwidth allocation policies on delay inunidirectional bus networks

We consider the problem of allocating bandwidth fairly to each node in a shared, unidirectional bus network. We focus on the p_i persistent protocol, since these are open loop policies designed to operate well in high speed networks, which have a very large bandwidth-delay product and feedback in the upstream direction is not available in a timely manner. First, we introduce an improvement to the basic p_i persistent protocol, in which we replace random coin tosses with a deterministic counting algorithm, and thereby reduce the delays for all nodes for any given choice of {p_i}. We then describe an exact method for calculating average packet delays and queue lengths in both the p_i persistent and our new deterministic n out of m protocols, based on the regenerative approach of Georgiades et al. (1987). These delay results, together with simulation measurements, show that both of these protocols still waste some bandwidth. After presenting a lower bounding argument to show that some wasted bandwidth is inevitable in all such distributed access control schemes, assuming a passive bus without feedback in the upstream direction, we show that changing the bus to unidirectional point-to-point links between (very simple) active interfaces at each node allows us to construct distributed access schemes that require no upstream feedback and are both work conserving and fair. To illustrate how this can be done, we introduce the p_i preemptive protocol, in which each node randomly inserts its own packets into the traffic arriving from upstream. We derive a simple and effective heuristic for calculating the preemption probability for each node, and use simulation to show how well it equalizes the delays at each node     

A single-chip 12.7 Mchips/s digital IF BPSK direct sequencespread-spectrum transceiver in 1.2 μm CMOS

This paper describes a fully integrated digital-spread spectrum transceiver chip fabricated through MOSIS in 1.2 μm CMOS. It includes a baseband spread spectrum transmitter and a coherent intermediate frequency (IF) receiver consisting of a Costas loop, an acquisition loop for the pseudo-noise (PN) sequence, and a clock recovery loop with a 406.4 MHz onchip numerically controlled oscillator (NCO). The transceiver is capable of operating at a maximum IF sampling rate of 50.8 MS/s and a maximum chip rate of 12.7 R Mchips/s (Mcps) with selectable data rates of 100, 200, 400, and 800 kbps. At the maximum operating speed of 50.8 R MS/s, it dissipates 1.1 W. In an additive white Gaussian noise channel the IF receiver achieves a receiver output SNR within 1 dB of theory and can acquire code with a wide range of input SNR from -17 dB to over 30 dB. The transceiver chip has been interfaced to an RF up/down converter to demonstrate a wireless voice/data/video link operating in the 902-928 MHz band