A 2 V 1.8 GHz fully integrated CMOS dual-loop frequency synthesizer

A 2 V 1.8 GHz fully integrated CMOS dual-loop frequency synthesizer is designed in a standard 0.5 /spl mu/m digital CMOS process for wireless communication. The voltage-controlled oscillator (VCO) required for the low-frequency loop is designed using a ring-type VCO and achieves a tuning range of 89% from 356 to 931 MHz and a phase noise of -109.2 dBc/Hz at 600 kHz offset from 856 MHz. With an active chip area of 2000/spl times/1000 /spl mu/m/sup 2/ and at a 2 V supply voltage, the whole synthesizer achieves a tuning range from 1.8492 to 1.8698 GHz in 200 kHz steps with a measured phase noise of -112 dBc/Hz at 600 kHz offset from 1.86 GHz. The measured settling time is 128 /spl mu/s and the total power consumption is 95 mW.     

The slot-coupled hemispherical dielectric resonator antenna with a parasitic patch: applications to the circularly polarized antenna and wide-band antenna

The aperture-coupled hemispherical dielectric resonator antenna (DRA) with a parasitic patch is studied rigorously. Using the Green's function approach, integral equations for the unknown patch and slot currents are formulated and solved using the method of moments. The theory is utilized to design a circularly polarized (CP) DRA and a wide-band linearly polarized (LP) DRA. In the former, the CP frequency and axial ratio (AR) can easily be controlled by the patch location and patch size, respectively, with the impedance matched by varying the slot length and microstrip stub length. It is important that the AR will not be affected when the input impedance is tuned, and the CP design is therefore greatly facilitated. For the wide-band LP antenna, a maximum bandwidth of 22% can be obtained, which is much wider than the previous bandwidth of 7.5% with no parasitic patches. Finally, the frequency-tuning characteristics of the proposed antenna are discussed. Since the parasitic patch can be applied to any DRAs, the method will find applications in practical DRA designs.     

A microcoded elliptic curve processor using FPGA technology

The implementation of a microcoded elliptic curve processor using field-programmable gate array technology is described. This processor implements optimal normal basis field operations in F(2/sup n/). The design is synthesized by a parameterized module generator, which can accommodate arbitrary n and also produce field multipliers with different speed/area tradeoffs. The control part of the processor is microcoded, enabling curve operations to be incorporated into the processor and hence reducing the chip's I/O requirements. The microcoded approach also facilitates rapid development and algorithmic optimization: for example, projective and affine coordinates were supported using different microcode. The design was successfully tested on a Xilinx Virtex XCV1000-6 device and could perform an elliptic curve multiplication over the field F(2/sup n/) using affine and projective coordinates for n=113,155, and 173.     

Analysis and optimization of DS-CDMA systems with time-limited partial response chip waveforms

Conventional direct sequence code division multiple access systems (DS-CDMA) using offset quadrature phase shift key (OQPSK) usually employ a strictly bandlimited partial response square-root raised cosine pulse as the chip waveform. They have the disadvantage of large envelope fluctuation that will incur performance degradation due to the intermodulation and bandwidth enlargement caused by post nonlinear processing. To improve the performance of DS-CDMA systems, the chip waveform and receiver should be properly selected. This paper presents a systematic performance analysis of a matched filter receiver and zero-forcing filter (ZF) receiver for DS-CDMA using a time-limited partial response chip waveform. Nevertheless the systematic performance analysis is applicable to bandlimited chip pulse as well. For the zero-forcing filters, we propose to select the frequency responses that satisfy the first Nyquist criterion. With this class of filters, we can choose the roll-off factor to minimize the total power of multiple access interference and noise power. The zero-forcing filter with proper choice of roll-off factor, referred to as optimum ZF, yields a performance better than the matched filter counterpart. The bit error rate (BER) performance of the optimum ZF with superposed quadrature amplitude modulation signal as the time pulse waveform is evaluated. It is shown that the optimum ZF provides better BER performance than conventional OQPSK and minimum shift keying, and its envelope uniformity is much better than that of OQPSK.     

