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.     

MSP-G320240DBCW-211N大规模点阵式LCD与PIC单片机接口技术

介绍了大规模点阵式液晶显示器MSP-G320240DBCW-211N的特点及其与PIC18F6620单片机的接口技术，提出了应用过程中可能遇到的问题和解决方法．给出相关的C程序设计并在研制的智能光电检测仪器上得以成功地应用。     

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.     

Roles of rhenium diimine complexes as metal‐ion probes and photosensitizers in functional polyurethanes

Polyurethanes incorporated with rhenium diimine complexes were synthesized. The polymers exhibited interesting morphologies and solution properties. Results from gel permeation chromatography suggested the formation of polymer aggregates in solutions. The polymers could act as probes for metal ions. The addition of metal ions to polymer solutions led to significant changes in the electronic absorption properties of the polymer solutions. This was attributed to the interactions between the polyether moieties and metal ions. The metal complexes could also act as efficient photosensitizers. After doping with charge‐transport viologens, the photoconductivity of the polymers was greatly enhanced. The experimental quantum efficiency was simulated with Onsager's theory. The thermalization distances and the primary yields were typically 12–14 Å and 10^?3, respectively. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1708–1715, 2003     

On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences

We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of times, the k-level has subquadratic (O(n^2-1/2s) complexity. This answers one of the main open problems from the author’s previous paper [DCG 29, 375-393 (2003)], which provided a weaker upper bound for a restricted class of curves only (graphs of degree-s polynomials). When combined with existing tools (cutting curves, sampling, etc.), the new idea generates a slew of improved k-level results for most of the curve families studied earlier, including a near-O(n^3/2 bound for parabolas.     

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.