This paper considers systems consisting of communicating processes which can move between specified locations. Mobile telephone systems and intelligent transport systems are examples of them. The processes can exchange data as well as channels (e.g. frequencies) to be used in further communication. It may happen that two processes (e.g. telephones or cars) in different locations could communicate directly because they share a communication channel, but they cannot as there is a physical obstacle between the locations. A possible solution is to allow one process to send a message to another one through other processes and locations. To see if this is possible, a notion of connectivity of processes has been devised in the literature. A process was defined to be connectable to another one if a message from the first one could reach the other one by using any existing communication actions, allowed locations, and process moves in the system. A process-algebraic approach for checking connectivity was proposed. In this paper, it is shown how the temporal logic of actions (TLA) can be employed for the same purpose. In both approaches, connectivity of a process with another one is basically checked as follows. The first process includes a marking message in all its sending actions. Every process that receives this message gets marked and includes it in its own sending actions. The first process is connectable to the second one if there exists such a system execution sequence that the latter gets marked in it. Since TLA is a linear-time temporal logic, it can generally not express such a property. This paper, however, shows that it can be expressed and verified for a given TLA system specification. It also shows how to specify the marking operations and provides an example of connectivity checking.

This paper discusses the on-line frequency identification problem for a measured sinusoidal signal by using the adaptive method and filter theory. The proposed method is based on an identity between the sinusoidal signal and its second order derivative. For a set of chosen parameters, the proposed method is robust to the initial phase, the amplitude, and the frequency in a wide range. The convergence rate can be adjusted by the chosen parameters. The estimation error mainly depends on the frequency of the sinusoid, the measurement noise and a key design parameter.

In this paper, we compare two signal designs for uplink quasi-synchronous code division multiple access (CDMA) channels in order to optimize the trade-off between bandwidth efficiency and power efficiency. The design we call band-limited DS/CDMA design, is based on the time-domain assignment of Gold sequences, just as in the ordinary DS/CDMA, but with band-constrained cyclic chip interpolation functions, which is unlike the ordinary DS/CDMA. The other design, MC/CDMA design, is based on frequency-domain assignment of the sequences, as in the ordinary MC/CDMA. In both designs, we assume insertion of guard intervals at the transmitter and frequency-domain processing in reception. Assuming quasi-synchronous arrival of CDMA signals at the CDMA base station and FFT in the effective symbol interval, the intersymbol interference is evaded in both designs. First we identified the signal parameters that optimize bandwidth efficiency in each of the band-limited DS design and MC design. Second, we clarified the signal parameters that optimize the power efficiency as functions of frequency efficiency in each of the two designs. Finally, we derived and compared the trade-off between the bandwidth efficiency and power efficiency of band-limited DS and MC designs. We found a superiority of band-limited DS design over MC design with respect to the optimized trade-off.

This letter proposed a linear precoding scheme for the V-BLAST system that requires only knowledge of the statistical CSI; the transmitter does not need the instantaneous CSI. Power allocation on the eigenmodes of the transmit correlation matrix is one way to minimize bit error rate (BER). Simulation results show that the proposed precoding V-BLAST system provides a significant reduction in the BER compared with the conventional V-BLAST systems.

In this paper, we propose a high speed Preamble Searcher suitable for the RACH (Random Access Channel) structure in WCDMA reverse link receivers. Unlike IS-95, WCDMA system uses the AISMA (Acquisition Indication Sense Multiple Access) scheme. Because of the time limit between RACH preamble transmission and AI (Acquisition Indicators), and the restriction on the number of RACH signatures assigned to RACH preamble, fast acquisition is required for efficient operation. The Preamble Searcher proposed in this paper is designed for 2-antenna systems; it adopts the FHT (Fast Hadamard Transform) algorithm that has the radix-2 16 point FFT (Fast Fourier Transform) structure. The acquisition speed using FHT is 32 times faster than the conventional method that correlates each signature. Based on this fast acquisition scheme, we improved the acquisition performance by calculating correlation up to 4096 chips of the total preamble length.

This paper presents a methodology based on congruent transformation for distributed interconnects described by state-space time-delays system. The proposed approach is to obtain the passive reduced order of linear time-delays system. The unified formulations are used to satisfy the passive preservation. The details of the mathematical proof and a couple of validation examples are given in this paper.

This paper presents a design method to minimize energy of both functional units (FUs) and an interconnection network between FUs. To reduce complexity of the interconnection network, data transfers between FUs are classified according to FU types of operations in a data flow graph. The basic idea behind reducing the complexity of the interconnection network is that the interconnection resource can be shared among data transfers with the same FU type of a source node and the same FU type of a destination node. Moreover, an efficient method based on a genetic algorithm is presented.