On the capacities of bipartite Hamiltonians and unitary gates

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.     

Time domain Green's functions for lossy and dispersive multilayered media

We have introduced a fast method of calculating the time domain Green's functions for multilayered media. In this paper, we demonstrate the use of this method to compute the scalar potential Green's function for a multilayer lossy dispersive medium on a PEC ground. The strength of the method lies in obtaining the Green's function for many source-to-field distances /spl rho/ and time instances t simultaneously. It only takes 6 min 28 s to compute 100/spl times/336=33 600 space time Green's function points in Matlab on a Pentium III 867 MHz processor with 1 GB of RAM for a multilayered lossy dispersive medium.     

Low-rate turbo-Hadamard codes

This paper is concerned with a class of low-rate codes constructed from Hadamard code arrays. A recursive encoding principle is employed to introduce an interleaving gain. Very simple trellis codes with only two or four states are sufficient for this purpose, and the decoding cost involved in the trellis part is typically negligible. Both simulation and analytical results are provided to demonstrate the advantages of the proposed scheme. The proposed scheme is of theoretical interest as it can achieve performance of BER=10/sup -5/ at E/sub b//N/sub 0//spl ap/-1.2dB (only about 0.4 dB away from the ultimate low-rate Shannon limit) with an information block size of 65534. To the authors' knowledge, this is the best result achieved to date with respect to the ultimate Shannon limit. With regard to practical issues, the decoding complexity of the proposed code is considerably lower than that of existing low-rate turbo-type codes with comparable performance.     

Two-stage cut saturation algorithm for designing all-opticalnetworks

We design and optimize the physical topology of all-optical networks. This problem is more challenging than the traditional one for electronic communication networks, because of the wavelength-continuous constraint and it involves routing and wavelength assignment. In this problem, we are given the number of lightpaths required by every node pair and a cost specification, and our objective is to determine a physical topology of minimal cost. We formulate the problem, prove that it is NP-hard, and design an efficient algorithm called two-stage cut saturation algorithm for it. In the first stage, we relax the wavelength-continuous constraint and apply the main idea of the cut saturation method to determine a good initial network. In the second stage, we impose the wavelength-continuous constraint and perform routing and wavelength assignment to establish the specified lightpaths on the initial network. When some lightpaths cannot be established, we apply the main idea of the cut saturation method to optimize the insertion of additional links into the network. Simulation results show the following: (1) the proposed algorithm can efficiently design networks with low costs and high utilization and (2) if wavelength converters are available to support full wavelength conversion, the total cost of the links can be significantly reduced     

Derivation of a second-order switching surface in the boundary control of buck converters

A second-order switching surface in the boundary control of buck converters is derived in this letter. The formulated switching surface can make the overall converter exhibit better steady-state and transient behaviors than the one with a first-order switching surface. The switching surface is derived by estimating the state trajectory movement after a switching action, resulting in a high state trajectory velocity along the switching surface. This phenomenon accelerates the trajectory moving toward the target operating point. The proposed control scheme has been successfully applied to a 120-W buck converter. The large-signal performance and a comparison with the first-order switching surface have been studied.     

Modeling Effects of Random Rough Interface on Power Absorption Between Dielectric and Conductive Medium in 3-D Problem

We study the effects of a random rough surface on the power absorption between a dielectric and conductive medium in a 3-D configuration where the surface height varies in both horizontal directions. The analytic small perturbation method of second order and numerical T-matrix method are used. The absorption depends on the root mean square height, correlation length, and correlation function of the random rough surface. A closed-form expression of power absorption enhancement factor is obtained from small perturbation method of second order. Results show that the T-matrix method agrees with the small perturbation method for rough surfaces with a small slope. We further compare the 3-D results to the previous 2-D results and show significant difference. The power absorption enhancement factor exhibits saturation for the Gaussian correlation function, but not for the exponential correlation function