This paper describes synthesis of a complex RiCR filter with a finite transmission zero except zero frequency. The frequency response of the proposed filter is similar to the conventional elliptic filter. The proposed filter can be composed of fewer elements than the conventional one. A new kernel function is proposed. As an example, a fifth-order RiCR filter is designed. We compare the proposed filter with the conventional complex elliptic filter from the viewpoint of the frequency response and the number of the required elements.

Temperature dependence of drain current is analyzed in detail in terms of mobility and threshold voltage. From the analyses, it is proved that a point exists that the drain current is fixed without depending on temperature when the MOSFET operates in strong inversion. Applying this characteristic, a CMOS temperature-voltage converter operating in strong inversion with high linearity is proposed. SPICE simulation and experimental results are shown, and the corresponding performances are discussed.

Goldwasser and Sipser proved that every interactive proof system can be transformed into a public-coin one (a.k.a. an Arthur-Merlin game). Unfortunately, the applicability of their transformation to cryptography is limited because it does not preserve the computational complexity of the prover's strategy. Vadhan showed that this deficiency is inherent by constructing a promise problem Π with a private-coin interactive proof that cannot be transformed into an Arthur-Merlin game such that the new prover can be implemented in polynomial-time with oracle access to the original prover. However, the transformation formulated by Vadhan has a restriction, i.e., it does not allow the new prover and verifier to look at common input. This restriction is essential for the proof of Vadhan's negative result. This paper considers an unrestricted transformation where both the new prover and verifier are allowed to access and analyze common input. We show that an analogous negative result holds even in this unrestricted case under a non-standard computational assumption.

This paper presents a novel wavelet compression technique to increase compression of images. Based on zerotree entropy coding method, this technique initially uses only two symbols (significant and zerotree) to compress image data for each level. Additionally, sign bit is used for newly significant coefficients to indicate them being positive or negative. Contrary to isolated zero symbols used in conventional zerotree algorithms, the proposed algorithm changes them to significant coefficients and saves its location, they are then treated just like other significant coefficients. This is done to decrease number of symbols and hence, decrease number of bits to represent the symbols used. In the end, algorithm indicates isolated zero coordinates that are used to change the value back to original during reconstruction. Noticeably high compression ratio is achieved for most of the images, without changing image quality.

There are two main types of digital watermark systems. In the first, users are given their own detection programs by which to verify the presence of watermark in data they have in their possession. In the second, users must request such verification from a detection center. The disadvantage of the first type is the possibility that a user might be able to analyze the detection program sufficiently to be able to obtain the secret data (secret key) used to embed the watermark. The disadvantage of the second is the possibility that a center might give dishonest results. In this paper, we propose a watermark detection scheme that can be used to overcome the disadvantages of both: it prevents users from obtaining secret key, and it prevents a center from reporting dishonest results. Our scheme is based on a previously proposed scheme which nearly achieved the same goals but, unfortunately, allowed users to receive watermark detection results for data specially created by them so as to reveal, through the results, secret information about how a center created its watermarks. To overcome this drawback, we have developed new scheme by which a center can prove its detection results to a user without revealing any other information. This scheme was developed by extending the work found in. Moreover we provide an option that prevents the center from encroaching on a user's privacy. The resulting watermark detection scheme is the first that, in addition to protecting secret keys of watermarks from user-tampering, is also able to prevent a center from reporting dishonest results. Although the proposed scheme is introduced first using the patch-work watermarking system, it is straightforward to extend it to a scheme that uses the correlation-based watermarking system, which yields a more robust watermark detection scheme.

The present paper introduces a new construction of a class of binary sequence set having a zero-correlation zone (hereafter binary zcz sequence set). The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. This paper shows that such a construction generates a binary zcz sequence set from an arbitrary pair of Hadamard matrices of common size. Since the proposed sequence construction generates a sequence set from an arbitrary pair of Hadamard matrices, many more types of sequence sets can be generated by the proposed sequence construction than is possible by a sequence construction that generates sequence sets from a single arbitrary Hadamard matrix.

