This paper investigates the optimum adaptive antenna array beam forming (AAA-BF) configuration considering the diversity effect provided by transmit diversity (TD) in a multipath fading channel in the W-CDMA forward link. Computer simulation results show that the required transmit signal energy per bit-to-background noise power spectrum density ratio (Eb/N0) at the average block error rate (BLER) of 10-2 using AAA-BF coupled with TD is decreased by approximately 1.0 dB compared to that of AAA-BF assuming the identical number of total antennas when the capacity, i.e., the number of simultaneously accommodated users with the transmission power proportional to the symbol rate, normalized by processing gain, Pg, is below approximately 20%. However, we find that in an interference-limited channel, when the capacity normalized by Pg is above approximately 30%, AAA-BF employing all antennas accommodates a larger capacity compared to AAA-BF coupled with TD because of a sufficient interference suppression effect due to a much narrower beam width despite the absence of the antenna diversity effect. This paper also elucidates in a multi-cell model that AAA-BF employing all antennas can accommodate approximately 1.5 times more users with the average BLER of 10-2 and with the outage probability of 5%, compared to the case with AAA-BF coupled with TD, when the total number of antennas is 8.

In an orthogonal frequency division multiplexing (OFDM) system, the bit error performance is degraded in the presence of multiple propagation paths whose excess delays are longer than the Guard Interval (GI), because the orthogonality between subcarriers cannot be maintained. Therefore, the GI has to be long enough for an expected delay spread of the channel. On the other hand, a long GI causes a decrease in transmission efficiency. In this paper, we propose a new OFDM demodulation method with a variable effective symbol duration, in order to improve the bit error performance in the presence of multipaths whose excess delays are longer than the GI. The proposed method can realize more stable radio communication systems under a multipath propagation environment even if a propagation path whose excess delay is longer than the GI exists. In other words, the proposed method can improve transmission efficiency without performance degradation by a shortened GI under the same environment. The principle of the proposed method is explained, and the bit error probability of the proposed method is analyzed theoretically in an AWGN channel and a multipath fading channel. The performance of the proposed method is then evaluated by computer simulation. The results show that the proposed method improves the system availability under more various multipath fading environments without changing the system parameters.

A new blocking artifact reduction algorithm is proposed that uses block classification and feedforward neural network filters in the spatial domain. At first, the existence of blocking artifact is determined using statistical characteristics of neighborhood block, which is then used to classify the block boundaries into one of four classes. Thereafter, adaptive inter-block filtering is only performed in two classes of block boundaries that include blocking artifact. That is, in smooth regions with blocking artifact, a two-layer feedforward neural network filters trained by an error back-propagation algorithm is used, while in complex regions with blocking artifact, a linear interpolation method is used to preserve the image details. Experimental results show that the proposed algorithm produces better results than the conventional algorithms.

For checkpointing to be practical, it has to introduce low overhead for the targeted application. As a means of reducing the overhead of checkpointing, this paper proposes a probabilistic checkpointing method, which uses block encoding to detect the modified memory area between two consecutive checkpoints. Since the proposed technique uses block encoding to detect the modified area, the possibility of aliasing exists in encoded words. However, this paper shows that the aliasing probability is near zero when an 8-byte encoded word is used. The performance of the proposed technique is analyzed and measured by using experiments. An analytic model which predicts the checkpointing overhead is first constructed. By using this model, the block size that produces the best performance for a given target program is estimated. In most cases, medium block sizes, i.e., 128 or 256 bytes, show the best performance. The proposed technique has also been implemented on Unix based systems, and its performance has been measured in real environments. According to the experimental results, the proposed technique reduces the overhead by 11.7% in the best case and increases the overhead by 0.5% in the worst case in comparison with page-based incremental checkpointing.

The threshold voltage of Coulomb staircase using organic molecules was analyzed by extending our previous model with only consideration of the metal/organic film interfacial space charge to the generalized one. The generalized model is helpful to examine coupling capacitance in organic double barrier tunneling junction (DBTJ). The current-voltage (I-V) characteristic of metal/polyimide (PI)/rhodamine-dendrimer (Rh-G2)/PI/metal junction was analyzed using this generalized model. The calculation results were in good agreement with our experimental data.