For mobile visual communications, the development of more robust and efficient video traffic control and transmission techniques remains one of the most important issues. Foveated video originates from visual entropy reduction by removing undetectable high visual frequencies that occur at a distance from the fixation point. In this paper, compression gain is defined and measured to quantify the enhanced performance when the visual throughput of the regions of interest (ROI) is increased over a capacity-limited channel.

In this paper, we propose a novel spatial filtering technique for orthogonal frequency division multiplexing (OFDM) signals called "VIrtual Subcarrier Assignment (VISA)." Here, virtual subcarrier is a subcarrier which is not used for data transmission. When a wireless terminal is equipped with multiple antennas, VISA can easily achieve a space division multiple access (SDMA) by assigning a different spectral position of virtual subcarrier to a different user. To realize VISA in an already-existing OFDM-based wireless local area network (WLAN), we discuss an antenna weight control method in the preamble of a signal burst format designed for the IEEE802.11a standard and evaluate the bit error rate (BER) performance in typical indoor wireless environments.

This paper presents a semi-blind algorithm for multiuser interference cancellation and fading amplitude estimation for downlink MIMO DS-CDMA systems with multipath fading channels. Taking advantage of the space-time information of the parametric multipath channel, the proposed algorithm first uses a space-time channel decoupler to suppress multiuser interference and then decomposes the channel into a set of parallel subchannels each containing the signal of the desired user on an individual multipath. Two criteria, the complementary orthogonal projection (COP) and the minimum variance distortionless response (MVDR), are employed by the space-time decoupler to achieve interference suppression and signal separation. The fading amplitudes can then be estimated from the eigen space of the output of the space-time channel decoupler. It follows that the signal of interest can be maximally combined in a pathwise manner and then differentially decoded.

In computer simulation of a large number of moving objects (MOs), how to enlarge Δt (the interval between the simulation time steps) without introducing causality errors is one of the primary keys to enhancing performance. Causality errors can be avoided by using the same Δt among related MOs when they are in the scene of detection (SoD). But in a large-scale MO simulation, MOs interact with one another in a complicated manner requiring a large calculation cost to predict the beginning time of SoD. In this paper we propose an event-aware dynamic time step synchronization method (DTSS) for distributed MO simulation, which increases Δt without introducing causality errors and speeds up the simulation. DTSS can be implemented with little calculation cost because: (1) DTSS does not calculate the beginning time of SoD exactly, but calculates the time for possible entry into SoD with a simple mechanisim, and (2) MO simulation consists of a "movement"-phase and a "detection"-phase in which the distance-calculation between MOs requires a heavy load, and DTSS utilizes the distance values to calculate Δt. In this paper, we also discuss a suitable HLA based time management mechanism to implement DTSS on a distributed computing environment. In the performance evaluation of DTSS, the calculation cost of DTSS is implemented by using the HLA suitable time management mechanism. The results show that DTSS can be executed within the ideal time plus its 1% over-cost when a basic scenario of war-game simulation is employed. Therefore if the ratio of SoD to the total simulation is small, the execution time is expected to decrease to nearly this ratio. We also introduce the criterion for determining when DTSS is superior to the conventional method by using the performance evaluation results. The results presented in this paper are effectively utilized when DTSS is applied to practical applications.

For broadband wireless networks based on OFDM (Orthogonal Frequency Division Multiplexing), an FRF (Frequency Reuse Factor) of 1 has been highly desirable for more improved channel throughput. However, due to the limited power budget of MSs (Mobile Stations) or the increase in ICI (Inter-Cell Interference), a required QoS (Quality of Service) may not be maintained. This paper addresses an optimal LCRTD (Loading Control based on Region-Time Division) over multi-cell environments for an efficient uplink QoS control. In the LCRTD scheme, a cell is divided into several regions by utilizing an optimization approach under QoS constraints, and users in each region are allowed to send their data at the allocated time slots. In the simulation, it is demonstrated that a decrease of 26% in the transmit power can be obtained.

Fundamental limitation on assisting a write margin (WRTM) by reducing the cell terminal bias (VDDM) has been made clear for the first time and the new cell terminal biasing scheme featuring a differential VDDM (Diff-VDDM) control has been proposed to address the issues which the conventional schemes proposed so far can not overcome [1]-[5]. Since Diff-VDDM biasing scheme can meet the both of the requirements simultaneously of 1) reducing drivability for the PMOS load transistor on the "Low" written bit-line (BL) side, and 2) increasing drivability for the other side PMOS for a write recovery, it can provide a lower minimum operating voltage (Vdd_min) for the write operation even if considering a sufficiently-large random threshold voltage (Vth) variations. The following points have been shown based on an actual 65 nm CMOS device variation data and the implemented layout data that 1) Vdd_min for the write operation can be lowered from Vdd=1.1 V down to 0.8 V when considering a 4-sigma (σ) variation, 2) the write recovery time can be reduced by 92% and 70% that for the conventional schemes [1],[2] at Vdd=0.7 V and 1.0 V, respectively, and 3) WRTM defined by the percentage (%) of the required (BL pull-down level/Vdd) to flip the cell nodes for the write operation can be relaxed by 2.6-fold and 1.4-fold that for the conventional schemes [1],[2] at Vdd=0.75 V and 1.0 V, respectively. As an actual implementation in a 65 nm CMOS, a 32-kbit single-port SRAM macro design and the measured butterfly curves have been demonstrated.