In this paper, the method of locating multiple transmission zeros by the tap-coupling technique is described for bandpass filters (BPFs), using short-ended λ/2 resonators and its application to a duplexer. First, the method of locating the transmission zero using the short-ended λ/2 resonators is examined with various excitation methods. We focus on four types of short-ended λ/2 resonators: the end-coupling type, tap-coupling type, capacitive tap-coupling type and inductive tap-coupling type. Secondly, the BPFs based on the basic characteristics of the respective resonators are proposed and designed on the basis of a general filter theory with narrow band approximation. Lastly, we propose and design new duplexers consisting of the proposed BPFs. The results lead to the conclusion that the basic characteristics of the short-ended λ/2 resonators are useful for realizing a BPF with multiple transmission zeros and a high-performance duplexer fabricated without increasing the number of elements.

In this paper, a new Hierarchical Sum of Double Difference metric, HSDD, is introduced. It is shown, as opposed to conventional Sum of Absolute Difference (SAD) metric, how this zerotree coding aware metric can jointly constrain the motion vector searching for both temporal and spatial (quad-tree) directions under multiresolution motion estimation framework. The reward from the temporal-spatial co-optimization concept of HSDD is that fewer bits are spent later for describing the isolated zeros. The embedded wavelet video coder using HSDD metric was tested with a set of video sequences and the compression performance seems to be promising.

A general circuit model of a filter having one cross coupling path is analyzed, and a new theory is developed for the design of a filter with transmission zeros in its stopband. By using the derived formulas, the reactance element values in the cross coupling path are determined readily. The transmission zeros can thus be assigned at desired frequencies. Various design examples are provided, together with simulated results, which validate the proposed theory.

The present letter introduces a new approach to the construction of a set of ternary arrays having a zero-correlation zone. The proposed array set has a zero-correlation zone for both periodic and aperiodic correlation functions. As such, the proposed arrays can be used as a finite-size array having a zero-correlation zone. The proposed array sets can be constructed from an arbitrary Hadamard matrix. The member size of the proposed array set is close to the theoretical upper bound.

The present paper introduces a new approach to the construction of a class of ternary sequences having a zero-correlation zone. The cross-correlation function of each pair of the proposed sequences is zero for phase shifts within the zero-correlation zone, and the auto-correlation function of each proposed sequence is zero for phase shifts within the zero-correlation zone, except for zero-shift. The proposed sequence set has a zero-correlation zone for periodic, aperiodic, and odd correlation functions. As such, the proposed sequence can be used as a finite-length sequence with a zero-correlation zone. A set of the proposed sequences can be constructed for any set of Hadamard sequences of length n. The constructed sequence set consists of 2n ternary sequences, and the length of each sequence is (n+1)2m+2 for a non-negative integer m. The periodic correlation function, the aperiodic correlation function, and the odd correlation function of the proposed sequences have a zero-correlation zone from -(2m+1-1) to (2m+1-1). The member size of the proposed sequence set is of the theoretical upper bound of the member size of a sequence having a zero-correlation zone. The ratio of the number of non-zero elements to the the sequence length of the proposed sequence is also .

In this paper, we analyze wavelet-based coding in a rate-distortion (R-D) sense by using Laplacian and Markov models and verify the results with the performance of the typical embedded coders, EZW and SPIHT, and the non-embedded coder implemented here. Laplacian represents the probability density function (pdf) of wavelet coefficients and Markov statistical dependency within and among subbands. The models allow us to easily understand the behavior of a thresholding and quantization part and a lossless coding part and associate the embedded coders with the nonembedded coder, which is the point the paper approaches. The analytic results are shown to coincide well with the actual coding results.

This paper presents a hardware-efficient architecture of tree-depth scan (TDS) and multiple quantization (MQ) scheme for zerotree coding in MPEG-4 still texture coder. The proposed TDS architecture can achieve its maximal throughput to area ratio and minimize the external memory access with only one wavelet-tree size on-chip buffer. The MQ scheme adopts the power-of-two (POT) quantization to realize a cost-effective hardware implementation. The prototyping chip has been implemented in TSMC 0.35 µm CMOS 1P4M technology. This architecture can handle 30 4-CIF (704576) frames per second with five spatial scalability and five SNR scalability layers at 100 MHz working frequency.

