For binary linear block codes, we introduce "multiple GMD decoding algorithm. " In this algorithm, GMD-like decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

The transmission S-parameter between two dipole-elements is a measure to evaluate sites for measuring complex antenna factors (CAF). In this paper, the S-parameter between two dipole-elements on a ground plane is measured using a network analyzer with its TRL (Thru-Reflect-Line) calibration. The S-parameter is also calculated by the method of moment (MoM) and compared to the measurement results. The comparison shows that the calculated S-parameter is usable as a reference value in the evaluation of CAF measurement sites. As an example of the evaluation and selection of measurement sites, the transmission S-parameter on a finite ground plane is calculated using the hybrid method combined the geometrical theory of diffraction (GTD) and MoM. As a result, a preferable antenna setting on the finite ground plane is recommended.

One of the basic GPS features is its inherent anti-jamming (AJ) characteristics based on great processing gain as a result of using direct sequence spread spectrum (DS-SS) technique. For calculated jamming threshold for GPS receivers operating with L1 C/A, L1 P(Y) and L2 P(Y) signals, jamming range has been analyzed with respect to the characteristic jamming signals and under various effective radiated power of jamming signals. The tests of C/A GPS receiver jamming resistance on different jamming strategies, during the tracking and acquisition phase have been performed. The influence of jamming strategy on jamming efficiency has been proved. At the same time AJ characteristics of GPS receiver have been checked.

An iterative decoder of turbo code over an inter-symbol interference channel is proposed. A component decoder realizes decoding and equalization simultaneously with the soft-output Viterbi algorithm (SOVA). A decoding algorithm and simulation results are shown.

We propose a variation of the Context Tree Weighting algorithm for tree source modified such that the growth of the context resembles Lempel-Ziv parsing. We analyze this algorithm, give a concise upper bound to the individual redundancy for any tree source, and prove the asymptotic optimality of the data compression rate for any stationary and ergodic source.

Nonlinear behavior of electromagnetic surface waves propagating along a tangentially magnetized ferrite slab is investigated. The nonlinear Schrodinger equation (NLSE) which describes the temporal evolution of the electromagnetic wave pulses has been derived directly from the Maxwell equations and the equation of precessional motion for the magnetization in the ferrite slab with the aid of the reductive perturbation method without magnetostatic approximation. Based on the formula derived, we have numerically evaluated the frequency-dependence of the nonlinear coefficient in the NLSE for both a magnetostatic surface wave mode and a dynamic mode. As a result, we have confirmed the possibility of the propagation of solitons in the waveguide.

Blind channel estimation algorithm which is applicable to the time-variant channel under frequency-selective fading is proposed. The condition on the blind channel identifiability using temporally and spatially oversampled data is shown. The proposed algorithm consists of two stages. At the first stage, the channel equalization matrix is estimated by taking account of the time-variant characteristics of the channel. At the second stage, the signals and the channel matrix are alternately estimated by using the finite alphabet property of the transmitted symbols. Periodical return from the second stage to the first makes the blind estimation algorithm feasible for the time-variant channel with fast fading. The simulation results confirm the fast convergence property and the effectiveness of the proposed algorithm in coping with the frequency-selective fading.

Wavelength Assignment Photonic Switching System (WAPS) provides a wavelength for an end-to-end communication. In this way the features of wavelength can be fully utilized by users. We will give an architectural proposal in which two types of connections over WAPS network are provided and are adaptively used according to service demand by customers. One is a connection established semi-permanently between edge routers and relay-routers and the other is a connection established on flow-by-flow basis between edge routers. We will compare with conventional router networks in terms of data-transfer time. Pre-processing time is a crucial issue in connection-oriented networks, and this is very much reduced thanks to the WAPS network structure.

This paper describes how to generate, analyze and design a novel current-mode filter model using tunable multiple-output operational transconductance amplifiers and grounded capacitors (MO-OTA-Cs) for synthesizing both transmission poles and zeros. Transfer functions of low-order, high-order, general type, and special type are realized based on the filter model. The theory focuses mainly on establishing a relationship between the cascaded MO-OTA-Cs and the multiple-loop feedback matrix, which makes the structural generation and design formulas. Adopting the theory allows us to systematically generate many interesting new configurations along with some known structures. All the filter architectures contain only grounded capacitors, which can absorb parasitic capacitances and require smaller chip areas than floating ones. The paper also presents numerical design examples and simulation results to confirm the theoretical analysis.