A novel pitch-synchronous auditory-based feature extraction method for robust automatic speech recognition (ASR) is proposed. A pitch-synchronous zero-crossing peak-amplitude (PS-ZCPA)-based feature extraction method was proposed previously and it showed improved performances except when modulation enhancement was integrated with Wiener filter (WF)-based noise reduction and auditory masking. However, since zero-crossing is not an auditory event, we propose a new pitch-synchronous peak-amplitude (PS-PA)-based method to render the feature extractor of ASR more auditory-like. We also examine the effects of WF-based noise reduction, modulation enhancement, and auditory masking in the proposed PS-PA method using the Aurora-2J database. The experimental results show superiority of the proposed method over the PS-ZCPA and other conventional methods. Furthermore, the problem due to the reconstruction of zero-crossings from a modulated envelope is eliminated. The experimental results also show the superiority of PS over PA in terms of the robustness of ASR, though PS and PA lead to significant improvement when applied together.

In this letter, a blind frequency offset estimation algorithm is proposed for OFDM systems. The proposed method exploits the intrinsic phase shift between neighboring samples in a single OFDM symbol, incurred by a frequency offset. The proposed algorithm minimizes a novel cost function, which is the squared error of the candidate frequency offset compensated signals from two different observation windows. Also, the solution of the proposed algorithm is given by an explicit equation, which does not require any iterative calculation. It is shown that the performance of the proposed method is better than those of the conventional methods, especially in the presence of multipath channels. This is due to the fact that the proposed method is insensitive to inter-symbol interference (ISI).

This paper outlines the method of constructing single-electron logic circuits based on the binary decision diagram (BDD), a graphical representation of digital functions. The circuit consists of many unit devices, BDD devices, cascaded to build the tree of a BDD graph. Each BDD device corresponds to a node of the BDD graph and operates as a two-way switch for the transport of a single electron. Any combinatorial logic can be implemented using BDD circuits. Several subsystems for a single-electron processor have been constructed using semiconductor nano-process technology.

Petri nets have recently become widely accepted as a description method for biological pathways by researchers in computer science as well as those in biology. This paper gives an overview of Petri net formalisms to describe biological pathways and discusses their use in modelings and simulations for the systematic understandings of biological pathways. After reviewing the use of various types of Petri nets for the biological pathway modelings, we showed the examples that analyze fundamental properties of biological pathways using T-invariant, P-invariant, siphon, and trap. Applications of hybrid Petri nets for producing new biological hypotheses through simulations are also illustrated.

In this paper, a novel cost effective interconnection network for two-way pipelined SIMD-based reconfigurable computing processor is proposed. Our reconfigurable computing engine is composed of the SIMD-based function units, flexible interconnection networks, and two-bank on-chip memories. In order to connect the function units, the reconfigurable network is proposed to connect all neighbors of each function unit. The proposed interconnection network is a kind of full and bidirectional connection with the data duplication to perform the data-parallelism applications efficiently. Moreover, it is a multistage network to accomplish the high flexibility and low hardware cost.

This paper presents a linear constrained minimum variance multiuser detection (MUD) scheme for DS-CDMA systems, which makes full use of the available spreading sequences of the users as well as the relevant channel information of the incoming rays in the construction of the constraint matrix. To further enhance the performance, a statistical optimum filter bank in combination with the developed minimum variance MUD with the partitioned linear interference canceller (PLIC) as the underlying structure is also addressed. The determination of the filter bank coefficients, however, calls for computationally demanding nonlinear programming. To alleviate the computational overhead, an iterative procedure is also proposed, which solves the Rayleigh quotient in each iteration. Furthermore, the expressions of the output signal to interference plus noise ratio (SINR) are also determined to provide further insights into the proposed approach. Conducted simulations validate the new scheme.

Cooperative diversity represents an effective way of combating multipath fading through inter-terminal cooperation in wireless networks. In this letter, we propose a new participation strategy that increases the chance of cooperation and present the closed-form expression for outage probability. Numerical results demonstrate that new participation strategy improves the outage performance.