In this paper, we present the interlaced fast Fourier transform (FFT) method to parallelize the adaptive integral method (AIM) algorithm for the radar cross-section (RCS) computation of large scattering objects in free space. It is noted that the function obtained after convolution is smoother as compared to the original functions. Utilizing this concept, it is possible to interlace the grid current and charge sources in AIM and compute the potentials on each set of interlaced grid independently using FFT. Since the potentials on each interlaced grid are smooth functions in space, we can then interpolate the potentials to every other nodes on the original grid. The final solution of the potentials on the original grid is obtained by summing the total contributions of all the computed and interpolated potentials from every individual interlaced grid. Since the potentials of each interlaced grid can be computed independently without much communication overheads between the processes, such an algorithm is suitable for parallelizing the AIM solver to run on distributed parallel computer clusters. It is shown that the overall computation complexity of the newly proposed interlaced FFT scheme is still of O(N log N).

Although open defects are hard to diagnose because they are unstable, we developed a technique to diagnose completely open defects. We applied a new "segment model" that takes the coupling effects on a defective node that are caused by neighboring nodes into consideration. This technique is used to focuse not only on the behavior of the defective node, but also on the behavior of other nodes affecting its behavior. We explain the theoretical treatment of our model and present experimental results obtained from an actual chip.

In this paper, the magnetic field properties around household appliances are investigated with the single coil model and equivalent source model, which are used as main source models in the European standard EN50366 (CENELEC). The accuracy of the field properties is conducted for the coil model (defined in the EN50366), by comparing with the results of the equivalent source model, which allow the reproduction of the complicated inhomogeneous magnetic field around the appliance with full generality (i.e. supports three dimensional vector fields).

This paper analyzes program and erase mechanisms for Floating Channel type Surrounding Gate Transistor (FC-SGT) Flash memory cells for the first time. In FC-SGT Flash memory cell, control gate, floating gate, drain and source is arranged vertically on the substrate. The body region is isolated from the substrate by the bottom source region. The cell is programmed by applying a high positive voltage to the control gate electrode with drain and source electrodes grounded. Erasing is performed by applying a high positive voltage to the drain and source electrodes with the control gate electrode grounded. The physical models for program and erase operations in FC-SGT Flash memory cell are developed. Program and erase operations based on the developed physical models are simulated by utilizing a device simulator. Program and erase characteristics obtained from the device simulation agree well with the results of analytical models. The FC-SGT Flash memory cell can realize program and erase operation with a floating body structure.

High frequency (HF) diffraction is known as local phenomena, and only parts of the scatterer contribute to the field such as the edge, corner and specular reflection point etc. Many HF diffraction techniques such as Geometrical Theory of Diffraction (GTD), Uniform Theory of Diffraction (UTD) and Physical Theory of Diffraction (PTD) utilize these assumptions explicitly. Physical Optics (PO), on the other hand, expresses the diffraction in terms of radiation integral or the sum total of contributions from all the illuminated parts of scatterers, while the PO currents are locally defined at the point of integration. This paper presents PO-based visualization of the scattering and diffraction phenomena and tries to provide the intuitive understanding of local property of HF diffraction as well as the relations between PO and the ray techniques such as GTD, UTD etc. A weighting named "eye function" is introduced in PO radiation integrals to take into account of local cancellation between rapidly oscillating contributions from adjacent currents; this extracts important areas of current distribution, whose location moves not only with the source but also with the observation point. PO visualization illustrates both local property of HF scattering and defects associated with ray techniques. Furthermore, careful examination of visualized image reminds us of the error factor in PO as applied for curved surfaces, named fictitious penetrating rays. They have been scarcely recognized if not for visualization, though they disturb the geometrical shadow behind the opaque scatterer and can be the leading error factors of PO in shadow regions. Finally, visualization is extended to slot antennas with finite ground planes by hybrid use of modified edge representation (MER) to assess the significance of edge diffraction.

In this letter, we investigate the performance of using subband adaptive loading for the combination of orthogonal frequency division multiplexing (OFDM) and adaptive antenna array. The frequency-domain adaptive loading is very effective to deal with the frequency-selective fading which is inevitable in broadband wireless communications. However, almost all of the existing adaptive loading algorithms are based on "subcarrier-to-subcarrier" mode which may results in awfully large signaling overhead, since every subcarrier needs its own signaling loop between the transmitter and receiver. We investigate the performance of the combination of OFDM and adaptive antenna array when a subband adaptive loading algorithm is used to decrease the signaling overhead. It is shown by simulation results that at the cost of some tolerable performance loss, the signaling overhead of adaptive loading can be greatly reduced.

