This paper presents the performance of DSTBC when applied on the downlink transmission of WCDMA cellular systems in fast-varying time-dispersive channels. First, three DSTBC-WCDMA receiver architectures are proposed and they are: (1) the DSTBC Rake receiver for combined-code (D-Rake-C), (2) the DSTBC deterministic receiver for combined-code (D-Det-C), and (3) the DSTBC deterministic de-prefix receiver for combined-code (D-Det-DP-C). Detection can be divided into a correlator that combines descrambling and despreading, and a DSTBC decoder. The correlator is designed to perform signal separation of the multipath-multiuser signal via least-square (LS) estimation. To enable the correlator to perform signal separation at every block period, the long combined spreading and scrambling codes are divided into shorter codes. Then, the proposed receivers are theoretically analyzed in time-dispersive channels and multiple-user environment using the moment generating function (MGF) of fading distributions. For analyzing interference tolerance, the standard Gaussian approximation is employed. Finally, simulations are performed. Theoretical performance well matches simulated results. Among the three receivers, the D-Det-DP-C receiver has the best performance in time-dispersive channels with a maximum excess delay of 4 chips and a maximum Doppler frequency of 250 Hz. Results also show minimal performance degradation for fast fading channels with a maximum Doppler frequency of 1200 Hz. The best performance is obtained when the receiver has the information on the maximum excess delay and all users' spreading codes.

This paper presents a new multi-layered artificial immune system architecture using the ideas generated from the biological immune system for solving combinatorial optimization problems. The proposed methodology is composed of five layers. After expressing the problem as a suitable representation in the first layer, the search space and the features of the problem are estimated and extracted in the second and third layers, respectively. Through taking advantage of the minimized search space from estimation and the heuristic information from extraction, the antibodies (or solutions) are evolved in the fourth layer and finally the fittest antibody is exported. In order to demonstrate the efficiency of the proposed system, the graph planarization problem is tested. Simulation results based on several benchmark instances show that the proposed algorithm performs better than traditional algorithms.

This paper presents a wide tuning range VCO with an automatic frequency, gain, and two-step amplitude calibration loop for Digital TV (DTV) tuner applications. To cover the wide tuning range, the fully digital automatic frequency calibration (AFC) loop is used. In addition to the AFC loop, a two-step negative-Gm tuning loop is proposed to provide the optimum negative-Gm to the LC tank in a wide frequency range with a fine resolution. In the coarse negative-Gm tuning loop, the number of active negative-Gm cells is selected digitally based on the target frequency. In the fine negative-Gm tuning loop, the negative-Gm is tuned finely with the bias voltage of the VCO. Also, the digital VCO gain calibration scheme is proposed to compensate for the gain variation in a wide tuning range. The VCO tuning range is 2.6 GHz, from 1.7 GHz to 4.3 GHz, and the power consumption is 2 mA to 4 mA from a 1.8 V supply. The measured VCO phase noise is -120 dBc/Hz at 1 MHz offset.

In this paper, we propose a novel method for gathering sensing information by using an orthogonal narrowband signal for cooperative sensing in cognitive radio. It is desirable to improve the spectrum sensing performance by countering the locality effect of a wireless channel; cooperative sensing by using multiple inputs of sensing information from the surrounding sensing nodes has attracted attention. Cooperative sensing requires that sensing information be gathered at the master node for determining the existence of a primary signal. If the used information gathering method leads to redundancies, the total capacity of the secondary networks is not improved. In this paper, we propose a novel method for gathering sensing information that maps the sensing information to the orthogonal narrowband signal to achieve simultaneous sensing information gathering at the master node. In this method, the sensing information is mapped to an orthogonal subcarrier signal of an orthogonal frequency division multiplexing (OFDM) structure to reduce the frequency resource required for sensing information gathering. The orthogonal signals are transmitted simultaneously from multiple sensing nodes. This paper evaluates the performance of the proposed information gathering method and confirms its effectiveness.

This paper presents algorithms for searching text regions with specifying annotated information in tag-annotated text by using Region Algebra. The original algebra and its efficient algorithms are extended to handle both nested regions and crossed regions. The extensions are necessary for text search by using rich linguistic annotations. We first assign a depth number to every nested tag region to order these regions and write efficient algorithms using the depth number for the containment operations which can treat nested tag regions. Next, we introduce variables for attribute values of tags into the algebra to treat annotations in which attributes indicate another tag regions, and propose an efficient method of treating re-entrancy by incrementally determining values for variables. Our algorithms have been implemented in a text search engine for MEDLINE, which is a large textbase of abstracts in medical science. Experiments in tag-annotated MEDLINE abstracts demonstrate the effectiveness of specifying annotations and the efficiency of our algorithms. The system is made publicly accessible at http://www-tsujii.is.s.u-tokyo.ac.jp/medie/.