Metal nanostructure of organic/metal interface showing photocurrent multiplication phenomenon more than 105-fold was investigated. Au films deposited on organic films were revealed to be a gathering of nanoparticles and the multiplication rate can be tuned by the particle size. Spatial gaps formed between Au sphere and organic surface, which provide the hole accumulation sites (structural trap), was concluded to be indispensable for the photocurrent multiplication.

This paper proposes a new blocking artifact reduction algorithm using an adaptive filter based on classifying the block boundary area. Generally, block-based coding, such as JPEG and MPEG, introduces blocking and ringing artifacts to an image, where the blocking artifact consists of grid noise, staircase noise, and corner outliers. In the proposed method, staircase noise and corner outliers are reduced by a 1D low-pass filter. Next, the block boundaries are divided into two classes based on the gradient of the pixel intensity in the boundary region. For each class, an adaptive filter is applied so that the grid noise is reduced in the block boundary regions. Thereafter, for those blocks with an edge component, the ringing artifact is removed by applying an adaptive filter around the edge. Finally, high frequency components are added to those block boundaries where the natural characteristics have been lost due to the adaptive filter. The computer simulation results confirmed a better performance by the proposed method in both the subjective and objective image qualities.

The surface potential built across vacuum deposited phthalocyanine (Pc) films on aluminum electrode was investigated by means of electro-modulation spectroscopy. The sandwich-type cells with thin air gap, which becomes a good insulator were used in order to avoid the influence of charge injection. The existence of the surface potential at the metal/organic-material interface induced 1f referenced electro-reflectance (ER) signals. As a result, the surface potential built across vacuum deposited Pc films on aluminum electrode was estimated to be 1.25 V.

This paper presents a refined model for the fuzzy logic implementation of an available bit rate (ABR) flow control switch. This refined model is named fuzzy explicit rate (FUER) switch mechanism. FUER switch mechanism is designed to effectively perform congestion control on ABR traffic in asynchronous transfer mode (ATM) networks. The performance of FUER scheme is evaluated against those of two other explicit rate (ER)-based switch mechanisms using simulation in particular local area network (LAN) and wide area network (WAN) environments. On the whole, FUER scheme performs better than the other schemes. Although it has the smallest control parameter set, it is a more efficient and scalable ER-based switch mechanism.

Self-ordered mesoporous silicate films from organic-inorganic compound materials are successfully fabricated into the surface photo voltage (SPV) type gas sensor device as a gas adsorption insulator layer. These kinds of gas sensors device exhibit NO gas sensing property dependent on their mesoporous film structure. We are succeeded in indication about a possibility of mesoporous silicate film for the SPV type gas sensor application.

This paper proposes a power control algorithm with fast convergence suited for wideband code division multiple access (WCDMA). Conventional algorithms are developed with continuous mode power control not binary mode power control. The new power control algorithm is suggested to support the binary mode power control and to offer the optimal relaxation factor for fast convergence.

An n-dimensional crossed cube, CQn, is a variation of the hypercube. In this paper, we prove that CQn is (n-2)-Hamiltonian and (n-3)-Hamiltonian connected. That is, a ring of length 2n-fv can be embedded in a faulty CQn with fv faulty nodes and fe faulty edges, where fv+fen-2 and n3. In other words, we show that the faulty CQn is still Hamiltonian with n-2 faults. In addition, we also prove that there exists a Hamiltonian path between any pair of vertices in a faulty CQn with n-3 faults. The above results are optimum in the sense that the fault-tolerant Hamiltonicity (fault-tolerant Hamiltonian connectivity respectively) of CQn is at most n-2 (n-3 respectively). A recent result has shown that a ring of length 2n-2fv can be embedded in a faulty hypercube, if fv+fen-1 and n4, with a few additional constraints. Our results, in comparison to the hypercube, show that longer rings can be embedded in CQn without additional constraints.

We developed a novel model for degradation of remanent polarization resulting from repeated polarization reversal cycling. The characteristics of ferroelectric capacitors have been simulated with the double saturation function model that required only five parameters; Ec, Qrmax, Qdmax, Kr and Kd. This novel model combines an equivalent gap capacitor with the double saturation function model. The model predicts hysteresis loops under endurance conditions. The simulated results are well in agreement with the results obtained in the experiment. The model is utilized to quantify the degradation effect of remanent polarization on ferroelectric memory applications.

