The problem of analyzing transient in transmission line circuits is studied with emphasis on obtaining the transient voltage and current distributions. A new method for solving Telegrapher equation that characterizes the uniform transmission lines is presented. It not only gives the time domain solution of the line terminal voltage and current, but also their distributions within the lines. The method achieves its goal by treating the voltage and current distributions as distributed state variables and transforms the Telegrapher equation into an ordinary differential equation. This allows the coupled transmission lines to be treated as a single component that behaves like other lumped dynamic components, such as capacitors and inductors. Using Backward Differentiation Formulae for time discretization, the transmission line component is converted to its time domain companion model, from which its local truncation error for time step control can be derived. As the shapes of the voltage and current distributions get more complicated with time, they can be approximated by piecewise exponential functions with controllable accuracy. A segmentation algorithm is thus devised so that the line is dynamically bisected to guarantee that the total piecewise exponential approximation error is only a small fraction of the local truncation error. Using this approach, the user can see the line voltage and current at any point and time freely without explicitly segment the line before starting the simulation.

A prototype of a three-axis electro-optic (EO) probe is developed that has the linearity of approximately 0.5 dB in the specific absorption rate (SAR) range of 0.01 to 100 W/kg and the directivities are eight-shaped with cross-axis sensitivity isolation of greater than 30 dB. It is confirmed that electric fields and SAR distributions can be measured using a three-axis EO probe.

In static wireless ad hoc networks such as wireless mesh networks and wireless sensor networks, multipath routing techniques are very useful for improving end-to-end delay, throughput, and load balancing, as compared to single-path routing techniques. When determining multiple paths, however, multipath routing protocols should address the well-known route coupling problem that results from a geographic proximity of adjacent routes and that hampers performance gain. Although a lot of multipath routing protocols have been proposed, most of them focused on obtaining node or link-disjoint multipaths. In order to address the route coupling problem, some multipath routing protocols utilizing zone-disjointness property were proposed. However, they suffer from an overhead of control traffic or require additional equipment such as directional antenna. This paper therefore proposes a novel multipath routing protocol, based on geographical information with low overhead, called 3-directional zone-disjoint multipath routing protocol (3DMRP). 3DMRP searches up to three zone-disjoint paths by using two techniques: 1) greedy forwarding, and 2) RREP-overhearing. One primary and two secondary paths are obtained via greedy forwarding in order to reduce control overhead, and these secondary paths are found by avoiding the RREP overhearing zone created during the primary path acquisition. In particular, two versions of 3DMRP are introduced in order to avoid the RREQ-overhearing zone. Through ns-2 simulations, 3DMRP is evaluated to verify that it achieves performance improvements in terms of throughput and control overhead.

A subdivision of a rectangle into rectangular faces with horizontal and vertical line segments is called a rectangular drawing or floorplan. It has been an open problem to determine whether there exist a polynomial time algorithm for computing R(n). We affirmatively solve the problem, that is, we introduce an O(n4)-time and O(n3)-space algorithm for R(n). The algorithm is based on a recurrence for R(n), which is the main result of the paper. We also implement our algorithm and computed R(n) for n 3000.

Image restoration based on Bayesian estimation in most previous studies has assumed that the noise accumulated in an image was independent for each pixel. However, when we take optical effects into account, it is reasonable to expect spatial correlation in the superimposed noise. In this paper, we discuss the restoration of images distorted by noise which is spatially correlated with translational symmetry in the realm of probabilistic processing. First, we assume that the original image can be produced by a Gaussian model based on only a nearest-neighbor effect and that the noise superimposed at each pixel is produced by a Gaussian model having spatial correlation characterized by translational symmetry. With this model, we can use Fourier transformation to calculate system characteristics such as the restoration error and also minimize the restoration error when the hyperparameters of the probabilistic model used in the restoration process coincides with those used in the formation process. We also discuss the characteristics of image restoration distorted by spatially correlated noise using a natural image. In addition, we estimate the hyperparameters using the maximum marginal likelihood and restore an image distorted by spatially correlated noise to evaluate this method of image restoration.

It is a very important and intriguing problem in digital image-processing to decompose an input image into intuitively convincible image-components such as a structure component and a texture component, which is an inherently nonlinear problem. Recently, several numerical schemes to solve the nonlinear image-decomposition problem have been proposed. The use of the nonlinear image-decomposition as a pre-process of several image-processing tasks will possibly pave the way to solve difficult problems posed by the classic approach of digital image-processing. Since the new image-processing approach via the nonlinear image-decomposition treats each separated component with a processing method suitable to it, the approach will successfully attain target items seemingly contrary to each other, for instance invisibility of ringing artifacts and sharpness of edges and textures, which have not attained simultaneously by the classic image-processing approach. This paper reviews quite recently developed state-of-the-art schemes of the nonlinear image-decomposition, and introduces some examples of the decomposition-and-processing approach.

