Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs

Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interfaces (GUIs) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the dataflow interchange format (DIF) language—a language for specifying DSP-oriented dataflow graphs—with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.     

The Asymmetric Golden Code for Fast Decoding on Time-Varying Channels

The golden code is a full-rate full-diversity space–time code for the two-input two-output channel with good performance but high decoding complexity. The overlaid Alamouti codes were recently proposed as an alternative; in exchange for a slight performance penalty, they have lower decoding complexity on quasistatic channels with QAM alphabets. However, the complexity advantage of the overlaid codes vanishes for time-varying channels. This paper proposes the asymmetric golden code, a novel full-rate and full-diversity space–time code for the two-input two-output channel that offers reduced-complexity decoding on both quasistatic and time-varying channels.     

Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN

Over the last few years, graph partitioning has been recognized as a suitable technique for optimizing cellular network structure. For example, in a recent paper, the authors proposed a classical graph partitioning algorithm to optimize the assignment of cells to Packet Control Units (PCUs) in GSM-EDGE Radio Access Network. Based on this approach, the quality of packet data services in a live environment was increased by reducing the number of cell re-selections between different PCUs. To learn more about the potential of graph partitioning in cellular networks, in this paper, a more sophisticated, yet computationally efficient, partitioning algorithm is proposed for the same problem. The new method combines multi-level refinement and adaptive multi-start techniques with algorithms to ensure the connectivity between cells under the same PCU. Performance assessment is based on an extensive set of graphs constructed with data taken from a live network. During the tests, the new method is compared with classical graph partitioning approaches. Results show that the proposed method outperforms classical approaches in terms of solution quality at the expense of a slight increase in computing time, while providing solutions that are easier to check by the network operator.     

An evaluation of the algorithms for determining local cerebral metabolic rates of glucose using positron emission tomography dynamic data

Measurement of the local cerebral metabolic rate of glucose (LCMRGlc) and the individual rate constant parameters of the [(18 )F]2-fluoro-2-deoxy-D-glucose (FDG) model can provide a clearer understanding and insight to the physiological processes in the human brain, and a quicker and more accurate means of diagnosis in clinical applications. A systematic study using simulated and clinical tissue time activity data is presented to evaluate several existing and newly developed major algorithms used for determining LCMRGlc and the individual rate constants from positron emission tomography dynamic data. The computational and statistical properties of the autoradiographic approach, weighted and unweighted nonlinear least squares methods, Patlak graphic approach, weighted integration method, linear least squares and generalized linear least squares methods are investigated and discussed in this paper.     

注入条件对SIMOX材料的影响

利用ＲＢＳ和ＴＥＭ技术分析研究了不同注入剂量、注入方式（单重注入，多重注入）对ＳＩＭＯＸ材料各层结构的影响，特别着重研究了Ｓｉ／ＳｉＯ２界面过渡区受注入条件的影响。结果表明，在注入剂量相同的情况下，多重注入不仅能改善顶层单晶、ＳｉＯ２绝缘层的质量，而且能显著减小Ｓｉ／ＳｉＯ２界面过渡区宽度。     

Theoretical analysis of whispering-gallery mode ring dielectric resonator

A new type of whispering-gallery mode ring dielectric resonators are first proposed. Theoretical analysis and a method for determination of the resonant frequencies is presented by the mode matching method. The numerical results show good agreement with theoretical analysis.     

Weak inversion charge injection in analog MOS switches

The on-chip test circuit for examining the charge injection in analog MOS switches has been described in detail, and has been fabricated and characterized. Mixed-mode circuit and device simulations have been performed, creating excellent agreements not only with the experimental waveforms but also with the measured switch-induced error voltage. Further investigation of the experimental and simulated results has separated the charge injection into three distinct components: i) the channel charges in strong inversion; ii) the channel charges in weak inversion; and iii) the charges coupled through the gate-to-diffusion overlap capacitance. Important observations concerning the weak inversion charge injection have been drawn from the waveform of the current through the switched capacitor. In this work the channel charges in weak inversion have exhibited a 20% contribution to the switch-induced error voltage on a switched capacitor     

Instruction-Vulnerability-Factor-Based Reliability Analysis Model for Program Memory

Bit faults induced by single-event upsets in instruction may not cause a system to experience an error. The instruction vulnerability factor (IVF) is first defined to quantify the effect of non-effective upsets on program reliability in this paper; and the mean time to failure (MTTF) model of program memory is then derived based on IVF. Further analysis of MTTF model concludes that the MTTF of program memory using error correcting code (ECC) and scrubbing is not always better than unhardened program memory. The constraints that should be met upon utilizing ECC and scrubbing in program memory are presented for the first time, to the best of authors’ knowledge. Additionally, the proposed models and conclusions are validated by Monte Carlo simulations in MATLAB. These results show that the proposed models have a good accuracy and their margin of error is less than 3 % compared with MATLAB simulation results. It should be highlighted that our conclusions may be used to contribute to selecting the optimal fault-tolerant technique to harden the program memory.     

On a Non-linear Electronic Circuit Filtering

The stochastic versions of non-linear dynamic circuits are formalized using non-linear stochastic differential equations. Stochastic differential equations (SDEs) are exploited to analyse dynamical systems in noisy environments. A potential application of the SDEs can be regarded as ‘stochastic processes in electronic circuits’. The noisy sampling mixer, a component of digital wireless communications, is an appealing and standard case from the dynamical systems’ viewpoint. It assumes the structure of a non-linear SDE, and its linearized version becomes time-varying bilinear SDE. This paper derives the filtering equations for the noisy non-linear sampling mixer circuit utilizing the filtering density evolution equation. The filtering model for the stochastic problem of concern here comprises the following: (1) a non-linear SDE describing the noisy sampling mixer and (2) a non-linear noisy observation equation. It is interesting to note that the filtered estimate accounts for observations. On the other hand, the predicted estimate does not account for the observation terms in evolution equations. As a result of this, the filtered estimate confirms the greater accuracy of estimated state trajectory in contrast to the predicted trajectory. The filtering equation of this paper can be further utilized for control of the noisy sampling mixer, where the observations are available.