A Minimax Chebyshev Estimator for Bounded Error Estimation

We develop a nonlinear minimax estimator for the classical linear regression model assuming that the true parameter vector lies in an intersection of ellipsoids. We seek an estimate that minimizes the worst-case estimation error over the given parameter set. Since this problem is intractable, we approximate it using semidefinite relaxation, and refer to the resulting estimate as the relaxed Chebyshev center (RCC). We show that the RCC is unique and feasible, meaning it is consistent with the prior information. We then prove that the constrained least-squares (CLS) estimate for this problem can also be obtained as a relaxation of the Chebyshev center, that is looser than the RCC. Finally, we demonstrate through simulations that the RCC can significantly improve the estimation error over the CLS method.     

Hamilton-Jacobi skeleton on cortical surfaces

In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In our approach, a cortical surface is first partitioned into sulcal and gyral regions via the solution of a variational problem using graph cuts, which can guarantee global optimality. After that, we extend the method of Hamilton-Jacobi skeleton to subsets of triangulated surfaces, together with a geometrically intuitive pruning process that can trade off between skeleton complexity and the completeness of representing folding patterns. Compared with previous work that uses skeletons of 3-D volumes to represent sulcal patterns, the skeletons on cortical surfaces can be easily decomposed into branches and provide a simpler way to construct graphical representations of cortical morphometry. In our experiments, we demonstrate our method on two different cortical surface models, its ability of capturing major sulcal patterns and its application to compute skeletons of gyral regions.     

A new three-level soft-switched converter

A three-level, constant-frequency, isolated converter which employs a coupled inductor to achieve zero-voltage switching of the primary switches in the entire line and load range is described. Because the coupled inductor does not appear as a series inductance in the load current path, it does not cause a loss of duty cycle or severe voltage ringing across the output rectifiers. The operation and performance of the proposed converter was verified on a 1-kW prototype.     

Improved algorithms for the determination of turbo-code weight distributions

We discuss algorithms for determining exactly the lower terms of the weight distribution of a turbo code. Several improvements on the recently introduced algorithm by Garello et al. are outlined. The techniques presented in this letter improve the observed asymptotic complexity by a factor proportional to the information length. As an example, the improved algorithm is applied to the determination of the minimum distance of all universal mobile telecommunications system turbo codes. We further apply the improved algorithm to high-rate turbo codes using high-rate nonpunctured constituent codes. To reduce complexity, the constituent codes are represented by a minimal information bit-oriented trellis.     

A continuous-time /spl Sigma//spl Delta/ Modulator with reduced sensitivity to clock jitter through SCR feedback

This paper presents a means to overcome the high sensitivity of continuous-time sigma-delta (/spl Sigma//spl Delta/) modulators to clock jitter by using a modified switched-capacitor structure with resistive element in the continuous-time feedback digital-analog converter (DAC). The reduced sensitivity to jitter is both simulated and proven by measured results from two implemented third-order modulators. Additionally, the nonideal behavior is analyzed analytically and by simulations.     

A space-time trellis coding scheme for vector Gaussian broadcast channels

In this letter, a multiuser space-time trellis coding (MU-STTC) scheme is proposed for MIMO vector Gaussian broadcast channels (VGBC). For the system with two transmit antennas and two users with one receive antenna each, the proposed scheme decomposes the system into two subsystems, each of which is equivalent to a system with two transmit and one receive antenna with known interference. A novel precoding scheme is developed to eliminate such interference. The proposed scheme enables to incorporate space time trellis coding and adaptive weighting into the system to provide a significant coding and weighting gain. Simulation results confirm its good performance.     

Constructing free-energy approximations and generalized belief propagation algorithms

Important inference problems in statistical physics, computer vision, error-correcting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems that is exact when the factor graph is a tree, but only approximate when the factor graph has cycles. We show that BP fixed points correspond to the stationary points of the Bethe approximation of the free energy for a factor graph. We explain how to obtain region-based free energy approximations that improve the Bethe approximation, and corresponding generalized belief propagation (GBP) algorithms. We emphasize the conditions a free energy approximation must satisfy in order to be a "valid" or "maxent-normal" approximation. We describe the relationship between four different methods that can be used to generate valid approximations: the "Bethe method", the "junction graph method", the "cluster variation method", and the "region graph method". Finally, we explain how to tell whether a region-based approximation, and its corresponding GBP algorithm, is likely to be accurate, and describe empirical results showing that GBP can significantly outperform BP.     

Optimal base-station locations in two-tiered wireless sensor networks

We consider generic two-tiered wireless sensor networks (WSNs) consisting of sensor clusters deployed around strategic locations, and base-stations (BSs) whose locations are relatively flexible. Within a sensor cluster, there are many small sensor nodes (SNs) that capture, encode, and transmit relevant information from a designated area, and there is at least one application node (AN) that receives raw data from these SNs, creates a comprehensive local-view, and forwards the composite bit-stream toward a BS. This paper focuses on the topology control process for ANs and BSs, which constitute the upper tier of two-tiered WSNs. Since heterogeneous ANs are battery-powered and energy-constrained, their node lifetime directly affects the network lifetime of WSNs. By proposing algorithmic approaches to locate BSs optimally, we can maximize the topological network lifetime of WSNs deterministically, even when the initial energy provisioning for ANs is no longer always proportional to their average bit-stream rate. The obtained optimal BS locations are under different lifetime definitions according to the mission criticality of WSNs. By studying intrinsic properties of WSNs, we establish the upper and lower bounds of maximal topological lifetime, which enable a quick assessment of energy provisioning feasibility and topology control necessity. Numerical results are given to demonstrate the efficacy and optimality of the proposed topology control approaches designed for maximizing network lifetime of WSNs.     

A compact thin-film-based all-pass device for the compensation of the in-band dispersion in FBG filters

Fiber Bragg grating (FBG)-based bandpass filters, while possessing close to ideal sharp rolloff characteristics, can suffer from a significant amount of in-band dispersion. Results concerning the compensation of the in-band dispersion of a typical 100-GHz FBG using two thin-film all-pass filters, each composed of two coupled-cavities packaged in a compact configuration, are presented. The total peak insertion loss of the compensation package is less than 2.5 dB.     

Magnetic properties of Co- and Mn-implanted BaTiO3, SrTiO3 and KTaO3

Implantation of Co or Mn into single-crystal BaTiO₃(K), SrTiO₃ or KTaO₃(Ca), followed by annealing at 700 °C, produced ferromagnetic behavior over a broad range of transition metal concentrations. For BaTiO₃, both Co and Mn implantation produced magnetic ordering temperatures near 300 K with coercivities 70 Oe. The M–T plots showed either a near-linear decrease of magnetization with increasing temperature for Co and a non-Brillouin shaped curve for Mn. No secondary phases were detected by high-resolution X-ray diffraction. The same basic trends were observed for both SrTiO₃ and KTaO₃, with the exception that at high Mn concentrations (5 at.%) the SrTiO₃ was no longer ferromagnetic. Our results are consistent with recent reports of room temperature ferromagnetism in other perovskite systems (e.g. LaBaMnO₃) and theoretical predictions for transition metal doping of BaTiO₃ [Nakayama et al., Jap. J. Appl. Phys. 40 (2001) L1355].