A computational cost reduction scheme for a post-distortion type nonlinear distortion compensator of OFDM signals is proposed, and compared with the conventional sub-optimum detection scheme. The proposed scheme utilizes the principle that a complex OFDM signal can be demodulated with not only both I-phase (real part) and Q-phase (imaginary part) components, but also either of them. Usually each phase of an OFDM signal exhibits different signal envelope and they are distorted differently by the nonlinearity of a power amplifier. Consequently, three output sequence patterns can be obtained at the receiver. By comparing these outputs, we can know the erroneous positions of these sequences to some extent. By the aid of this comparison, we need to evaluate only a limited number of replicas for the compensation process of the post-distortion type nonlinear distortion compensator, which results in the computational cost reduction. We have proposed four new compensation schemes based on this idea and derived their performance in terms of the bit error rate and the average number of calculations.

Providing various assistances for design modifications on HDL source codes is important for design reuse and quick design cycle in VLSI CAD. Program slicing is a software-engineering technique for analyzing, abstracting, and transforming programs. We show algorithms for extracting/removing behaviors of specified signals in VHDL descriptions. We also describe a VHDL slicing system and show experimental results of efficiently extracting components from VHDL descriptions.

This paper presents a relationship between the near-field shielding effectiveness (SE) and the far-field SE of an infinite planar shield for dipole fields. The penetration fields through the shield and the near-field SE are deduced analytically from an explicit integral expression based on certain assumptions. They further give us approximate formulas for the near-field SE. The near-field SE depends on not only wavelength and material used, but also on the distance r from a source to an observation point through the shield, the source type (magnetic dipole or electric dipole) and the orientation (vertical or horizontal to the shield face) in general. The results we obtained are as follows. The near-field SE for magnetic dipole fields vertical to the shield face is the same as that horizontal to the shield face, and their absolute values equal that of the far-field SE multiplied by k0r/3 (k0 is the wave number). The near-field SE for electric dipole fields vertical to the shield face doubles that horizontal to the shield face, and the absolute value of the latter equals that of the far-fields SE divided by k0r. The validity of the assumptions used to obtain the approximate formulas are examined. The range of r (an application range), over which the difference between the approximate value and the true value is under 1 dB, is determined, where the former value is calculated by the approximate formula of the SE and the latter value is etsimated by direct integration of the related integral expression. For instance, an application range of the approximate formula for magnetic dipole fields vertical to the shield face is from larger one of 50δ and 33µrδ to 0. 11λ0, where µr is specific permeability, δ is skin depth of the shielding material used and λ0 is wavelength in the free space.

This paper presents a feature extraction model MAGNET' to find the deepest point of branched sulcus. Our model demonstrates magnetic principle and consists of four types of ideal magnetic poles: an N-pole and three S-poles. According to attractive or repulsive Coulomb forces between their poles, one of the S-poles is pushed to the deepest point of the sulcus. First, we explain our model on the simple sulcus model. Second, we apply it to the sulcus with implicit branches. Our model can detect the target points in every branch. Then an example to realize the model on a synthetic image is introduced. We apply our model to human brain MR images and human foot CT images. Experimental results on human brain MR images show that our method enable us to successfully detect the points.

Telecommunication technologies are making relentless progress. In this circumstance, network cost must be evaluated to assess the effectiveness of emerging technologies. To do such an evaluation efficiently, it is necessary to develop a software tool that can calculate the network cost independent of the employed technologies. This paper describes computational techniques used in developing such a software tool. First, the functional requirements are identified to establish a flexible tool that is applicable to a wide range of technologies. One of the required functions is the function that computes the resource amount and the network cost from the given conditions such as traffic demands, a cable duct network, multiplex hierarchy and the specifications of network elements employed. As this computing function, the paper proposes an appropriate path classification scheme that enables us to evaluate the resource amount correctly when a service protection technique is applied to the target network. Namely, the proposed scheme yields evaluations that isolate the primary path route from the backup path route. This isolation is not always provided without classification. In addition, a classification of network elements is also derived for valid estimation of the necessary interface board number, which is a basis of estimating the required network element amount. This classification allows us to identify the exact points of path cross-connection and termination, which affects the number of interface boards. This paper presents the computing procedures that realize path grouping and an estimation of network elements using these classification schemes. Finally, the paper describes a prototype of the tool to confirm the feasibility and effectiveness of the proposed schemes.

