A new binary sequence family with low correlation and large size

For odd n=2l+1 and an integer /spl rho/ with 1/spl les//spl rho//spl les/l, a new family S/sub o/(/spl rho/) of binary sequences of period 2/sup n/-1 is constructed. For a given /spl rho/, S/sub o/(/spl rho/) has maximum correlation 1+2/sup n+2/spl rho/-1/2/, family size 2/sup n/spl rho//, and maximum linear span n(n+1)/2. Similarly, a new family of S/sub e/(/spl rho/) of binary sequences of period 2/sup n/-1 is also presented for even n=2l and an integer /spl rho/ with 1/spl les//spl rho/相似文献   

A multidimensional phase-locked loop for blind multiuser detection

This paper concerns the problem of blind multiuser detection, a special case of the blind source separation problem in which the source signals have finite alphabets. Specifically, we address the problem of identifying and resolving the n/spl times/n unitary matrix ambiguity U that results from whitening the receiver observations, where n is the number of sources. We propose the multidimensional phase-locked loop (MPLL) as a generalization of a scalar decision-directed PLL to vector-valued signals. The MPLL adapts an estimate of U according to the recursion U/spl circ//sub k+1/=U/spl circ//sub k/R/sub k/, where R/sub k/ is an n-dimensional Householder-like rotation depending on only the kth receiver observation. The O(n/sup 2/) complexity of an efficient implementation of the algorithm is extremely low. Nevertheless, simulation results demonstrate good convergence properties and superior steady-state performance when compared with prior techniques. The algorithm is also able to accommodate large alphabets and shaped alphabets.     

A time-scale decomposition approach to measurement-based admission control

We propose a time-scale decomposition approach to measurement-based admission control (MBAC). We identify a critical time scale, T/spl tilde//sub h/, such that: 1) aggregate traffic fluctuations slower than T/spl tilde//sub h/ can be tracked by the admission controller and compensated for by flow admissions and departures; 2) fluctuations faster than T/spl tilde//sub h/ have to be absorbed by reserving spare bandwidth on the link. The critical time scale is shown to scale as T/sub h///spl radic/n, where T/sub h/ is the average flow duration and n is the size of the link in terms of the number of flows it can carry. An MBAC design is presented which filters aggregate measurements into low- and high-frequency components separated at the cutoff frequency, 1/T/spl tilde//sub h/, using the low-frequency component to track slow time-scale traffic fluctuations and the high-frequency component to estimate the spare bandwidth needed. Our analysis shows that the scheme achieves high utilization and is robust to traffic heterogeneity, multiple time-scale fluctuations and measurement errors. The scheme uses only measurements of aggregate bandwidth and does not need to keep track of per-flow information.     

The rank and kernel of extended 1-perfect /spl Zopf//sub 4/-linear and additive non-/spl Zopf//sub 4/-linear codes

A binary extended 1-perfect code of length n + 1 = 2/sup t/ is additive if it is a subgroup of /spl Zopf//sub 2//sup /spl alpha// /spl times/ /spl Zopf//sub 4//sup /spl beta//. The punctured code by deleting a /spl Zopf//sub 2/ coordinate (if there is one) gives a perfect additive code. 1-perfect additive codes were completely characterized and by using that characterization we compute the possible parameters /spl alpha/, /spl beta/, rank, and dimension of the kernel for extended 1-perfect additive codes. A very special case is that of extended 1-perfect /spl Zopf//sub 4/-linear codes.     

New View on an Anisotropic Medium and Its Application to Transformation from Anisotropic to Isotropic Problems