An inversion method of bridge height over water by polarimetric synthetic aperture radar (SAR) is developed. A geometric ray description to illustrate scattering mechanism of a bridge over water surface is identified by polarimetric image analysis. Using the mapping and projecting algorithm, a polarimetric SAR image of a bridge model is first simulated and shows that scattering from a bridge over water can be identified by three strip lines corresponding to single-, double-, and triple-order scattering, respectively. A set of polarimetric parameters based on the de-orientation theory is applied to analysis of three types scattering, and the thinning-clustering algorithm and Hough transform are then employed to locate the image positions of these strip lines. These lines are used to invert the bridge height. Fully polarimetric image data of airborne Pi-SAR at X-band are applied to inversion of the height and width of the Naruto Bridge in Japan. Based on the same principle, this approach is also applicable to spaceborne ALOSPALSAR single-polarization data of the Eastern Ocean Bridge in China. The results show good feasibility to realize the bridge height inversion.

Partial forwarding is a design method to place forwarding paths on a part of processor pipeline. Hardware cost of processor can be reduced without performance loss by partial forwarding. However, compiler with the instruction scheduler which considers partial forwarding structure of the target processor is required since conventional scheduling algorithm cannot make the most of partial forwarding structure. In this paper, we propose a heuristic instruction scheduling method for processors with partial forwarding structure. The proposed algorithm uses available distance to schedule instructions which are suitable for the target partial forwarding processor. Experimental results show that the proposed method generates near-optimal solutions in practical time and some of the optimized codes for partial forwarding processor run in the shortest time among the target processors. It also shows that the proposed method is superior to hazard detection unit.

Traditional algorithms for dynamic OFDMA resource allocation have relatively deterministic system capacity and user fairness. Thus, in this letter, an efficient scheme is proposed to flexibly adjust quality-of-service for users, which is achieved by appropriately setting minimum data-rate of each user.

Scalable video coding (SVC) was standardized as an extension of H.264/AVC by the JVT (Joint Video Team) in Nov. 2007. The biggest feature of SVC is multi-layered coding where two or more video sequences are compressed into a single bit-stream. This letter proposes a fast block mode decision algorithm in spatial enhancement layer of SVC. The proposed algorithm achieves early decision by limiting the number of candidate modes for block with certain characteristic called same motion vector block (SMVB). Our proposed method reduces the complexity, in terms of encoding time by up to 66.17%. Nevertheless, it shows negligible PSNR degradation by only up to 0.16 dB and increases the bit-rate by only up to 0.64%, respectively.

We investigate per-flow flit and packet worst-case delay bounds in on-chip wormhole networks. Such investigation is essential in order to provide guarantees under worst-case conditions in cost-constrained systems, as required by many hard real-time embedded applications. We first propose analysis models for flow control, link and buffer sharing. Based on these analysis models, we obtain an open-ended service analysis model capturing the combined effect of flow control, link and buffer sharing. With the service analysis model, we compute equivalent service curves for individual flows, and then derive their flit and packet delay bounds. Our experimental results verify that our analytical bounds are correct and tight.

We investigated the relationship between ambient illumination and psychological effect by applying a modified color harmony model. We verified the proposed model by analyzing correlation between psychological value and modified color harmony score. Experimental results showed the possibility to obtain the best color for illumination using this model.

This paper studies reflection and transmission of a TE plane wave from a two-dimensional random slab with statistically anisotropic fluctuation by means of the stochastic functional approach. By starting with a representation of the random wavefield presented in the previous paper [IEICE Trans. Electron., vol.E92-C, no.1, pp.77-84, Jan. 2009], a solution algorithm of the multiple renormalized mass operator is newly shown even for anisotropic fluctuation. The multiple renormalized mass operator, the first-order incoherent scattering cross section and the optical theorem are numerically calculated and illustrated in figures. The relation between statistical properties and anisotropic fluctuation is discussed.

In this paper, a new handover procedure for OFDM-based multi-hop relay systems is proposed to reduce handover overhead by distinguishing an inter-cell handover event from an intra-cell handover event at the level of the physical layer using a preamble with a hierarchical design. A Subcell ID concept used to identify relay station in a cell is proposed in the hierarchical design that works in conjunction with the existing Cell ID used to identify base station. The proposed handover procedure can simplify the scanning procedure and skip/simplify the network re-entry procedure, resulting in a significant reduction in handover overhead.

