Signal processing in high speed OTDM networks

This paper presents the design and experimental results of an optical packet-switching testbed capable of performing message routing with single wavelength TDM packet bit rates as high as 100 Gb/s

Error control for reliable digital data transmission and storage systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this paper we present some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative alorithm to find the error locator polynomial. Two codes are considered: (1) a d sub min = 4 single-byte-error-correcting (SBEC), double-byte-error-detecting (DBED) RS code; and (2) a d sub min = 6 double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS code

Modified Bethe-Peierls boundary condition for ultracold atoms with Spin-Orbit coupling

We show that the Bethe-Peierls (BP) boundary condition should be modified for ultracold atoms with spin-orbit (SO) coupling. Moreover, we derive a general form of the modified BP boundary condition, which is applicable to a system with arbitrary kind of SO coupling. In the modified BP condition, an anisotropic term appears and the inter-atomic scattering length is normally SO-coupling dependent. For the special system in the current experiments, however, it can be proved that the scattering length is SO-coupling independent, and takes the same value as in the case without SO coupling. Our result is helpful for the study of both few-body and many-body physics in SO-coupled ultracold gases.Comment: 8 pages, significant improvement is made in the current versio

Alternative Splicing and Polyadenylation Contribute to the Generation of hERG1 C-terminal Isoforms

The human ether-a-go-go-related gene 1 (hERG1) encodes the pore-forming subunit of the rapidly activating delayed rectifier potassium channel. Several hERG1 isoforms with different N- and C-terminal ends have been identified. The hERG1a, hERG1b, and hERG1-3.1 isoforms contain the full-length C terminus, whereas the hERG1USOisoforms, hERG1aUSO and hERG1bUSO, lack most of the C-terminal domain and contain a unique C-terminal end. The mechanisms underlying the generation of hERG1USOisoforms are not understood. We show that hERG1 isoforms with different C-terminal ends are generated by alternative splicing and polyadenylation of hERG1 pre-mRNA. We identified an intrinsically weak, noncanonical poly(A) signal, AGUAAA, within intron 9 of hERG1 that modulates the expression of hERG1a and hERG1aUSO. Replacing AGUAAA with the strong, canonical poly(A) signal AAUAAA resulted in the predominant production of hERG1aUSO and a marked decrease in hERG1 current. In contrast, eliminating the intron 9 poly(A) signal or increasing the strength of 5′ splice site led to the predominant production of hERG1a and a significant increase in hERG1 current. We found significant variation in the relative abundance of hERG1 C-terminal isoforms in different human tissues. Taken together, these findings suggest that post-transcriptional regulation of hERG1 pre-mRNA may represent a novel mechanism to modulate the expression and function of hERG1 channels

Real-Reward Testing for Probabilistic Processes (Extended Abstract)

We introduce a notion of real-valued reward testing for probabilistic processes by extending the traditional nonnegative-reward testing with negative rewards. In this richer testing framework, the may and must preorders turn out to be inverses. We show that for convergent processes with finitely many states and transitions, but not in the presence of divergence, the real-reward must-testing preorder coincides with the nonnegative-reward must-testing preorder. To prove this coincidence we characterise the usual resolution-based testing in terms of the weak transitions of processes, without having to involve policies, adversaries, schedulers, resolutions, or similar structures that are external to the process under investigation. This requires establishing the continuity of our function for calculating testing outcomes.Comment: In Proceedings QAPL 2011, arXiv:1107.074