M-ary/SS systems are compared with DS/SS systems applied the multicarrier systems and the RAKE receiver in the presence of AWGN, frequency selective Rayleigh fading and partial-band interference. In particular, the BER performance and SSMA capability are evaluated. Consequently, the M-ary/SSMA system using the multicarrier techniques is subject to the M-ary/SSMA system with the RAKE receiver in the presence of partial-band interference. The BER performance of the M-ary/SSMA system is better than that of the DS/SSMA system when the number of users is smaller than 20. And the spectral efficiency of the multicarrier M-ary/SSMA system is best in the four systems when JSR=20 [dB] and BER=10-3.

Priority control and call admission control are indispensable traffic management methods to guarantee each QoS requirement of connections in ATM networks. The key technique of call admission control under priority control is to estimate required bandwidth of each connection to satisfy all QoSs of calls in progress. In this paper, we propose a novel approximation method to calculate the required bandwidth of ATM connections through priority queues and show a practical call admission control scheme using the proposed method. The essence of the approximation method is to model prioritized parallel queues as a series of queues in tandem with no priority control by focusing on the number of cells in queues. The tandem queue approximation method enables us to model each queue under priority control as a single non-priority FIFO queue in terms of its queue length. This results in that effective bandwidth techniques are applicable to priority queues. The effectiveness of the proposed scheme is evaluated by some numerical examples.

The fact that bounded interval band orthonormal scaling function shows oversampling property is demonstrated. The truncation error is estimated when scaling function with oversampling property is used to recover signals from their discrete samples.

In order to improve fairness and stability of TCP best-effort service we propose a new congestion control algorithm using packet loss information obtained from Selective Acknowledgments (SACK), and evaluate its effectiveness by simulation. The proposed scheme is for an environment consisting of Random Early Detection (RED) routers which drop each arriving packet with a certain probability after a threshold. The proposed mechanism adjusts the decrease in congestion window for Fast Recovery and the increase in congestion window per ACK during the congestion avoidance phase according to the number of lost packets. Simulation results show that not only the bandwidth allocation fairness is improved but also throughput deviation is markedly reduced resulting in more stable transport capability.

In this paper, we present a numerical design method for two-dimensional (2-D) FIR linear-phase (LP) quincunx filter banks (QFB) with equiripple magnitude response and perfect reconstruction (PR). The necessary conditions for the filter length of analysis filters are derived. A dual affine scaling variant (DASV) of Karmarkar's algorithm is employed to minimize the peak ripples of analysis filters and an approximation scheme is introduced to satisfy the PR constraint for the 2-D filter banks (FB). The simulation examples are included to show the effectiveness of this proposed design technique.

A generalized radial basis function network consisting of (1 + cosh x)-1 as the basis function of the same class as Gaussian functions is investigated in terms of the feasibility of analog-hardware implementation. A simple way of hardware-implementing (1 + cosh x)-1 is proposed to generate the exact input-output response curve on an analog circuit constructed with bipolar transistors. To demonstrate that networks consisting of the basis function proposed actually work, the networks are applied to numerical experiments of forecasting chaotic time series contaminated with observational random noise. Stochastic gradient descent is used as learning rule. The networks are capable of learning and making short-term forecasts about the dynamic behavior of the time series with comparable performance to Gaussian radial basis function networks.

In this paper, Orthogonal Multicode OFDM-DS/CDMA system using Partial Bandwidth Transmission is proposed. By using the flexible carrier allocation of OFDM, Partial Bandwidth Transmission is considered for high quality communication. Furthermore, multicode packet data transmission is presented. Multicode packet data transmission is very effective to handle variable data. Since the proposed system can detect the header information without complex control, it is also suitable for packet data transmission. The computer simulation results show that the BER performance of the proposed system with the ideal channel estimation is improved compared with the case of the conventional Orthogonal Multicode DS/CDMA system with ideal RAKE receivers. Moreover the proposed system with the channel estimation by MLS algorithm also shows the good BER performance. In packet data transmission, the delay and throughput performances are also improved in the proposed system.

