Rapid DNA hybridization analysis using a PDMS microfluidic sensor and a molecular beacon.

A rapid DNA analysis has been developed based on a fluorescence intensity change of a molecular beacon in a PDMS microfluidic channel. Recently, we reported a new analytical method of DNA hybridization involving a PDMS microfluidic sensor using fluorescence energy transfer (FRET). However, there are some limitations in its application to real DNA samples because the target DNA must be labelled with a suitable fluorescent dye. To resolve this problem, we have developed a new DNA microfluidic sensor using a molecular beacon. By monitoring the change in the restored fluorescence intensity along the channel length, it is possible to rapidly detect any hybridization of the molecular beacon to the target DNA. In this case, the target DNA does not need to be labelled. Our experimental results demonstrate that this microfluidic sensor using a molecular beacon is a promising diagnostic tool for rapid DNA hybridization analysis.     

Collision-Free Interleaver Composed of a Latin Square for Parallel-Architecture Turbo Codes

In parallel-architecture turbo codes, the constituent interleavers must avoid memory collision. This paper proposes a collision-free interleaver structure composed of a Latin square (LS) and pre-designed interleavers. Our proposed interleavers can be easily optimized for various information block sizes and for various degrees of parallelism. Their performances were evaluated by computer simulation.     

Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network

This paper considers a receiver set partitioning and sequencing problem in a wavelength division multiplexing single-hop lightwave network for multicasting traffic. The problem is analysed in the approach of uncapacitated single batch-processing machine scheduling. In the analysis, several solution properties are characterized with respect to a mean flow time measure, based upon which two heuristic algorithms are developed, along with a dynamic programming algorithm. Several numerical experiments show that the heuristic algorithms generate good schedules. The problem is extended to consider two measures simultaneously including the mean flow time and the number of transmissions, for which the proposed algorithms also perform well.     

Channel capacity and state estimation for state-dependent Gaussian channels

We formulate a problem of state information transmission over a state-dependent channel with states known at the transmitter. In particular, we solve a problem of minimizing the mean-squared channel state estimation error E/spl par/S/sup n/ - S/spl circ//sup n//spl par/ for a state-dependent additive Gaussian channel Y/sup n/ = X/sup n/ + S/sup n/ + Z/sup n/ with an independent and identically distributed (i.i.d.) Gaussian state sequence S/sup n/ = (S/sub 1/, ..., S/sub n/) known at the transmitter and an unknown i.i.d. additive Gaussian noise Z/sup n/. We show that a simple technique of direct state amplification (i.e., X/sup n/ = /spl alpha/S/sup n/), where the transmitter uses its entire power budget to amplify the channel state, yields the minimum mean-squared state estimation error. This same channel can also be used to send additional independent information at the expense of a higher channel state estimation error. We characterize the optimal tradeoff between the rate R of the independent information that can be reliably transmitted and the mean-squared state estimation error D. We show that any optimal (R, D) tradeoff pair can be achieved via a simple power-sharing technique, whereby the transmitter power is appropriately allocated between pure information transmission and state amplification.     

The Region 1 & 3 Broadcasting‐Satellite Service Plan after WRC‐03

The 1977 Broadcasting‐Satellite Service (BSS) Plan for Region 1 & 3 had been widely acknowledged to be out‐of‐date by the late 1980s. Development of digital modulation in the early 1990s provided an opportunity to update the technical provisions of the Plan to make it more economically viable. After a decade of work and three World Radiocommunication Conferences (WRCs), the revision of Region 1 & 3 BSS Plan was finally completed in 2003. The new Plan increased channel assignments from 5 to 10 analog‐equivalent channels for each country in Region 1, and from 4 to 12 channels for each country in Region 3. Yet, despite the increase in capacity, the new Plan is surprisingly similar to the original one in terms of the technical parameters. It is still based on national coverage, and the channel plan, orbital location, orbital spacing, and polarization are also the same. As a result, the new Plan is no more economically viable to implement than the old. To create economically viable BSS systems would most likely require modifications to the assignment in the Plan. Yet, modification procedures were made more difficult to apply after replanning. Less future implementation of BSS networks than would otherwise have occurred can be expected, and an inefficient usage of these frequency bands will likely result. On the other hand, less implemented systems will mean more capacity set aside for future use. This is important for countries that currently do not have satellite operations. In the end, BSS replanning reflects the eternal conflict between efficient usage and guaranteed future access. Copyright © 2005 John Wiley & Sons, Ltd.     

Multi-antenna scheme for high capacity transmission in the digital audio broadcasting

In this paper, we apply multi-antenna scheme to DAB system for high-rate transmission. In the MIMO-DAB system with a number of transmitting and receiving antennas increases the transmission rate efficiently with low multiplication operations. For channel estimation in the MIMO-DAB system, we propose a new PRS structure and evaluate the channel estimation performance. The proposed PRS structure can estimate multi-channel information based on the semi-blind processing. The performance of proposed PRS is compared with that of conventional training sequence employing Tarokh's transmission matrix. And also we investigate the performance limitation due to the imperfect channel estimation in a MIMO-DAB receiver. It has been shown that the MIMO-DAB system with multi-antennas can achieve the high-rate transmission for multimedia broadcasting and the performance of MIMO-DAB system is impaired by imperfect channel information.     

Fourier-Feynman transform, convolution and first variation

We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral. This revised version was published online in June 2006 with corrections to the Cover Date.     

A parallel cell‐based DSMC method on unstructured adaptive meshes

A parallel DSMC method based on a cell‐based data structure is developed for the efficient simulation of rarefied gas flows on PC‐clusters. Parallel computation is made by decomposing the computational domain into several subdomains. Dynamic load balancing between processors is achieved based on the number of simulation particles and the number of cells allocated in each subdomain. Adjustment of cell size is also made through mesh adaptation for the improvement of solution accuracy and the efficient usage of meshes. Applications were made for a two‐dimensional supersonic leading‐edge flow, the axi‐symmetric Rothe's nozzle, and the open hollow cylinder flare flow for validation. It was found that the present method is an efficient tool for the simulation of rarefied gas flows on PC‐based parallel machines. Copyright © 2004 John Wiley & Sons, Ltd.