The interconnect analysis of on- and off-chips is very important in the design of high-speed signal processing, digital communication, and microwave electronic systems. When the interconnects are characterized by sampled data via electromagnetic analysis, the circuit-level simulation of the network requires rational approximation of the sampled data. Since the frequency band of the sampled data is more than 10 GHz, the rational function must fit into it at many frequency points. The rational function is approximated using the orthogonal least-squares method. With an increase in the number of the fitting data, the least-squares method suffers from a singularity problem. To avoid this, the sampled data are hierarchically approximated in this paper. Moreover, to reduce the computational cost of the circuit-level simulation, the parameter matrix of the interconnects is approximated by a rational matrix with one common denominator polynomial, and the selective orthogonalization procedure is presented.

This paper first examines the issues related to scheduling loop applications on a software distributed shared memory (DSM) system. Then, a dynamic scheduling scheme is developed based on the examined issues to enhance the performance of loop applications on DSM. Compared with previous works, the proposed scheme has several specialties. The first is that the workload of processors can be effectively balanced even when the computational capabilities of processors and the computational needs of threads are not identical. The second is it divides thread mapping into two phases, each with one consideration, i.e., load balance or communication cost, and adopts thread migration and exchange in the two phases, respectively. The third is the exploitation of data sharing among threads to reduce data-consistency communication, and the last is to attack the negative effect of the unnecessary inter-node sharing caused by thread re-mapping. The proposed scheme has been implemented on a page-based DSM system called Cohesion. Our experiments show that the proposed scheme is more effective to improve the performance of the test programs than related schemes.

Co-ferrite thin films have been fabricated on Corning glass substrates by a chelating sol-gel process. Structural and magnetic properties of the films have been studied as a function of annealing temperature using an X-ray diffraction (XRD) and a vibrating sample magnetometer. XRD results revealed that most of the Co-ferrite grains were randomly oriented. Rapid annealing (RA) and standard annealing (SA) processes were used for the variation of heat treatment and the characteristic comparison. Coercivity was changed with the thermal condition and the magnetization increased with the soaking time. With prolonged soaking time, however, the coercivity decreased due to the diffusion of cations from the glass substrate. RA in the preparation of Co-ferrite thin films was effective for preventing interdiffusion at interfaces and for forming a single phase in the case of reduced soaking time. A yttria stabilized zirconia (YSZ) buffer layer between the Co-ferrite layer and the substrate was effective for improving the magnetic properties of the films at higher temperatures. It was observed that Co-ferrite thin films were composed of grains typically 35 nm in size and their rms roughness was approximately 1.3 nm. The saturation magnetization of the thin films by subjected to rapid annealing at 900C for 150 seconds was 400 emu/cm3 and the coercivity of the films was approximately 3000 Oe.

In Optimistic Two-Phase Locking (O2PL), when a transaction requests a commit, the transaction can not be committed until all requested locks are obtained. By this reason, O2PL leads to unnecessary waits and operations even though it adopts an optimistic approach. This paper suggests an efficient optimistic cache consistency protocol that provides serializability of committed transactions. Our cache consistency scheme, called PCP (Preemptive Cache Protocol), decides whether to commit or abort without waiting when transactions request commits. In PCP, some transactions that read stale data items can not be aborted, because it adopts a re-ordering scheme to enhance the performance. In addition, for re-ordering, PCP stores only one version of each data item. This paper presents a simulation-based analysis on the performance of PCP with other protocols such as O2PL, Optimistic Concurrency Control and Caching Two-Phase Locking. The simulation experiments show that PCP performs as well as or better than other schemes with low overhead.

This paper concentrates on the model useful for analyzing the error performance of M-estimators of a single unknown signal parameter: that is the error intensity model. We develop the point process representation for the estimation error, the conditional distribution of the estimator, and the distribution of error candidate point process. Then the error intensity function is defined as the probability density of the estimate and the general form of the error intensity function is derived. We compute the explicit form of the intensity functions based on the local maxima model of the error generating point process. While the methods described in this paper are applicable to any estimation problem with continuous parameters, our main application will be time delay estimation. Specifically, we will consider the case where coherent impulsive interference is involved in addition to the Gaussian noise. Based on numerical simulation results, we compare each of the error intensity model in terms of the accuracy of both error probability and mean squared error (MSE) predictions, and the issue of extendibility to multiple parameter estimation is also discussed.