The metric factor is defined as m(epsilon*/sub x/, epsilon*/sub y/, theta/sub x/) = /spl radic/ cos/sup 2/theta/sub x/ / epsilon*/sub x/ + sin/sup 2/theta/sub x/ / epsilon*/sub y/ in the radial direction, with the angle theta/sub x/ from the x axis being one of the principal axes in an anisotropic dielectric medium filling the two-dimensional space. The normalized metric factor is defined as n(epsilon*/sub x/, epsilon*/sub y/, theta/sub x/, beta) /spl equiv/ m(epsilon*/sub x/, epsilon*/sub y/, theta/sub x/) / m(epsilon*/sub x/, epsilon*/sub y/, beta) in the form normalized by the metric factor in the direction with the angle beta from the x axis. The effective path length d'/sub P1P2/ between the points P1 and P2 is defined as d'/sup P1P2/ = n(epsilon*/sub x/, epsilon*/sub y/, theta/sub x/, beta)d/sub P1P2/ where d/sub P1P2/ is the actual path length of the straight line P1P2 with the angle theta/sub x/ from the x axis. We propose the minimun principle of the effective path length for electric flux in the region with multilayered anisotropic media. It is applied to solving the electrostatic problem with two anisotropic media whose principal axes are different. We show by using the normalized metric factor that the anisotropic problem can be transformed into the isotropic problem.     

Entropy and the law of small numbers

Two new information-theoretic methods are introduced for establishing Poisson approximation inequalities. First, using only elementary information-theoretic techniques it is shown that, when S/sub n/=/spl Sigma//sub i=1//sup n/X/sub i/ is the sum of the (possibly dependent) binary random variables X/sub 1/,X/sub 2/,...,X/sub n/, with E(X/sub i/)=p/sub i/ and E(S/sub n/)=/spl lambda/, then D(P(S/sub n/)/spl par/Po(/spl lambda/)) /spl les//spl Sigma//sub i=1//sup n/p/sub i//sup 2/+[/spl Sigma//sub i=1//sup n/H(X/sub i/)-H(X/sub 1/,X/sub 2/,...,X/sub n/)] where D(P(S/sub n/)/spl par/Po(/spl lambda/)) is the relative entropy between the distribution of S/sub n/ and the Poisson (/spl lambda/) distribution. The first term in this bound measures the individual smallness of the X/sub i/ and the second term measures their dependence. A general method is outlined for obtaining corresponding bounds when approximating the distribution of a sum of general discrete random variables by an infinitely divisible distribution. Second, in the particular case when the X/sub i/ are independent, the following sharper bound is established: D(P(S/sub n/)/spl par/Po(/spl lambda/))/spl les/1//spl lambda/ /spl Sigma//sub i=1//sup n/ ((p/sub i//sup 3/)/(1-p/sub i/)) and it is also generalized to the case when the X/sub i/ are general integer-valued random variables. Its proof is based on the derivation of a subadditivity property for a new discrete version of the Fisher information, and uses a recent logarithmic Sobolev inequality for the Poisson distribution.     

A fast algorithm for computing multidimensional DCT on certain small sizes

This paper presents a new algorithm for the fast computation of multidimensional (m-D) discrete cosine transform (DCT) with size N/sub 1//spl times/N/sub 2//spl times//spl middot//spl middot//spl middot//spl times/N/sub m/, where N/sub i/ is a power of 2 and N/sub i//spl les/256, by using the tensor product decomposition of the transform matrix. It is shown that the m-D DCT or inverse discrete cosine transform (IDCT) on these small sizes can be computed using only one-dimensional (1-D) DCTs and additions and shifts. If all the dimensional sizes are the same, the total number of multiplications required for the algorithm is only 1/m times of that required for the conventional row-column method. We also introduce approaches for computing scaled DCTs in which the number of multiplications is considerably reduced.     

Order statistics from a logistic distribution and applications to survival and reliability analysis

