Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

PNNI-based control plane for automatically switched optical networks

Much effort has been spent on the definition of control plane protocols for automatically switched optical networks (ASON). Most of the proposals brought into the standardization for an International Telecommunications Union-Telecommunication Sector, Internet Engineering Task Force, and Optical Internetworking Forum are based on Internet protocol concepts. One such proposal is the generalized multi-protocol label switching (GMPLS), an extension of the MPLS traffic engineering control plane model that includes nonpacket switched technologies (time, wavelength, and fiber switching). Recently, the potential use of private network-network interface (PNNI) in ASONs has been discussed as an alternative proposal by the standardization bodies. The goal of this paper is to appropriately adapt asynchronous transfer mode into an optical PNNI (O-PNNI) protocol that can be used as the control plane of ASONs. The paper also provides a critical viewpoint on the potential usage of either O-PNNI or GMPLS control plane and analyzes the pros and cons of each. The methodology adopted toward devising O-PNNI hinges on reviewing PNNI along with ASON recommendations in order to determine the set of PNNI features that require adaptation. Having identified these features we engineer and present appropriate solutions relating to routing, signaling and addressing aspects.     

Exposed Die-Top Encapsulation Molding for an Improved High- Performance Flip Chip BGA Package

The recent advancement in high- performance semiconductor packages has been driven by the need for higher pin count and superior heat dissipation. A one-piece cavity lid flip chip ball grid array (BGA) package with high pin count and targeted reliability has emerged as a popular choice. The flip chip technology can accommodate an I/O count of more than five hundreds500, and the die junction temperature can be reduced to a minimum level by a metal heat spreader attachment. None the less, greater expectations on these high-performance packages arose such as better substrate real estate utilization for multiple chips, ease in handling for thinner core substrates, and improved board- level solder joint reliability. A new design of the flip chip BGA package has been looked into for meeting such requirements. By encapsulating the flip chip with molding compound leaving the die top exposed, a planar top surface can be formed. A, and a flat lid can then be mounted on the planar mold/die top surface. In this manner the direct interaction of the metal lid with the substrate can be removed. The new package is thus less rigid under thermal loading and solder joint reliability enhancement is expected. This paper discusses the process development of the new package and its advantages for improved solder joint fatigue life, and being a multichip package and thin core substrate options. Finite-element simulations have been employed for the study of its structural integrity, thermal, and electrical performances. Detailed package and board-level reliability test results will also be reported     

Switched-Current Filters Revisited: Square-Root Domain Sampled-Data Filters

In this brief, the well-known switched-current (SI) filtering technique is revisited using the concept of the square-root domain (SRD) filtering. It is proved that SI filters are a subclass of the SRD filters, where sampled-data signal processing is performed. This is achieved by considering typical lossless and lossy SRD sampled-data integrator configurations, using a set of complementary SRD operators which are based on the quadratic I-V relationship of MOS transistor operated in the saturation. Circuit examples are given, where linear-domain integrator and third-order filter configurations were derived using appropriate SRD sampled-data building blocks     

Application of extended boundary conditions and the Haar wavelets in the analysis of wave scattering by thin screens

A recent approach to solution of 2D scattering problems for electromagnetic waves scattered by thin screens is analyzed. With the use of examples of scattering by a strip and an unclosed cylindrical surface, it is shown that the proposed approach has no advantages in terms of the efficiency of numerical solution over a well-known approach based on exact integral equations for currents that have singular kernels and that are solved with the Krylov-Bogoliubov method.     

On the effect of spatial variances in historical rainfall time series to CSO performance evaluation.

Historical, high-resolution rain series are the backbone of modern combined sewer overflow (CSO) structure design. These rain series are the input to the computational estimation of the performance of the measures with respect to CSO pollution abatement. However, those historical precipitation measurements are available at only a few locations. Frequently rain series have to be used from gauging stations at a significant distance. In order to judge and to compensate for this influence an estimate between rain characteristics and combined sewer outflow (CSO) performance indicators would be useful. In this paper such correlations have been sought for a collection of 37 rain series covering large areas of Europe. It was found that the mean annual rain volume can explain most of the variances for the performance indicators Number of overflows and CSO volume. For explaining the spatial differences in the efficiency of the CSO structure another rain characteristic, i.e. the maximum event with a return period of one year, is to be used.     

基于USB总线的虚拟频谱分析仪设计

文章详细介绍了基于USB总线的虚拟频谱分析仪的设计过程。该仪器使用嵌入式混合处理器MC56F8323来实现动态信号的实时采集、频谱分析和数字滤波等功能。处理结果由USB2．0接口芯片CY7C68013上传至PC机．以完成数据显示、存储、绘制图形等功能。其中，CY7C68013工作于Slave FIFO模式，以实现与MC56F8323间的数据传输。该系统可同时对两路动态信号进行实时谱分析，每路采样频率高选500kHz。     

可拆装高架火炬的应用

结合工程实例,介绍了我国第一座可拆装高架火炬的基本原理及组成,并对可拆装高架火炬与普通高架火炬在安全、技术、安装、维修、占地面积、投资等方面进行了比较,还分析了高架火炬未来的发展趋势.     

Routing Correlated Data with Fusion Cost in Wireless Sensor Networks

In this paper, we propose a routing algorithm called minimum fusion Steiner tree (MFST) for energy efficient data gathering with aggregation (fusion) in wireless sensor networks. Different from existing schemes, MFST not only optimizes over the data transmission cost, but also incorporates the cost for data fusion, which can be significant for emerging sensor networks with vectorial data and/or security requirements. By employing a randomized algorithm that allows fusion points to be chosen according to the nodes' data amounts, MFST achieves an approximation ratio of 5/4log(k + 1), where k denotes the number of source nodes, to the optimal solution for extremely general system setups, provided that fusion cost and data aggregation are nondecreasing against the total input data. Consequently, in contrast to algorithms that only excel in full or nonaggregation scenarios without considering fusion cost, MFST can thrive in a wide range of applications