In 3D IC design, thermal issue is a critical challenge. To eliminate hotspots, physical layouts are always adjusted by some incremental changes, such as shifting or duplicating hot blocks. In this paper, we distinguish the thermal-aware incremental changes in three different categories: migrating computation, growing unit and moving hotspot blocks. However, these modifications may degrade the packing area as well as interconnect distribution greatly. In this paper, mixed integer linear programming (MILP) models are devised according to these different incremental changes so that multiple objectives can be optimized simultaneously. Furthermore, to avoid random incremental modification, which may be inefficient and need long runtime to converge, here potential gain is modeled for each candidate incremental change. Based on the potential gain, a novel thermal optimization flow to intelligently choose the best incremental operation is presented. Experimental results show that migrating computation, growing unit and moving hotspot can reduce max on-chip temperature by 7%, 13% and 15% respectively on MCNC/GSRC benchmarks. Still, experimental results also show that the thermal optimization flow can reduce max on-chip temperature by 14% to the initial packings generated by an existing 3D floorplanning tool CBA, and achieve better area and total wirelength improvement than individual operations do. The results with the initial packings from CBA_T (Thermal-aware CBA floorplanner) show that 13.5% temperature reduction can be obtained by our incremental optimization flow.

A novel structure for a composite right/left-handed (CRLH) corrugated waveguide in the millimeter-wave band is proposed. The CRLH waveguide is composed of a rectangular waveguide with tilted corrugations on its bottom broad wall. By operating above and below the cutoff frequency of the dominant mode of the rectangular waveguide, the CRLH waveguide provides, respectively, an inherent series inductance and shunt capacitance, and an inherent shunt inductance. Moreover, the tilted corrugations provide a series inductance and a series capacitance, which can support CRLH propagation. A frequency-scanning antenna using this CRLH waveguide is also studied numerically and experimentally. The results demonstrate that the antenna can provide backward-to-forward beam scanning, including the broadside direction. A scanning angle from -9.9 to +2.2 is achieved within a 1.8-GHz frequency range in the 60-GHz band.

A new deadbeat control scheme for linear systems with input constraints is presented. Input constraints exist in most control systems, but in conventional dead-beat control, logical strategy to handle it has not been studied enough. The proposed controller in this paper adjusts the number of steps for dead-beat tracking on-line, in order to achieve delayed deadbeat-tracking performance and satisfy any admissible input constraint. Increasing the number of steps for dead-beat tracking and formulating the corresponding degree of freedom into null-space vectors make it possible to obtain delayed dead-beat tracking, and minimize the inevitable delay, respectively. LMI feasibility problems are solved to numerically obtain the solution and minimize the unavoidable step-delay. As a result, calculation effort is reduced compared to LMI-optimization problem. The proposed schemes can be readily numerically implemented. Its practical usefulness is validated by simulation for 6-axis robot model and experimental results for DC-motor servoing.

This paper presents a time amplifier design that improves time resolution using an inverter chain delay in SR latches. Compared with the conventional design, the proposed time amplifier has better characteristics such as higher gain, wide range, and small die size. It is implemented using 0.13 µm standard CMOS technology and the experimental results agree well with the theory.

We propose a novel epidemic routing policy, named energy optimal epidemic routing, for delay tolerant networks (DTNs). By investigating the tradeoff between delay and energy, we found the optimal transmission range as well as the optimal number of infected nodes for the minimal energy consumption, given a delivery requirement, specifically delay bound and delivery probability to the destination. We derive an analytic model of the Binary Spraying routing to find the optimal values, describing the delay distributions with respect to the number of infected nodes.

OFDM (Orthogonal Frequency Division Multiplexing) is widely used in wideband wireless communication systems due to its excellent performance. One of the most important operations in OFDM receivers is preamble detection. This paper addresses a general form of extended differential detection methods, which is a combination of differential detection and a moving average filter. This paper also presents a filter size determination method that achieves satisfactory performance in various channel environments.

In Malay language, there are no conjugations and declensions and affixes have important grammatical functions. In Malay, the same word may function as a noun, an adjective, an adverb, or, a verb, depending on its position in the sentence. Although extensively simple root words are used in informal conversations, it is essential to use the precise words in formal speech or written texts. In Malay, to make sentences clear, derivative words are used. Derivation is achieved mainly by the use of affixes. There are approximately a hundred possible derivative forms of a root word in written language of the educated Malay. Therefore, the composition of Malay words may be complicated. Although there are several types of stemming algorithms available for text processing in English and some other languages, they cannot be used to overcome the difficulties in Malay word stemming. Stemming is the process of reducing various words to their root forms in order to improve the effectiveness of text processing in information systems. It is essential to avoid both over-stemming and under-stemming errors. We have developed a new Malay stemmer (stemming algorithm) for removing inflectional and derivational affixes. Our stemmer uses a set of affix rules and two types of dictionaries: a root-word dictionary and a derivative-word dictionary. The use of set of rules is aimed at reducing the occurrence of under-stemming errors, while that of the dictionaries is believed to reduce the occurrence of over-stemming errors. We performed an experiment to evaluate the application of our stemmer in text mining software. For the experiment, text data used were actual web pages collected from the World Wide Web to demonstrate the effectiveness of our Malay stemming algorithm. The experimental results showed that our stemmer can effectively increase the precision of the extracted Boolean expressions for text categorization.