Joint moments involving arbitrary powers of order statistics are the main concern. Consider order statistics u/sub 1/ /spl les/ u/sub 2/ /spl les/ /spl middot//spl middot//spl middot/ /spl les/ u/sub k/ coming from a simple random sample of size n from a real continuous population where u/sub 1/ = x/sub r(1):n/ is order-statistic #r/sub 1/, u/sub 2/ = x/sub r(1)+r(2):n/ is order statistic #(r/sub 1/ + r/sub 2/), et al., and u/sub k/ = x/sub r(1)+/spl middot//spl middot//spl middot/+r(k):n/ is order statistic #(r/sub 1/ +/spl middot//spl middot//spl middot/+ r/sub k/). Product moments are examined of the type E[u/sub 1//sup /spl alpha/(1)/ /spl middot/ u/sub 2//sup /spl alpha/(2)//sub /spl middot/ /spl middot//spl middot//spl middot//spl middot//u/sub k//sup /spl alpha/(k)/] where /spl alpha//sub 1/, ..., /spl alpha//sub k/ are arbitrary quantities that might be complex numbers, and E[/spl middot/] denotes the s-expected value. Some explicit evaluations are considered for a logistic population. Detailed evaluations of all integer moments of u/sub 1/ and recurrence relations, recurring only on the order of the moments, are given. Connections to survival functions in survival analysis, hazard functions in reliability situations, real type-1, type-2 /spl beta/ and Dirichlet distributions are also examined. Arbitrary product moments for the survival functions are evaluated. Very general results are obtained which can be used in many problems in various areas.     

Composite right/left-handed transmission line based compact resonant antennas for RF module integration

Several electrically small resonant antennas employing the composite right/left-handed transmission line (CRLH-TL) are presented for integration with portable RF modules. The proposed antenna designs are based on the unique property of anti-parallel phase and group velocity of the CRLH-TL at its fundamental mode. In this mode, the propagation constant increases as the frequency decreases, therefore, a small guided wavelength can be obtained at a lower frequency to provide the small /spl lambda//sub g//2 resonant length used to realize a compact antenna design. Furthermore, the physical size and the operational frequency of the antenna depend on the unit cell size and the equivalent transmission line model parameters of the CRLH-TL, including series inductance, series capacitance, shunt inductance and shunt capacitance. Optimization of these parameters as well as miniaturization techniques of the physical size of unit cell is investigated. A four unit-cell resonant antenna is designed and tested at 1.06 GHz. The length, width and height of the proposed antenna are 1/19/spl lambda//sub 0/, 1/23/spl lambda//sub 0/ and 1/83/spl lambda//sub 0/, respectively. In addition, a compact antenna using a 2-D three by three mushroom like unit cell arrangement is developed at 1.17 GHz, showing that an increased gain of 0.6 dB and higher radiation efficiency can be achieved over the first prototype antenna. The same design is applied in the development of a circularly polarized antenna operating at 2.46 GHz. A 116/spl deg/ beamwidth with axial ratio better than 3 dB is observed. The physical size of the proposed mushroom type small antenna and the circularly polarized antenna is 1/14/spl lambda//sub 0/ by 1/14/spl lambda//sub 0/ by 1/39/spl lambda//sub 0/ and 1/10/spl lambda//sub 0/ by 1/10/spl lambda//sub 0/ by 1/36/spl lambda//sub 0/, respectively.     

On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks

