Behavioral synthesis, which automatically synthesizes an RTL circuit from a sequential program, is one of promising technologies to improve the design productivity. This paper proposes a function call optimization method in behavioral synthesis from large sequential programs with a number of functions. We formulate the optimization problem using integer linear programming. Our experimental results show the reduction in the circuit area by up to 44.6%, compared with a traditional method.

We give a centralized deterministic algorithm for constructing linear network error-correcting codes that attain the Singleton bound of network error-correcting codes. The proposed algorithm is based on the algorithm by Jaggi et al. We give estimates on the time complexity and the required symbol size of the proposed algorithm. We also estimate the probability of a random choice of local encoding vectors by all intermediate nodes giving a network error-correcting codes attaining the Singleton bound. We also clarify the relationship between the robust network coding and the network error-correcting codes with known locations of errors.

This paper generalizes parallel error correcting codes proposed by Ahlswede et al. over a new type of multiple access channel called parallel error channel. The generalized parallel error correcting codes can handle with more errors compared with the original ones. We show construction methods of independent and non-independent parallel error correcting codes and decoding methods. We derive some bounds about the size of respective parallel error correcting codes. The obtained results imply a single parallel error correcting code can be constructed by two or more kinds of error correcting codes with distinct error correcting capabilities.

This paper presents a partially resonant active filter based on a digital PWM control circuit with a DSP that can improve the power factor and input current harmonic distortion factor of distributed power supply systems in communications buildings. The steady-state and dynamic characteristics of this active filter are analyzed experimentally and the relationship between the control variables of digital control circuit with the DSP and performance characteristics such as regulation of the output voltage, input power factor, input current harmonic distortion factor, boundaries of stabilities and transient response are defined. Using the partially resonant circuit, the efficiency is over 91%, which is 0.9 point higher than that of non-resonant circuit and the high frequency switching noise is suppressed. Furthermore, the digital control strategy with the DSP proposed in this paper can realize the superior transient response of input current and output voltage for the step change of load, the power factor over 0.99 and total harmonic distortion factor less than 1.1%.

Despite the extensive literature on current conveyor-based voltage-mode universal biquads with single input and multiple outputs, no filter circuits have been reported to date which simultaneously achieve all of the advantageous features: (i) employment of only one differential difference current conveyor (DDCC), (ii) employment of only two grounded capacitors, (iii) employment of only three resistors, (iv) simultaneous realization of voltage-mode low-pass, band-pass, and high-pass filter signals from the three output terminals, respectively, (v) no need to employ inverting type input signals, and (vi) no need to impose component choice.

As a fundamental building block of multirate systems, the downsampler, also known as the decimator, is a periodically time-varying linear system. An eigensignal of the downsampler is defined to be an input signal which appears at the output unaltered or scaled by a non-zero coefficient. In this paper, the eigensignals are studied and characterized in the time and z domains. The time-domain characterization is carried out using number theoretic principles, while the one-sided z-transform and Lambert-form series are used for the transform-domain characterization. Examples of non-trivial eigensignals are provided. These include the special classes of multiplicative and completely multiplicative eigensignals. Moreover, the locus of poles of eigensignals with rational z transforms are identified.

A simple and efficient semi-supervised classification method is presented. An unsupervised spectral mapping method is extended to a semi-supervised situation with multiplicative modulation of similarities between data. Our proposed algorithm is derived by linearization of this nonlinear semi-supervised mapping method. Experiments using the proposed method for some public benchmark data and color image data reveal that our method outperforms a supervised algorithm using the linear discriminant analysis and a previous semi-supervised classification method.

In this paper, we present an efficient variant of the Boneh-Franklin scheme that achieves a tight security reduction. Our scheme is basically an IBE scheme under two keys, one of which is randomly chosen and given to the user. It can be viewed as a continuation of an idea introduced by Katz and Wang; however, unlike the Katz-Wang variant, our scheme is quite efficient, as its ciphertext size is roughly comparable to that of the original full Boneh-Franklin scheme. The security of our scheme can be based on either the gap bilinear Diffie-Hellman (GBDH) or the decisional bilinear Diffie-Hellman (DBDH) assumptions.