In this paper, as a practical application, we focus on the genetic algorithm (GA) for multi-head surface mounting machines which are used to populate printed circuit boards (PCBs). Although there have been numerous studies on the surface mounting machine, studies on the multi-head case are rare because of its complexity. The multi-head surface mounting machine can pick multiple components simultaneously in one pickup operation and this operation can reduce much portion of the assembly time. Hence we try to minimize the assembly time by maximizing the number of simultaneous pickups, resulting in reduction of PCB production cost. This research introduces a partial-link GA method for the single-head case. Then, we apply this method to the multi-head case by regarding a reel-group as one reel and a component-cluster as one component. The results of computer simulation show that our genetic algorithm is greatly superior to the heuristic algorithm that is currently used in industry.

Shared memory multiprocessors are frequently used as compute servers with multiple parallel programs executing at the same time. In such environments, an operating system switches the contexts of multiple processes. When the operating system switches contexts, in addition to the cost of saving the context of the process being swapped out and that of bringing in the context of the new process to be run, the cache performance of processors also can be affected. The blocked algorithm improves cache performance by increasing the locality of memory references. In a blocked program using this algorithm, program performance can be significantly affected by the reuse of a block loaded into a cache memory. If frequent context switching replaces the block before it is completely reused, the cache locality in a blocked program cannot be successfully exploited. To address this problem, we propose a preemption-safe policy to utilize the cache locality of blocked programs in a multiprogrammed system. The proposed policy delays context switching until a block is fully reused within a program, but also compensates for the monopolized processor time on processor scheduling mechanisms. Our simulation results show that in a situation where blocked programs are run on multiprogrammed shared-memory multiprocessors, the proposed policy improves the performance of these programs due to a decrease in cache misses. In such situations, it also has a beneficial impact on the overall system performance due to the enhanced processor utilization.

This paper investigates the modeling of non-linearity on the generation of the single trial evoked potential signal (s-EP) by means of using a mixed radial basis function neural network (M-RBFN). The more emphasis is put on the contribution of spontaneous EEG term to s-EP signal. The method is based on a nonlinear M-RBFN neural network model that is trained simultaneously with the different segments of EEG/EP data. Then, the output of the trained model (estimator) is a both fitted and reduced (optimized) nonlinear model and then provide a global representation of the passage dynamics between spontaneous brain activity and poststimulus periods. The performance of the proposed neural network method is evaluated using a realistic simulation and applied to a real EEG/EP measurement.

This paper describes a DLL (Delay Locked Loop) circuit with the mixed-mode phase tuning method. The circuit accomplishes unlimited phase shift and accurate phase alignment through the coarse and fine phase tuning technique. It is based on a dual delay locked loop structure. The main loop is for generating coarsely spaced clocks and the second loop is for fast and accurate phase tuning with digital and analog phase detection. Simulations show that this circuit has 360 degree phase shift capability and can resolve 10 ps phase error using 0.6 µm CMOS technology.

In this paper, the improvement technique for a nonlinear parallel interference cancellation (PIC) receiver for a DS-CDMA system is studied, which cancels only the estimated multiple access interference (MAI) from specific users at each receiver stage. This technique was introduced as a PIC receiver using null zone hard decision in the proceeding of IEEE MILCOM '94, but the numerical results has not been fully provided with varying decision threshold. In this paper, the performance of the PIC receiver using null zone hard decision is shown in a Rayleigh fading channel. Also, a new PIC receiver with an adaptive decision threshold is proposed. In the proposed new PIC receiver, the decision threshold for partial cancellation is adjusted according to the statistic of its matched filter (MF) outputs. The BER of the proposed PIC receiver is obtained by simulation and compared with those of the conventional PIC receiver and the PIC receiver using null zone hard decision in a Rayleigh fading channel. It is shown that the proposed PIC receiver achieves better performance than the conventional PIC receiver and the PIC receiver using null zone hard decision in a Rayleigh fading channel.

This paper presents a three-dimensional polarimetric detection result of targets buried in snowpack by synthetic aperture FM-CW radar system. Since the FM-CW radar is suitable for short range sensing and can be equipped with fully polarimetric capability, we further extended it to a polarimetric three-dimensional SAR system. A field experiment was carried out to image and detect targets in a natural snowpack of 280 cm deep. The polarimetric detection and identification schemes are the polarimetric filtering, three-component decomposition, and the power polarization anisotropy coefficient. These approaches to acquired data show the usefulness of three-dimensional polarimetric FM-CW SAR system.