This letter proposes a high precision ranging scheme based on the time of arrival estimation technique for the IEEE 802.15.4a chirp spread spectrum system. The proposed scheme consists of a linear channel impulse response estimation process with the zero forcing or minimum mean square error technique and the multipath delay estimation process with matrix pencil algorithm. The performance of the proposed scheme is compared with that of a well known MUSIC algorithm in terms of computational complexity and ranging precision. Simulation results demonstrate that the proposed scheme outperforms the MUSIC algorithm even though it has comparatively lower computational complexity.

For statistical language model training, target domain matched corpora are required. However, training corpora sometimes include both target domain matched and unmatched sentences. In such a case, training set selection is effective for both reducing model size and improving model performance. In this paper, training set selection method for statistical language model training is described. The method provides two advantages for training a language model. One is its capacity to improve the language model performance, and the other is its capacity to reduce computational loads for the language model. The method has four steps. 1) Sentence clustering is applied to all available corpora. 2) Language models are trained on each cluster. 3) Perplexity on the development set is calculated using the language models. 4) For the final language model training, we use the clusters whose language models yield low perplexities. The experimental results indicate that the language model trained on the data selected by our method gives lower perplexity on an open test set than a language model trained on all available corpora.

With the rapid progress of electronic and information technology, an expectation for the realization of body area network (BAN) by means of ultra wide band (UWB) techniques has risen. Although the signal from a single UWB device is very low, the energy absorption may increase significantly when many UWB devices are simultaneously adorned to a human body. An analysis method is therefore required from the point of view of biological safety evaluation. In this study, two approaches, one is in the time domain and the other is in the frequency domain, are proposed for the specific energy absorption (SA) and the specific absorption rate (SAR) calculation. It is shown that the two approaches have the same accuracy but the time-domain approach is more straightforward in the numerical analysis. By using the time-domain approach, SA and SAR calculation results are given for multiple UWB pulse exposure to an anatomical human body model under the Federal Communications Commission (FCC) UWB limit.

The body area network (BAN) has attracted attention because of its potential for high-grade wireless communication technology and its safety and high durability. Also, human area transmission of a BAN propagating at an ultra-wide band (UWB) has been demonstrated recently. When considering the efficiency of electromagnetic (EM) propagation inside the human body for BAN and hyperthermia treatment using RF, it is important to determine the mechanism of EM dissipation in the human body. A body heating system for hyperthermia must deposit EM energy deep inside the body. Also, it is important that the EM field generated by the implant system is sufficiently strong. In this study, the specific absorption rate (SAR) distribution is simulated using an EM simulator to consider the biological transmission mechanism and its effects. To utilize the EM field distribution using an implant system for hyperthermia treatment, the SAR distribution inside the human body is simulated. As a result, the SAR distribution is concentrated on the surface of human tissue, the muscle-bolus interface, the pancreas, the stomach, the spleen and the regions around bones. It can also be concentrated in bone marrow and cartilage. From these results, the appropriate location for the implant system is revealed on the basis of the current distribution and differences in the wave impedance of interfacing tissues. The possibility of accurate data transmission and suitable treatment planning is confirmed.

This paper investigates and analyzes the resistive averaging network and interpolation technique to estimate the power consumption of preamplifier arrays in a flash analog-to-digital converter (ADC). By comparing the relative power consumption of various configurations, flash ADC designers can select the most power efficient architecture when the operation speed and resolution of a flash ADC are specified. Based on the quantitative analysis, a compact 5-bit flash ADC is designed and fabricated in a 0.13-µm CMOS process. The proposed ADC consumes 180 mW from a 1.2-V supply and occupies 0.16-mm2 active area. Operating at 3.2 GS/s, the ENOB is 4.44 bit and ERBW 1.65 GHz. At 4.2 GS/s, the ENOB is 4.20 bit and ERBW 1.75 GHz. This ADC achieves FOMs of 2.59 and 2.80 pJ/conversion-step at 3.2 and 4.2 GS/s, respectively.

This paper presents the computational electromagnetic dosimetry inside an anatomically based pregnant woman models exposed to electromagnetic wave during magnetic resonance imaging. The two types of pregnant woman models corresponding to early gestation and 26 weeks gestation were used for this study. The specific absorption rate (SAR) in and around a fetus were calculated by radiated electromagnetic wave from highpass and lowpass birdcage coil. Numerical calculation results showed that high SAR region is observed at the body in the vicinity of gaps of the coil, and is related to concentrated electric field in the gaps of human body such as armpit and thigh. Moreover, it has confirmed that the SAR in the fetus is less than International Electrotechnical Commission limit of 10 W/kg, when whole-body average SARs are 2 W/kg and 4 W/kg, which are the normal operating mode and first level controlled operating mode, respectively.