In this paper, CPW-fed slot antennas using loading metallic strips and a widened tuning stub (CPW-FSLW) which provides wideband operation on the flat, a Λ-shape reflector with horizontal plate that prevents the back radiation and provides the uni-directional radiation are investigated. We observe that the size and shape of the reflector have significant impact on the impedance matching and radiation patterns. By fabricating the CPW-FSLW on the Λ-shape reflector with horizontal plate structure, noticeable enhancements in both radiation pattern and bandwidth are achieved. The antennas are verified both through numerical simulations and also measurements of the experimental prototypes and these confirm the good performance antennas. It is found that the proposed antenna can deliver a measured impedance bandwidth of 64% from 1.6 to 3.1 GHz for VSWR ≤ 2. The antennas are designed to have wideband operation suitable for applications in GSM1800, GSM1900, PCS, IMT-2000 and WLAN bands.

In space division multiplexing with orthogonal frequency division multiplexing (SDM-OFDM) systems, since co-channel interference (CCI) degrades the demodulation performance, CCI suppression is essential. For CCI suppression, the turbo detector using the soft-input soft-output maximum likelihood detector (SISO-MLD) is proposed. Although SISO-MLD can deal with soft information, SISO-MLD updates only a priori information of code bits at each iteration. This prevents the performance to be improved. Meanwhile, a turbo detector with soft cancellation (SC) followed by minimum mean square error (MMSE) filter, in which the variance of the residual interference components as well as a priori information can be updated at each iteration, is well known. However, the performance of SC/MMSE detector is also limited because it is proposed to reduce the computational complexity at the cost of performance degradation. In this paper, we propose an SC-type turbo detector which uses SISO-MLD for SDM-OFDM systems. In our proposed detector, the soft cancellation unit of the SC-type turbo detector is modified to cope with the SISO-MLD. From the simulation results, the proposed SC/MLD provides a better BER performance than the turbo detector using SISO-MLD. Furthermore, the proposed SC/MLD can attain the bit error rate (BER) equivalent to that of the SC/MMSE detector with a smaller computational complexity.

The radiation characteristics of a monopole antenna that consists of one-half of a bow-tie dipole antenna, made of optically transparent conductive thin film and mounted above a ground plane, are investigated. The antenna's performance is measured for several films with different sheet resistivities. It is found that the gain lowering of the antenna caused by material resistance decreases from 4.4 dB to 0.2 dB at 2.4 GHz and the efficiency of the antenna increases from 46% to 93% at the same frequency, as the sheet resistivity decreases from 19.8 Ω/ to 1.3 Ω/. The antenna is analyzed by the moment method. A wire-grid model with resistance loading on every discretized wire is applied. The analyzed results agree with the experimental values very well.

The reflection method is an accurate and simple method for measuring the radiation efficiency of a small antenna. However, it takes too long and has the disadvantage of underestimating the efficiency due to resonance in the cavity formed by the straight waveguide and two sliding shorts. To reduce the measurement time, one sliding short can be fixed while the other one is moved. To improve the accuracy of this technique, we can set the antenna to be measured at the center of the two sliding shorts or at a local anti-node of the standing wave in the waveguide. When one of the sliding shorts is fixed, the measured efficiency becomes negative at certain frequencies. We examine these reductions in efficiency using an equivalent transmission line model for the reflection method. We also derive analytical expressions for the overall efficiency in the above cases and verify new procedures that enable measurements to be performed without any drops in the measured efficiency.

This paper proposes a new type of compact waveguide directional coupler, which is constructed from two crossed E-plane rectangular waveguide with two metallic posts in the square junction and one metallic post at each port. The metallic posts in the square junction are set symmetrically along a diagonal line to obtain the directivity properties. The metallic post inserted at each input/output waveguide port can realize a matched state. Tight-coupling properties 0.79-6 dB are realized by optimizing the dimension of the junction and the positions/radii of the posts. The design results are verified by an em-simulator (Ansoft HFSS) and experiments.

The average bit erasure probability of a binary linear code ensemble under maximum a-posteriori probability (MAP) decoding over binary erasure channel (BEC) can be calculated with the average support weight distribution of the ensemble via the EXIT function and the shortened information function. In this paper, we formulate the relationship between the average bit erasure probability under MAP decoding over BEC and the average support weight distribution for a binary linear code ensemble. Then, we formulate the average support weight distribution and the average bit erasure probability under MAP decoding over BEC for regular LDPC code ensembles.

We consider the blind recovery problem such that images embedded with side information are given, and we want to obtain the side information under some prescribed constraints. In this case, the system equation becomes y=Ax+b where in addition to the unknown A and x, b also is an unknown quantity and but clearly not a noise component. We assume that several images with the same embedding side information are given, and the image processing to b is described as the perturbation of A. We formulate the optimization function to obtain A, b and x, under the constraint of some finite brightness levels i.e. finite alphabets.