In this paper, we study a work-conserving multicast scheduling with fanout splitting in a switch, which routes incoming packets asynchronously without fragmentation into cells. A new switch architecture is proposed, which distributes the input links to P variable length packet switching fabrics (VPS) with every G input links sharing GR inlets of the VPS. The system performance is analyzed by queueing analysis to express the maximum throughput and packet delay in terms of the system parameters and traffic characteristics. A practical switch design is also proposed to realize almost the same scheduling as the work-conserving one. We have surveyed how the fanout distribution affects the performance of the switch through Fanout Function, which is defined and studied to help the design of a multicast switch. We show how Fanout Function determines the maximum throughput and packet delay. Various fanout distributions are compared. The mixed fanout distribution exhibits better performance while the deterministic fanout can be used as a bound in the design of a multicast switch. We optimize R and P to attain 100% maximum throughput under limited switch complexity. When the mean fanout size is large, we can use less hardware to achieve the optimal performance by using our architecture. The proposed realization of this switch can be implemented easily due to its modular design. It is scalable because distributed output contention resolution and routing are used instead of a central arbitrator. Its performance is verified by simulation. The result matches the theoretical work-conserving scheduling very well.

We propose a robust edge detection method based on independent component analysis (ICA). It is known that most of the basis functions extracted from natural images by ICA are sparse and similar to localized and oriented receptive fields, and in the proposed edge detection method, a target image is first transformed by ICA basis functions and then the edges are detected or reconstructed with sparse components only. Furthermore, by applying a shrinkage algorithm to filter out the components of noise in the ICA domain, we can readily obtain the sparse components of the original image, resulting in a kind of robust edge detection even for a noisy image with a very low SN ratio. The efficiency of the proposed method is demonstrated by experiments with some natural images.

An image NRD guide-fed dielectric rod antenna, which is suitable for use at millimeter-wave frequencies, is presented in this paper. The antenna is composed of a linearly tapered dielectric rod connected to the image NRD guide. First, radiation characteristics of the dielectric rod antenna directly protruded from the end of the image NRD guide are investigated by FDTD analysis and measurements at 30 GHz band. For this case, the degradation of the radiation pattern and the decrease of the gain, which are due to the strong radiation from the guide-to-antenna discontinuity, are observed. In order to minimize this radiation and to realize reasonable radiation characteristics, a transition from the image NRD guide-to-rod antenna is proposed. A simple procedure to determine the optimum dimensions of the transition is described. This procedure is based on parametric study of the transition's dimensions, and is performed using FDTD analysis. Based on the results, the dielectric rod antenna having a length of 10 λ0 is designed, and its performance is analyzed and measured. The results show that radiation patterns with the half power beamwidth of 22, sidelobe level of -21 dB and reasonable gain of 18.5 dBi can be realized by employing the transition having the optimum dimensions.

A novel method is presented to the symbolic computation of Noise Figure (NF) of transistor circuits. Several computationally efficient macromodels of BJTs and MOSFETs by using nullors, are introduced. To demonstrate the suitability of the proposed method, the fully-symbolic expression of NF of a CMOS current-mirror is computed, and the total output noise-voltage is compared with HSPICE simulations. The calculated NF and the simulated noise are in good agreement. Finally, the method is extended to compute NF of a CMOS translinear circuit biased in weak inversion.

In this paper, we propose a naïve probabilistic shift-reduce parsing model which can use contextual information more flexibly than the previous probabilistic GLR parsing models, and utilize the characteristics of agglutinative language in which the functional words are highly developed. Experimental results on Korean have shown that our model using the proposed contextual information improves the parsing accuracy more effectively than the previous models. Moreover, it is compact in model size, and is robust with a small training set.

An output load VSWR (voltage standing wave ratio) protection circuit for SiGe power amplifiers (PA) is presented by using the relatively low collector-emitter avalanche breakdown characteristic of SiGe HBT. Unlike the conventional diode-type switch, the new protection circuit completely eliminates the undesirable dc leakage current during the normal operation of the PA. Simulations and measurements show the proposed protection circuit enhances the ruggedness of the PA at harsh operating condition while it imposes only minor performance degradation at normal operating condition.

In this paper, we propose a new fragile watermarking scheme that can be used to verify three-dimensional (3-D) polygonal models by detecting unauthorized alterations. In order to generate a binary watermark sequence, we combine a binary random sequence generated by the user key with a binary logo sequence using the bit-wise exclusive OR operation. The binary watermark sequence is embedded into 3-D triangle strips by perturbing their vertex coordinates. The proposed watermarking scheme can identify specific locations that have been changed. Changes of the vertex coordinates in the watermarked 3-D model are reflected in the extracted watermark image, which indicates the attacked area. Experimental results demonstrate that we can detect various modifications of the watermarked 3-D model: translation, rotation, scaling, randomization of points, polygon simplification, geometry compression, and local deformation.