The optical recording on an azopolymer surface by the optical fiber probe with a 100 nm diameter aperture was demonstrated. The 150 nm diameter pit was formed by the optical fiber probe coupled with a 50 ns pulse of 10 mW and 488 nm wavelength coherent light.

We present a simple solution to secretly sharing a factoring witness (for given N) in a publicly-verifiable manner. Compared to the previous PVSS schemes to secretly sharing a factoring witness, the scheme enjoys the following properties: (1) the formal proofs of security can be given; (2) it is designed to be conceptually simpler; (3) it needs fewer communicated bits and, if not-so low exponent RSA (e.g., e > 219+1) is used in the previous schemes, fewer computations; (4) no general multi-party computation is required in the preparation phase.

We have proposed the high-density triangular parallel wire channel MOSFET on an SOI substrate and demonstrated the suppressed short channel effects by simulation and experiment. In this device structure, the fabrication process is fully compatible with the planar MOSFET process and is much less complicated than other non-planer device structures including gate-all-around (GAA) and double-gate SOI MOSFETs. In addition, our fabrication process makes it possible to double the wire density resulting in the higher current drive. The three-dimensional simulation results show that the proposed triangular wire channel MOSFET has better short channel characteristics than single-gate and double-gate SOI MOSFETs. The fabricated triangular parallel wire channel MOSFETs show better subthreshold characteristics and less drain induced barrier lowering (DIBL) than the single-gate SOI MOSFETs.

In interconnection networks, deadlock recovery has been studied in routing strategy. The routing strategy for the deadlock recovery is intended to optimize the routing performance when deadlocks do not occur. On the other hand, it is important to improve the routing performance by handling deadlocks if they occur. In this paper, a routing strategy for suspensive deadlock recovery called an escape-restoration routing is proposed and its performance is evaluated. In the principle of the proposed techniques, a small amount of exclusive buffer (escape-buffer) at each router is prepared for handling one of deadlocked packets. The transmission of the packet is suspended by temporarily escaping it to the escape-buffer. After the other deadlocked packets were sent, the suspended transmission resumes by restoring the escaped packet. Evaluation results show that the proposed techniques can improve the routing performance more than that of the previous recovery-based techniques in handling deadlocks.

With increasing Internet traffic congestion, the provision of reliable transmission and packet loss recovery continues to be of substantial importance. In this paper, we analyze a new recovery method using punctured convolutional codes, demonstrating the simplicity and efficiency of the proposed method for the recovery of lost packets. The analysis provides a method for determining the recoverability and the post-reconstruction receiving rate for a given convolutional code. The exact expressions for calculating the recovery rate are derived for a number of convolutional codes and the (2, 1, m) punctured convolutional code. Where packet loss probabilities are in the range typically found in Internet transmissions, the convolutional code-based method delivers superior performance over the traditional parity method with the same redundancy.

We consider diagnosability of butterfly networks under the comparison approach proposed by Maeng and Malek. Sengupta and Dahbura discussed characterization of diagnosable systems under the comparison approach, and designed a polynomial time algorithm to identify the faulty processors. However, for a general system, it is not algorithmically easy to determine its diagnosability. This paper proposes two comparison schemes for generating syndromes on butterfly networks, and determine the diagnosability of the network.

Since the invention of the RSA scheme, a lot of public-key encryption and signature schemes based on the intractability of integer factoring have been proposed. Most employ integers of the form N = p q, such as the RSA scheme, but some employ integers of the form N = pr q. It has been reported that RSA decryption speed can be greatly improved by using N = pr q integers for large r. On the other hand, Boneh et al. proposed a novel integer factoring method for integers such as N = pr q for large r. This factoring algorithm, the so-called Lattice Factoring Method, is based on the LLL-algorithm. This paper proposes a new method for factoring integers of the form N = pr q for large r and gives a new characterization of r such that factoring integers N = pr q is easier. More precisely, the proposed method strongly depends on the size and smoothness of the exponent, r. The theoretical consideration of and implementation of our method presented in this paper show that if r satisfies a certain condition our method is faster than both Elliptic Curve Method and Lattice Factoring Method. In particular, the theoretical consideration in this paper mainly employs the techniques described in the excellent paper by Adleman, Pomerance and Rumely that addresses primality testing.