A Combined Antenna Array and Multi-User Detection DS-CDMA Receiver in Single-Path and Multi-Path Fading Channels

An adaptive antenna array is incorporated into a decorrelatingmulti-user detector to effectively increase the DS-CDMA system capacity.Capacity improvement is due to beamforming gain, spatial diversity gain(assuming large angle spread), and the decorrelating effect. Thereceiver has been analyzed for the cases of sufficiently andinsufficiently spaced receiving antennas. The receiver consists of afront-end beamformer for every user in the cell and has knowledge of allusers' signature sequences. The beamformer estimates the desired userchannel vector, enhancing its signal and reducing the co-channelinterference from other directions. The multi-user detection, exploitingknowledge of other users, rejects those interferers whose arrival anglesare close to that of the desired user. The average uncoded Bit ErrorRate (BER) as a function of the number of in-beam active users, theaverage antenna Signal-to-Noise Ratio (SNR), and the number of receivingantennas is examined in both single-path and multi-path Rayleigh fadingchannels. Analysis shows an increase in system capacity proportional tothe number of receiving antennas.     

On Series of Ordinals and Combinatorics

This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well-known that for finite ordinals ∑_bT<αβ is the number of 2-element subsets of an α-element set. It is shown here that for any well-ordered set of arbitrary infinite order type α, ∑_bT<αβ is the ordinal of the set M of 2-element subsets, where M is ordered in some natural way. The result is then extended to evaluating the ordinal of the set of all n-element subsets for each natural number n ≥ 2. Moreover, series ∑_β<αf(β) are investigated and evaluated, where α is a limit ordinal and the function f belongs to a certain class of functions containing polynomials with natural number coefficients. The tools developed for this result can be extended to cover all infinite α, but the case of finite α appears to be quite problematic.     

Synthesis of β -Cyperone via Fungal Hydroxylation of thujone-derived tricyclic cyclopropanes

Synthesis of optically active sesquiterpenes with a eudesmane C-skeleton from the chiral starting material thujone involves transformation of a tricyclic intermediate (1R,2R,4S)-1,7-dimethyl-4-(1-methylethyl)tricyclo[4.4.0.0^2,4]dec-6-en-8-one ( 2 ) into the bicyclic compound β -cyperone ( 5 ). Hydroxylation of 2 at C(5) or C(11) permits subsequent opening of the cyclopropane ring and rearrangement to β -cyperone. In this publication, studies involving hydroxylation of 2 by fungal cultures are presented. The resultant products are useful intermediates in efficient synthesis of eudesmane sesquiterpenes. Of five fungi tested, Rhizopus oryzae ATCC 11145 proved most versatile. It hydroxylates at the exocyclic C(11) position in high yield (70%) and, to a lesser extent, at C(5) (5%). Enzymatic activity appears at the end of growth phase and at least 2.2 g of 2 per liter can be metabolized without significant loss of product yield. A second fungus, Cunninghamella echinulata ATCC 9244, proved most useful for hydroxylation of derivatives of 2 for the preparation of derivatives of β -cyperone, although product yields were low (2–20%), some derivatives were nonreactive, and hydroxylation at C(9) occurred. The relationship between precursor structure and enzyme affinity is discussed.     

Fibre backbone for cable TV using multi-channel am video trunking

This paper updates a scenario for the evolutionary integration of optical fibre transmission technology into existing cable television networks first presented in 1988. The resulting ‘fibre backbone’ yields a hybrid fibre/coaxial network with significantly better reliability and transmission quality than present systems. System and electro-optical component advances in the last year are reviewed, and the merits of various modulation techniques are examined. The fibre backbone approach emphasizes continuing the broadband delivery of a large number of video signals to the consumer.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Segregation in the Falicov--Kimball Model

The Falicov–Kimball model is a simple quantum lattice model that describes light and heavy electrons interacting with an on-site repulsion; alternatively, it is a model of itinerant electrons and fixed nuclei. It can be seen as a simplification of the Hubbard model; by neglecting the kinetic (hopping) energy of the spin up particles, one gets the Falicov–Kimball model. We show that away from half-filling, i.e. if the sum of the densities of both kinds of particles differs from 1, the particles segregate at zero temperature and for large enough repulsion. In the language of the Hubbard model, this means creating two regions with a positive and a negative magnetization. Our key mathematical results are lower and upper bounds for the sum of the lowest eigenvalues of the discrete Laplace operator in an arbitrary domain, with Dirichlet boundary conditions. The lower bound consists of a bulk term, independent of the shape of the domain, and of a term proportional to the boundary. Therefore, one lowers the kinetic energy of the itinerant particles by choosing a domain with a small boundary. For the Falicov- Kimball model, this corresponds to having a single “compact” domain that has no heavy particles. Received: 21 June 2001 / Accepted: 4 January 2002     

Elektrische und thermische Eigenschaften von Salzlösungen

Ohne Zusammenfassung     

Hypernormal form theory: foundations and algorithms

Hypernormal forms (unique normal forms, simplest normal forms) are investigated both from the standpoint of foundational theory and algorithms suitable for use with computer algebra. The Baider theory of the Campbell-Hausdorff group is refined, by a study of its subgroups, to determine the smallest substages into which the hypernormalization process can be divided. This leads to a linear algebra algorithm to compute the generators needed for each substage with the least amount of work. A concrete interpretation of Jan Sanders’ spectral sequence for hypernormal forms is presented. Examples are given, and a proof is given for a little-known theorem of Belitskii expressing the hypernormal form space (in the inner product style) as the kernel of a higher-order differential operator.