One-way sensing simple multihead finite automata with bounds on the number of times of use of sensing function in accepting computations are studied. It is shown that the languages accepted by one-way sensing simple multihead finite automata with constant sensing function bound satisfy the semilinear property, and that for one-way sensing simple multihead finite automata, m+1 times of the use of sensing function are better than m.

In a multi-bandwidth CDMA system, the performance of a multiple order selection combining rake receiver is analyzed according to the spreading bandwidth of the system and the delay spread of a Rayleigh fading channel. The results for various channel environments indicate a tradeoff between total received signal energy and multipath fading immunity. Increasing the occupied bandwidth of the system (wide-bandwidth spreading) gives better performance for small delay spread environments, while gathering more energy (narrow-bandwidth spreading) gives better performance for large delay spread environments. It is also shown that the performance difference between low and high order selection combining grows larger as the spreading bandwidth is increased. It is noted that performance degrades by increasing the bandwidth above a certain point and the optimum spreading bandwidth for each channel environment decreases as the delay spread of the channel increases.

This letter reports on the condition for applying a feedback connection to a deterministic finite automata. First we define the partial delayed dependence condition for the feedback connection, and then consider problems related to the completeness problem of automata.

In this paper, a new overload control strategy is proposed for a call control processor (CCP) in the base station controller (BSC) and processor utilization is measured. The proposed overload control strategy can regulate the call attempts by adopting measured processor utilization. A function, specifically a linear interpolation function based on Inverse Transform theory is used to convert controlled predictive average load rate in a call rejection rate. Then a call admission rate is obtained from the call rejection rate. Simulation shows that the proposed algorithm yields better performance than the conventional algorithm does under the heavy transient overload status in terms of call admission rate.

A convenient signaling scheme, termed orthogonal on-off BPSK (O3BPSK), along with a simple one-shot linear decorrelating detector (LDD) has been proposed by Zheng and Barton as a technique for near-far resistant detection in the asynchronous DS/CDMA systems. The temporally adjacent bits from different users in the received signals are decoupled by using the on-off signaling, and the data rate is maintained with no increase in transmission rate by adopting an orthogonal structure. The system performance of this signaling scheme in terms of bit error rate (BER) has been analyzed over an AWGN channel by Zheng and Barton. In this paper, we further study the system performance over Nakagami-m fading channel. A closed form for the BER of such a scheme is successfully derived. Numerical results show that the O3BPSK signal scheme along with the LDD receiver still offers a good near-far resistant property over Nakagami-m channel.

An approximate scheme for decomposing and reconstructing a continuous-time signal as a linear combination of the B-splines is studied. It is an oversampling discrete-time implementation derived by substituting the multifold RRS functions for the B-splines. The RRS functions are multifold discrete convolution of the sampled rectangular functions. Analysis of the scheme yields conditions for the circuit parameters to assure stability and required precision. A design example is presented that makes the error less than 1% in the supremal norm by the oversampling ratio of 512. Its numerical simulation is also presented.

A method to improve the reflection efficiency of holographic polymer dispersed liquid crystal (HPDLC) is proposed and its effectiveness is confirmed. Controlling the alignment of liquid crystal (LC) in tiny droplets of HPDLC can increase the refractive-index difference between the LC droplet layer and the polymer layer, causing the peak reflectance and reflective spectral width to expand. We observed experimentally that 96% of the light components excluding the scattering loss can be diffracted in a transmission HPDLC device by ordering the LC. In a reflection HPDLC, we found that reflection could be improved by ordering through an applied shear force. Our findings should lead to an improvement in the quality of reflective display devices.

This paper describes a factorization-based algorithm that reconstructs 3D object structure as well as motion from a set of multiple uncalibrated perspective images. The factorization method introduced by Tomasi-Kanade is believed to be applicable under the assumption of linear approximations of imaging system. In this paper we describe that the method can be extended to the case of truly perspective images if projective depths are recovered. We established this fact by interpreting their purely mathematical theory in terms of the projective geometry of the imaging system and thereby, giving physical meanings to the parameters involved. We also provide a method to recover them using the fundamental matrices and epipoles estimated from pairs of images in the image set. Our method is applicable for general cases where the images are not taken by a single moving camera but by different cameras having individual camera parameters. The experimental results clearly demonstrates the feasibility of the proposed method.