For real-time systems, multiprocessor support is indispensable to handle the large number of requests. Existing on-line scheduling algorithms such as Earliest Deadline First Algorithm (EDF) and Least Laxity Algorithm (LLA) may not be suitable for scheduling hard real-time tasks on multiprocessors. Although EDF has a low context switching overhead, it can produce arbitrarily low processor utilization. LLA has been shown as suboptimal, but has the potential for higher context switching overhead. We propose new on-line scheduling algorithms Earliest Deadline/Least Laxity (ED/LL) and Earliest Deadline Zero Laxity (EDZL) for identical multiprocessors. We show that ED/LL is suboptimal for multiprocessors and EDZL is suboptimal for two processors. Experimental results show that ED/LL and EDZL have low context switching overhead and low deadline miss rate.

We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs O(N) computations, and thus inefficient, where N indicates the divisibility precision. For example, in case of N=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of N=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other N which is more than about 100.

In this paper, a novel method of clock feedthrough reduction in CMOS autozeroed operational amplifiers with three-phase clock operation is presented. The operational amplifiers in the method are configured by two autozeroed-gain stages. The differential input stage and the second output gain stage are autozeroed individually by a three-phase clock for autozeroing. The three-phase clock is provided so as to finish the compensation period of the input stage earlier than the end of the second stage compensation period. This operation makes it possible to absorb affection of clock feedthrough in the input stage with the second stage. As a result, residual error of offset compensation is much reduced by the voltage gain of the first stage. The effect of the two-stage autozeroing has been confirmed with SPICE simulation and fabricated CMOS circuit. The results of SPICE simulation showed that the two-stage autozeroed operational amplifier has significant advantage as compared to conventional configuration. Affection of clock feedthrough is reduced to about 1/50 in the two-stage configuration. Fabricated CMOS circuit also showed high potential of the two-stage autozeroed operational amplifier for feedthrough reduction. It has been proven experimentally that the two-stage autozeroing is an effective design approach to reduce clock feedthrough error in CMOS autozeroed operational amplifiers.

In general, the attenuation characteristics of band-pass filters can be improved by generating attenuation poles in the stop band. In this paper, a design method for a planar band-pass filter with attenuation poles based on a half-wavelength resonator is proposed. According to this design, the attenuation poles can be obtained at any desired frequency by means of coupling structures. Two kinds of filter with the characteristics of steep skirt and wide stop-band were designed and fabricated with the result that the validity of the design method was demonstrated. Therefore, a filter with excellent attenuation characteristics for various applications can be achieved.

In this paper, we present a new approach to the construction of a set of binary sequences with a zero-correlation zone. The set consists of n pairs of binary sequences and the length of each binary sequence is n2(m+2) for some integers m and n. The Hadamard sequences with length n are used to construct the set. Any sequence in the set has 2(m+1) subsequences, each of length 2n. The author proves that any two subsequences are orthogonal if they belong to different pairs of binary sequences in the set.

We report the measurements on the ramp-edge type Josephson and quasiparticle tunnel junctions with the different interface angle geometry using high-Tc YBa2Cu3O7-y (YBCO) electrodes. The YBCO/I/Ag tunnel junctions with different crystal-interface boundary angles are fabricated for the investigation of zero bias conductance peak. The angle dependent zero bias conductance peak typical to a dx2-y2-wave superconductor is observable. For Josephson junctions, YBCO ramp-edge junctions with different ab-plane electrodes relatively rotated by 45are fabricated using a CeO2 seed-layer technique. The temperature dependence of the maximum Josephson current for YBCO/PBCO/YBCO junctions (PBCO: PrBa2Cu3O7-y) exhibits angle-dependent behavior, qualitatively different from the Ambegaokar-Baratoff prediction. Under microwave irradiation of 9 GHz, the Shapiro steps appear at integer and/or half integer multiples of the voltage satisfying Josephson voltage-frequency relation, whose behavior depends on the sample angle geometry. The results are reasonably interpreted by the dx2-y2-wave theory by taking the zero energy state into account.

In this paper, we review the progress in BiSrCaCuO-2212 Intrinsic Josephson junctions (IJJs) by summarizing our recent results in fabrication and high frequency experiments. Using a double-side fabrication process, a well defined number of intrinsic Josephson junctions in a well defined geometry can be fabricated. The junctions in the stack are quite homogeneous, and the power distribution of external irradiation among the junctions is even. Shapiro steps are clearly observed up to 2.5 THz, and the general condition for the occurrence of Shapiro steps at frequency frf is that it should be much greater than the plasma frequency fpl. Under certain conditions the Shapiro steps are zero-crossing, making some applications possible, such as quantum voltage standard etc.