On the complexity of suboptimal decoding for list and decision feedback schemes

We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.     

Optimized analysis of the critical behavior in polymer mixtures from Monte Carlo simulations

A complete outline is given for how to determine the critical properties of polymer mixtures with extrapolation methods similar to the Ferrenberg-Swendsen techniques recently devised for spin systems. By measuring not only averages but the whole distribution of the quantities of interest, it is possible to extrapolate the data obtained in only a few simulations nearT _c over the entire critical region, thereby saving at least 90% of the computer time normally needed to locate susceptibility peaks or cumulant intersections and still getting more precise results. A complete picture of the critical properties of polymer mixtures in the thermodynamic limit is then obtained with finite-size scaling functions. Since the amount of information extracted from a simulation in this way is drastically increased as compared to conventional methods, the investigation of mixtures with long chains or built-in asymmetries is now possible. As an example, the critical points, exponents, and amplitudes of dense, symmetric polymer mixtures with chain lengths ranging fromN=16 up toN=256 are determined within the framework of the 3D bond fluctuation model using grand canonical simulation techniques. As an example for an asymmetry, the generalization of the method to asymmetric monomer potentials is briefly discussed.     

Hierarchy of rational order families of chaotic maps with an invariant measure

We introduce an interesting hierarchy of rational order chaotic maps that possess an invariant measure. In contrast to the previously introduced hierarchy of chaotic maps [1–5], with merely entropy production, the rational order chaotic maps can simultaneously produce and consume entropy. We compute the Kolmogorov-Sinai entropy of these maps analytically and also their Lyapunov exponent numerically, where the obtained numerical results support the analytical calculations.     

Adaptive Interpolation by Scaled Multiquadrics

We present an adaptive method to extract shape-preserving information from a univariate data sample. The behavior of the signal is obtained by interpolating at adaptively selected few data points by a linear combination of multiquadrics with variable scaling parameters. On the theoretical side, we give a sufficient condition for existence of the scaled multiquadric interpolant. On the practical side, we give various examples to show the applicability of the method.     

Scaling by Binormalization

We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices.     

Grow-up rate of solutions for a supercritical semilinear diffusion equation

We study solutions of the Cauchy problem for a supercritical semilinear parabolic equation which converge to a singular steady state from below as t→∞. We show that the grow-up rate of such solutions depends on the spatial decay rate of initial data.     

Power scaling of printed-circuit-board preionized TEA CO2 laser up to 3.6 kW

A high average power, high-repetition-rate TEA CO₂ laser employing printed-circuit-board preionizer is described. The power scaling of this preionization configuration has been demonstrated. The average output power reaches 3.6 kW at pulse repetition rate of 180 pps. Furthermore, the scaling-up ability of the rotating spark gap as high-voltage switch for high-average-power gas laser has been validated.     

Affine scaling algorithm fails for semidefinite programming

In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere.     

Operational characteristics and power scaling of a transverse flow transversely excited CW CO<Subscript>2</Subscript> laser

Transverse flow transversely excited (TFTE) CO₂ lasers are easily scalable to multikilowatt level. The laser power can be scaled up by increasing the volumetric gas flow and discharge volume. It was observed in a TFTE CW CO₂ laser having single row of pins as an anode and tubular cathode that the laser power was not increasing when the discharge volume and the gas volumetric flow were increased by increasing the electrode separation keeping the gas flow velocity constant. The discharge voltage too remained almost constant with the change of electrode separation at the same gas flow velocity. This necessitated revision of the scaling laws for designing this type of high power CO₂ laser. Experimental results of laser performance for different electrode separations are discussed and the modifications in the scaling laws are presented.