This paper presents a simplified maximum likelihood detection (MLD) scheme for multiple-input and multiple-output spatial division multiplexing (MIMO-SDM) systems. In the scheme, ordered successive detection (OSD) is applied to multiple symbol candidates retained in the preceding stage to limit the number of symbol vector candidates. Accordingly, the subsequent MLD searches for the most likely signal vector among the limited symbol-vector candidates. Simulation results demonstrated that the proposed scheme provides the bit error rate performance close to that achieved by MLD while reducing the computational complexity.

This paper proposes the joint beamforming space-time block coding (JBSTBC) scheme for multi-input multi-output (MIMO) communication systems. To enhance the order of spatial diversity in presence of deteriorate fading correlations as well as inter-substream interferences, the proposed JBSTBC method employs joint eigen-beamforming technique together with the block-ordered layered detector (BOLD) for MIMO-STBC. In order to confirm the superiority of the proposed JBSTBC method, computer simulations are conducted in highly correlated fading situations while providing detailed mathematical derivations for clarifying functionality of the proposed scheme.

We propose a new end-to-end transport protocol called Multi-path Transmission Control Protocol (M/TCP) and its two robust acknowledgement (ACK) schemes. Our protocol is designed as an alternative TCP option to improve reliability and performance of the Internet. The M/TCP sender simultaneously transmits data via multiple controlled paths to the receiver. Our protocol requires no modification in IP layer. Two M/TCP endpoints establish multiple paths between them by subscribing to multiple ISPs. The two robust ACK schemes proposed in this paper aim at improving M/TCP performance over the Internet with high packet loss in ACK channels. Performances between our protocol and TCP Reno are compared in terms of throughput and fairness by using ns2 simulator. Simulation results indicate that M/TCP achieves higher throughput than TCP Reno in situation of random drop and burst traffic with small buffer size. When there is network congestion on reverse path, M/TCP with the proposed robust ACK schemes performs better than M/TCP with the conventional immediate ACK scheme.

In this paper, we propose a method for constructing quasi-cyclic low-density parity-check codes randomly using cyclic shift submatrices on the basis of the girth of the Tanner graphs of these codes. We consider (3, K)-regular codes and first derive the necessary and sufficient conditions for weight-4 and weight-6 codewords to exist. On the basis of these conditions, it is possible to estimate the probability that a random method will generate a (3, K)-regular code with a minimum distance less than or equal to 6, and the proposed method is shown to offer a lower probability than does conventional random construction. Simulation results also show that it is capable of generating good codes both regular and irregular.

In a severe frequency-selective fading channel, the bit error rate (BER) performance of orthogonal multicode DS-CDMA is severely degraded since the orthogonality property of spreading codes is partially lost. The frequency-selectivity of a fading channel can be exploited by using frequency-domain equalization to improve the BER performance. Further performance improvement can be obtained by using transmit diversity. In this paper, joint transmit diversity and frequency-domain equalization is presented for the reception of orthogonal multicode DS-CDMA signals in a frequency-selective fading channel. As for transmit diversity, delay transmit diversity (DTD) and frequency-domain space-time transmit diversity (STTD) are considered. The achievable BER performance of multicode DS-CDMA in a frequency-selective Rayleigh fading channel is evaluated by computer simulation. It is shown that the frequency-domain STTD significantly improves the BER performance irrespective of the degree of the channel frequency-selectivity while DTD is useful only for a weak frequency-selective channel.

From the bifurcation viewpoint, this study examines a boost PFC converter with average-current-mode control. The boost PFC converter is considered to be a nonlinear circuit because of its use of a multiplier and its large duty cycle variation for input current control. However, most previous studies have implemented linear analysis, which ignores the effects of nonlinearity. Therefore, those studies were unable to detect instability phenomena. Nonlinearity produces bifurcations and chaos when circuit parameters change. The classical PFC design is based on a stable periodic orbit that has desired characteristics. This paper describes the main bifurcations that this orbit may undergo when the parameters of the circuit change. In addition, the instability regions in the PFC converter are delimited. That fact is of practical interest for the design process. Moreover, a prototype PFC circuit is introduced to examine these instability phenomena experimentally. Then, a special numerical program is developed. Bifurcation maps are provided based on this numerical study. They give a comprehensive outstanding for stability conditions and identify stable regions in the parameter space. Moreover, these maps indicate PFC converter dynamics, power factors, and regulation. Finally, numerical analyses and experimentation show good agreement.

In this paper, we propose a new method which makes transient simulation faster for the circuit including both nonlinear and linear elements. First, the method for generating the projection matrix with Krylov-subspace technique is described. The order of the circuit equation is reduced by congruence transformation with the projection matrix. Next, we suggest a method which can calculate the reduced Jacobian matrix directly in each Newton-Raphson iteration. Since this technique does not need to calculate the original size of Jacobian matrix, the calculation cost is reduced drastically. Therefore, efficient circuit simulation can be achieved. Finally, our method is applied to some example circuits and the validity of the nonlinear circuit reduction technique is verified.