We propose a protocol for converting the encryption function of a ciphertext into another encryption function while keeping the corresponding message secret. The proposed protocol allows conversions of the El Gamal and Paillier cryptosystems and has the potential to design an efficient multiparty protocol intended for circuits consisting of arithmetic and logical operations. We clarify the condition of circuits such that the multiparty protocol based on the proposed protocol provides better performance than previous approaches. In addition, we introduce some privacy-preserving statistical computations as an effective application of the proposed protocol.

The code length of Tardos's collusion-secure fingerprint code is of theoretically minimal order with respect to the number of adversarial users (pirates). However, the constant factor should be further reduced for practical implementation. In this article, we improve the tracing algorithm of Tardos's code and propose a 2-secure and short random fingerprint code, which is secure against collusion attacks by two pirates. Our code length is significantly shorter than that of Tardos's code and its tracing error probability is practically small.

Code construction for digital fingerprinting, which is a copyright protection technique for multimedia, is considered. Digital fingerprinting should deter collusion attacks, where several fingerprinted copies of the same content are mixed to disturb their fingerprints. In this paper, we consider the averaging attack, which is known to be effective for multimedia fingerprinting with the spread spectrum technique. We propose new methods for constructing fingerprinting codes to increase the coding rate of conventional fingerprinting codes, while they guarantee to identify the same number of colluders. Due to the new fingerprinting codes, the system can deal with a larger number of users to supply digital contents.

Current sub-pixel motion estimation algorithm is time and memory-consuming when performing image compression and communication. So we propose a selective interpolation method for sub-pixel motion estimation. We applied selective interpolations after estimating a candidate for sub-pixel accuracy motion vector from the simplest mathematical model. According to simulation results, the proposed method attains nearly the same performance as the full-search for half-pixel motion estimation with much lower computational complexity.

It's a trend to consider the power supply integrity at early stage to improve the design quality. Specifically, floorplanning process is modified to improve the power supply as well. In the modified floorplanning process, both the floorplan and power/ground (P/G) network are adjusted to search for optimal floorplan as well as the most robust power supply. In this paper, we propose a novel algorithm to carry out this modified floorplanning. A new analytical method is proposed to estimate the voltage drop while the floorplan is varying constantly. This fast analytical voltage drop estimating method is plugged into the modified floorplanner to speed up the whole floorplanning process. Compared with previous methods, our algorithm can search for the optimal floorplan with consideration of power supply integrity more efficiently and therefore leads to better results. Furthermore, this paper also proposes a novel heuristic method to optimize the topology of P/G network. This optimization algorithm could construct a more robust power supply system. Experimental results show the method can speedup the IR-drop aware floorplanning process by about 10 times and reduce the routing area of P/G network while maintaining the floorplan quality and power supply integrity.

With the development of digital TV system, how to display the NTSC signal in digital TV system is a problem. De-interlacing is an algorithm to solve it. In previous papers, using motion compensation (MC) method for de-interlacing needs lots of computation complexity and it is not easy to implement in hardware. In this paper, a content adaptive de-interlacing algorithm is proposed. Our algorithm is based on the motion adaptive (MA) method which combines the advantages of intra-field and inter-field method. We propose a block type decision mechanism to predict the video content instead of a blind processing with MC method throughout the entire frame. Additionally, in intra-field method, we propose the edge-base adaptive weight average (EAWA) method to achieve a better performance and smooth the edge and stripe. In order to demonstrate our algorithm, we implement the de-interlacing system on the DSP platform with thorough complexity analysis. Compared to MC method, we not only achieve higher video quality in objective and subjective view, but also consume lower computation power. From the profiling on CPU run-time analysis, the proposed algorithm is only one-fifth of MC method. At the DSP demonstration board, the saving ratio is about 54% to 96%.

In human-machine systems, a user gets abstracted information of a machine via an interface and operates it referring to a manual. If a manual has an erroneous description leading to automation surprises, the user may be lost in his/her operations so that he/she may make a serious human error. In this paper, we propose an algorithm for generating a manual by which automation surprises never occur. We model the machine and the interface as a discrete event system and a mapping from machine's state to a display of the interface, respectively. First, we represent a manual as a finite language and model behavior of the system operated by the user with the manual as a tree called an operational tree. Next, we characterize three automation surprises using the tree. Finally, we propose an algorithm for generating an operational tree by which the machine reaches a target state.

We describe an evaluation system consisting of an evaluation and interpretation model to totally assess and interpret an end-user's computing capability. It includes four evaluation factors and eighteen items, the complex indicators, an evaluation process, and method. We verified the model construct was verified by factor analysis and reliability analysis through a pilot test. We confirmed the application of the developed system by applying the model to evaluating end-users in a computing business environment and presenting the results. This system contributes to developing a practical system for evaluating an end-user's computing capability and hence for improving computing capability of end-users.