We develop on-line routing and wavelength assignment (RWA) algorithms for WDM bidirectional ring and torus networks with N nodes. The algorithms dynamically support all k-allowable traffic matrices, where k denotes an arbitrary integer vector [k/sub 1/, k/sub 2/,... k/sub N/], and node i, 1 /spl les/ i /spl les/ N, can transmit at most k/sub i/ wavelengths and receive at most k/sub i/ wavelengths. Both algorithms support the changing traffic in a rearrangeably nonblocking fashion. Our first algorithm, for a bidirectional ring, uses [(/spl Sigma//sub i=1//sup N/ k/sub i/)/3] wavelengths in each fiber and requires at most three lightpath rearrangements per new session request regardless of the number of nodes N and the amount of traffic k. When all the k/sub i/'s are equal to k, the algorithm uses [kN/3] wavelengths, which is known to be the minimum for any off-line rearrangeably nonblocking algorithm. Our second algorithm, for a torus topology, is an extension of a known off-line algorithm for the special case with all the k/sub i/'s equal to k. For an R /spl times/ C torus network with R /spl ges/ C nodes, our on-line algorithm uses [kR/2] wavelengths in each fiber, which is the same as in the off-line algorithm, and is at most two times a lower bound obtained by assuming full wavelength conversion at all nodes. In addition, the on-line algorithm requires at most C - 1 lightpath rearrangements per new session request regardless of the amount of traffic k. Finally, each RWA update requires solving a bipartite matching problem whose time complexity is only O (R), which is much smaller than the time complexity O(kCR/sup 2/) of the bipartite matching problem for an off-line algorithm.     

Low-frequency noise in submicrometer MOSFETs with HfO/sub 2/, HfO/sub 2//Al/sub 2/O/sub 3/ and HfAlO/sub x/ gate stacks

Low-frequency noise measurements were performed on p- and n-channel MOSFETs with HfO/sub 2/, HfAlO/sub x/ and HfO/sub 2//Al/sub 2/O/sub 3/ as the gate dielectric materials. The gate length varied from 0.135 to 0.36 /spl mu/m with 10.02 /spl mu/m gate width. The equivalent oxide thicknesses were: HfO/sub 2/ 23 /spl Aring/, HfAlO/sub x/ 28.5 /spl Aring/ and HfO/sub 2//Al/sub 2/O/sub 3/ 33 /spl Aring/. In addition to the core structures with only about 10 /spl Aring/ of oxide between the high-/spl kappa/ dielectric and silicon substrate, there were "double-gate oxide" structures where an interfacial oxide layer of 40 /spl Aring/ was grown between the high-/spl kappa/ dielectric and Si. DC analysis showed low gate leakage currents in the order of 10/sup -12/A(2-5/spl times/10/sup -5/ A/cm/sup 2/) for the devices and, in general, yielded higher threshold voltages and lower mobility values when compared to the corresponding SiO/sub 2/ devices. The unified number-mobility fluctuation model was used to account for the observed 1/f noise and to extract the oxide trap density, which ranged from 1.8/spl times/10/sup 17/ cm/sup -3/eV/sup -1/ to 1.3/spl times/10/sup 19/ cm/sup -3/eV/sup -1/, somewhat higher compared to conventional SiO/sub 2/ MOSFETs with the similar device dimensions. There was no evidence of single electron switching events or random telegraph signals. The aim of this paper is to present a general discussion on low-frequency noise characteristics of the three different high-/spl kappa//gate stacks, relative comparison among them and to the Si--SiO/sub 2/ system.     

Downlink transmission of broadband OFCDM Systems-part I: hybrid detection

The broadband orthogonal frequency and code division multiplexing (OFCDM) system with two-dimensional spreading (time and frequency domain spreading) is becoming a very attractive technique for high-rate data transmission in future wireless communication systems. In this paper, a quasianalytical study is presented on the downlink performance of the OFCDM system with hybrid multi-code interference (MCI) cancellation and minimum mean square error (MMSE) detection. The weights of MMSE are derived and updated stage by stage of MCI cancellation. The effects of channel estimation errors and sub-carrier correlation are also studied. It is shown that the hybrid detection scheme performs much better than pure MMSE when good channel estimation is guaranteed. The power ratio between the pilot channel and all data channels should be set to 0.25, which is a near optimum value for the two-dimensional spreading system with time domain spreading factor (N/sub T/) of 4 and 8. On the other hand, in a slow fading channel, a large value of the channel estimation window size /spl gamma/N/sub T/, where /spl gamma/ is an odd integer, is expected. However, /spl gamma/=3 is large enough for the system with N/sub T/=8 while /spl gamma/=5 is more desirable for the system with N/sub T/=4. Although performance of the hybrid detection degrades in the presence of the sub-carrier correlation, the hybrid detection still works well even the correlation coefficient is as high as 0.7. Finally, given N/sub T/, although performance improves when the frequency domain spreading factor (N/sub F/) increases, the frequency diversity gain is almost saturated for a large value of N/sub F/ (i.e., N/sub F/ /spl ges/ 32).     

The empirical distribution of rate-constrained source codes

Let X = (X/sub 1/,...) be a stationary ergodic finite-alphabet source, X/sup n/ denote its first n symbols, and Y/sup n/ be the codeword assigned to X/sup n/ by a lossy source code. The empirical kth-order joint distribution Q/spl circ//sup k/[X/sup n/,Y/sup n//spl rceil/(x/sup k/,y/sup k/) is defined as the frequency of appearances of pairs of k-strings (x/sup k/,y/sup k/) along the pair (X/sup n/,Y/sup n/). Our main interest is in the sample behavior of this (random) distribution. Letting I(Q/sup k/) denote the mutual information I(X/sup k/;Y/sup k/) when (X/sup k/,Y/sup k/)/spl sim/Q/sup k/ we show that for any (sequence of) lossy source code(s) of rate /spl les/R lim sup/sub n/spl rarr//spl infin//(1/k)I(Q/spl circ//sup k/[X/sup n/,Y/sup n//spl rfloor/) /spl les/R+(1/k)H (X/sub 1//sup k/)-H~(X) a.s. where H~(X) denotes the entropy rate of X. This is shown to imply, for a large class of sources including all independent and identically distributed (i.i.d.). sources and all sources satisfying the Shannon lower bound with equality, that for any sequence of codes which is good in the sense of asymptotically attaining a point on the rate distortion curve Q/spl circ//sup k/[X/sup n/,Y/sup n//spl rfloor//spl rArr//sup d/P(X/sup k/,Y~/sup k/) a.s. whenever P(/sub X//sup k//sub ,Y//sup k/) is the unique distribution attaining the minimum in the definition of the kth-order rate distortion function. Consequences of these results include a new proof of Kieffer's sample converse to lossy source coding, as well as performance bounds for compression-based denoisers.     

Analysis of Four-Frequency Nonlinear Reactance Circuits

Several advantages of multiple-frequency nonlinear reactance circuits are described in this paper. In particular, a circuit is considered in which a nonlinear reactance couples four basic frequencies: /spl omega//sub 0/, /spl omega//sub 1/,/spl omega//sub 2/, and /spl omega//sub 3/; these are so related that /spl omega//sub 2/ = /spl omega//sub 0/ + /spl omega//sub 1/ and /spl omega//sub 3/ = /spl omega//sub 0/ - /spl omega//sub 1/. Here, /spl omega//sub 0/ is taken to be the power source or pump. It is found to be desirable to allow for the possible presence of the pump harmonic, 2/spl omega//sub 0/, and individual cases are characterized by whether 2/spl omega//sub 0/, is present or not. The major results are as follows: 1) Unlimited amplification gain is theoretically possible at frequencies higher than the pump, by reflecting negative input resistance at /spl omega//sub 2/, but without relying on any effects due to pump harmonics. 2) Unlimited up- or down-conversion gains between /spl omega//sub 1/ and /spl omega//sub 2/ are theoretically possible in the additional presence of the first pump harmonic, but without reflecting negative input or output resistance. 3) Unlimited amplification gain is theoretically possible at frequencies both lower and higher than the pump fundamental, without reflecting negative input resistance.     

On the filtering problem for stationary random /spl Zopf//sup 2/-fields

It is shown that whenever a stationary random field (Z/sub n,m/)/sub n,m/spl isin/z/ is given by a Borel function f:/spl Ropf//sup z/ /spl times/ /spl Ropf//sup z/ /spl rarr/ /spl Ropf/ of two stationary processes (X/sub n/)/sub n/spl isin/z/ and (Y/sub m/)/sub m/spl isin/z/ i.e., then (Z/sub n, m/) = (f((X/sub n+k/)/sub k/spl epsi/z/, (Y/sub m + /spl lscr// )/sub /spl lscr/ /spl epsi/z/)) under a mild first coordinate univalence assumption on f, the process (X/sub n/)/sub n/spl isin/z/ is measurable with respect to (Z/sub n,m/)/sub n,m/spl epsi/z/ whenever the process (Y/sub m/)/sub m/spl isin/z/ is ergodic. The notion of universal filtering property of an ergodic stationary process is introduced, and then using ergodic theory methods it is shown that an ergodic stationary process has this property if and only if the centralizer of the dynamical system canonically associated with the process does not contain a nontrivial compact subgroup.     

List decoding of q-ary Reed-Muller codes

The q-ary Reed-Muller (RM) codes RM/sub q/(u,m) of length n=q/sup m/ are a generalization of Reed-Solomon (RS) codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for RM codes were given in and . The algorithm in Sudan et al. (1999) is an improvement of the algorithm in , it is applicable to codes RM/sub q/(u,m) with u相似文献   

Cyclic codes over GR(4/sup m/) which are also cyclic over /spl Zopf//sub 4/

Let GR(4/sup m/) be the Galois ring of characteristic 4 and cardinality 4/sup m/, and /spl alpha/_={/spl alpha//sub 0/,/spl alpha//sub 1/,...,/spl alpha//sub m-1/} be a basis of GR(4/sup m/) over /spl Zopf//sub 4/ when we regard GR(4/sup m/) as a free /spl Zopf//sub 4/-module of rank m. Define the map d/sub /spl alpha/_/ from GR(4/sup m/)[z]/(z/sup n/-1) into /spl Zopf//sub 4/[z]/(z/sup mn/-1) by d/spl alpha/_(a(z))=/spl Sigma//sub i=0//sup m-1//spl Sigma//sub j=0//sup n-1/a/sub ij/z/sup mj+i/ where a(z)=/spl Sigma//sub j=0//sup n-1/a/sub j/z/sup j/ and a/sub j/=/spl Sigma//sub i=0//sup m-1/a/sub ij//spl alpha//sub i/, a/sub ij//spl isin//spl Zopf//sub 4/. Then, for any linear code C of length n over GR(4/sup m/), its image d/sub /spl alpha/_/(C) is a /spl Zopf//sub 4/-linear code of length mn. In this article, for n and m being odd integers, it is determined all pairs (/spl alpha/_,C) such that d/sub /spl alpha/_/(C) is /spl Zopf//sub 4/-cyclic, where /spl alpha/_ is a basis of GR(4/sup m/) over /spl Zopf//sub 4/, and C is a cyclic code of length n over GR(4/sup m/).     

Prime-length real-valued polynomial residue division algorithms

One class of efficient algorithms for computing a discrete Fourier transform (DFT) is based on a recursive polynomial factorization of the polynomial 1-z/sup -N/. The Bruun algorithm is a typical example of such algorithms. Previously, the Bruun algorithm, which is applicable only when system lengths are powers of two in its original form, is generalized and modified to be applicable to the case when the length is other than a power of two. This generalized algorithm consists of transforms T/sub d,f/ with prime d and real f in the range 0/spl les/f<0.5. T/sub d,0/ computes residues X(z)mod(1-z/sup -2/) and X(z)mod(1-2 cos(/spl pi/k/d)z/sup -1/+z/sup -2/), k=1, 2, ..., d-1, and T/sub d,f/ (f /spl ne/0) computes residues X(z)mod(1-2cos(2/spl pi/(f+k)/d)z/sup -1/+z/sup -2/), k=0, 1, ..., d-1 for a given real signal X(z) of length 2d. The purpose of this paper is to find efficient algorithms for T/sub d,f/. First, polynomial factorization algorithms are derived for T/sub d,0/ and T/sub d,1/4/. When f is neither 0 nor 1/4, it is not feasible to derive a polynomial factorization algorithm. Two different implementations of T/sub d,f/ for such f are derived. One implementation realizes T/sub d,f/ via a d-point DFT, for which a variety of fast algorithms exist. The other implementation realizes T/sub d,f/ via T/sub d, 1/4/, for which the polynomial factorization algorithm exists. Comparisons show that for d/spl ges/5, these implementations achieve better performance than computing each output of T/sub d,f/ separately.     

Time-frequency localisation of Shannon wavelet packets

It is well known that the 2/spl pi/ minimally supported frequency scaling function /spl phi//sup /spl alpha//(x) satisfying /spl phi//spl circ//sup /spl alpha//(/spl omega/)=/spl chi//sub (-/spl alpha/,2/spl pi/-/spl alpha/)/(/spl omega/), 0相似文献