3D video, which consists of a sequence of mesh models, can reproduce dynamic scenes containing 3D information. To summarize 3D video, a key frame extraction method is developed using rate-distortion (R-D) trade-off. For this purpose, an effective feature vector is extracted for each frame. Shot detection is performed using the feature vectors as a preprocessing followed by key frame extraction. Simple but reasonable definitions of rate and distortion are presented. Based on an assumption of linearity, an R-D curve is generated in each shot, where the locations of the key frames are optimized. Finally, R-D trade-off can be achieved by optimizing a cost function using a Lagrange multiplier, where the number of key frames is optimized in each shot. Therefore, our system will automatically determine the best locations and the number of key frames in the sense of R-D trade-off. Our experimental results show the extracted key frames are compact and faithful to the original 3D video.

The trend of microwave circuits has been toward highly integrated systems. Most design tools for designing microwave circuits mounted the linear or the nonlinear devices adopt the fundamental circuit theory using the S matrix on the frequency domain. The harmonic balance method is also used to correspond to the nonlinear circuit. Therefore, the effect of the electromagnetic field, for example, a mutual coupling between sub-circuits through the space is almost disregarded. To calculate these circuits included its surrounding electromagnetic field, the finite difference time domain method combined with the equivalent circuit simulation had been presented as the lumped element FDTD (LE-FDTD) method. In general, even if an analytical target is a linear circuit, the FDTD method requires very long analytical time. In this paper, we propose an efficient LE-FDTD method to reduce the analytical time. We investigate its efficiency to compare with the conventional LE-FDTD method or measurements, consequently, it is confirmed that the proposal method requires only at analytical time of 1/10 compared with the conventional method. We also show that the proposal method is able to analyze characteristics of the active integrated antenna (AIA) which are practicably impossible to analyze by using the conventional method.

Recently, a lot of UWB antennas have been reported by many research groups. Most of the reported antennas have omnidirectional radiation characteristics. The disadvantage of using omnidirectional antennas is that the antenna performance can be degraded by adjacent walls or metals. If unidirectional UWB antennas are utilized, the degradation on the antenna performance due to omnidirectionality can be avoided. Another important topic in UWB antennas is the waveform distortion caused by antennas' transmission characteristics. In impulse-based UWB communications, waveform distortions of transmitted and received pulses caused by antennas deteriorate the communication performance. Therefore, the development of UWB antennas having small waveform distortions is highly desirable. In this paper, we propose a novel bowtie antenna using leaf-shaped radiating elements and a flat reflector. This antenna has unidirectional radiation patterns over the frequency range of 3.0 to 10.5 GHz. The actual gain in the maximum radiation direction is 6.0-9.0 dBi in the frequency range of 4.5-9.4 GHz (relative bandwidth of 71%). The cross-correlations between source pulse and received pulse waveforms are 0.89-0.94, and hence the waveform distortion caused by this antenna is relatively small. As a result, the proposed antenna is useful for impulse-based UWB communication systems using correlation detection.

Multiple access points (APs) are much more likely to be available for stations (STAs) due to the popularity of wireless LANs. The serious issue of how an appropriate AP is selected from those that are available in a wireless LAN therefore arises. We discuss the development of a decentralized architecture for selecting APs, and examine its fundamental characteristics. The proposed architecture should be introduced without adversely affecting the performance of the existing common architecture that is currently being deployed. Therefore, the deployability of our architecture is examined in this respect. Furthermore, the dynamic behavior of the proposed architecture is studied in addition to static characteristics to evaluate its robustness against various dynamic changes in situation due to AP breakdowns and bursty arrivals of STAs. Simulations revealed that the proposed architecture can attain excellent performance in all the cases treated here.

There are three well-known identification schemes: the Fiat-Shamir, GQ and Schnorr identification schemes. All of them are proven secure against the passive or active attacks under some number-theoretic assumptions. However, efficiencies of the reductions in those proofs of security are not tight, because they require "rewinding" a cheating prover. We show an identification scheme IDKEA1, which is an enhanced version of the Schnorr scheme. Although it needs the four exchanges of messages and slightly more exponentiations, the IDKEA1 is proved to be secure under the KEA1 and DLA assumptions with tight reduction. The idea underlying the IDKEA1 is to use an extractable commitment for prover's commitment. In the proof of security, the simulator can open the commitment in two different ways: one by the non-black-box extractor of the KEA1 assumption and the other through the simulated transcript. This means that we don't need to rewind a cheating prover and can prove the security without loss of the efficiency of reduction.