Image shrinking and expanding on a pyramid

Develops two algorithms to perform the q step shrinking and expanding of an N×N binary image on a pyramid computer with an N×N base. The time complexity of both algorithms is O(√q). However, one uses O(√q) space per processor, while the per-processor space requirement of the other is O(1)     

Control strategies for flexible operation of power plant with CO2 capture plant

About 20% power output penalties will be incurred for implementing CO₂ capture from power plant. This loss can be partially compensated by flexible operation of capture plant. However, daily large variations of liquid and gas flows may cause operation problems to packed columns. Control schemes were proposed to improve the flexibility of power output without causing substantial hydraulic disturbances in capture plant is presented. Simulations were implemented using ASPEN Plus. In varying lean solvent flow strategy, the flow rate of recycling solvent was manipulated to control the CO₂ capture rate. The liquid flow of the absorber and gas flow of the stripper will vary substantially. In an alternative strategy, the lean solvent loading will be varied. Variation of gas throughput in the stripper is avoided by recycling part of CO₂ vapor to stripper. This strategy provided more stable hydraulics condition in both columns and is recommended for flexible operation. © 2011 American Institute of Chemical Engineers AIChE J, 2012     

Waveform estimation with jitter noise using stochastic up and downmethod

Jitter noise exists, especially, when sampling high-frequency waveforms. This paper aims to address this problem through a stochastic method. By studying the stochastic up and down method in detail, we propose a “ratio indicator”, which can supplement the basic stochastic up and down method. Simulation results show that the proposed method gives good estimates with known error bounds     

Sinewave parameter estimation algorithm with application towaveform digitizer effective bits measurement

The authors present a high-performance (i.e. high-precision and high-speed) algorithm to estimate the four parameters of a sine wave from a sampled data record. The estimation errors are derived in closed form, and hence, controllable. The authors then propose a method to measure a digitizers effective bits based on this algorithm. Simulation results indicate that the proposed method gives excellent estimates of the true resolution of the simulated ideal digitizer. This proposed algorithm is noniterative and gives swift and consistent results     

Robust H∞ Control Problem For General Nonlinear Systems With Uncertainty

In this paper, both state and output feedback robust H^∞ control problems for general nonlinear systems with norm‐bound uncertainty are considered. Sufficient conditions for the existence of robust output feedback H^∞ controller are provided. State space formulas for robust H^∞ output controller are provided.     

Case study: stereo vision experiments with multi-core software API on embedded MPSoC environments

Markov random field models provide a robust formulation of low-level vision problems. Among all these problems, stereo vision remains the most investigated field. The belief propagation (BP) method provides accurate result in stereo vision problems. However, the algorithm remains slow for practical use. This paper describes a case study on the parallelization of belief propagation for stereo matching using the ??Multi-core Software APIs?? (MSA) on embedded MPSoC environments. MSA is a library-based middleware providing an asynchronous remote procedure call (RPC) mechanism. It supplies a function-offloading programming model to hide the underlying interprocessor communication and configuration detail from programmers. Furthermore, MSA provides a set of stream-specific APIs for supporting a streaming-function remoting mechanism on heterogeneous multi-core architectures. Our experiments shows that the BP method for stereo matching can be adapted from a single core program to a multi-core one for embedded MPSoC environments rapidly.     

Achieving spilling-friendly register file assignment for highly distributed register files

Distributed register file architectures divide registers into multiple sets, and it follows that the register files could be small. This can increase the frequency of spilling if register allocation encounters high register pressure, which will reduce the performance. That is, there is extra spilling to handle the pressure and results in performance decline. One of the factors that can produce high pressure is improper register file assignment. Register file assignment is a phase that assigns virtual registers to suitable register files and avoids communication costs. To reduce spilling in the phase of register file assignment, this paper proposes the SPIlling-FRiendly (SPIFR) method, which attempts to improve spilling by estimating the spilling cost from two aspects: assignment and spilling. We used MiBench and EEMBC benchmarks in experiments performed with the Open64-based compiler and a cycle-accurate instruction set simulator. The MiBench experimental results show that the SPIFR method improved the average cycle counts of the benchmarks by 6.0 %. For the kernels of the benchmarks, the method improved the average cycle counts by 20.5 % and reduced the average spilling ratio by 19.0 %. The results on the EEMBC benchmarks indicate that the method improved the cycle counts with the average speedup of 7.0 %, the speedup average of the kernel functions was 11.3 %, and the average reduction in the spilling ratio was 11.7 %, respectively. We conclude that the SPIFR method can reduce spilling and increase the performance.     

Adaptive Path Selection Scheme with Combining for Multiple Relaying Cooperative Communications Networks

In future communications, cooperative communications with relay networks will be one of the most effective schemes to enlarge the coverage area and to boost the data rate. In the recent research results, the path selection, power allocation, and relay protocols on relay networks are the most important factors to improve the system performance. However, the channel quality of the direct transmission path and the relaying path has an influential effect on the performance of relay networks. Therefore, in this paper, we propose a best relaying path selection (BRPS) scheme to obtain the path diversity to improve the system capacity and data rate for cooperative networks (CNs). Simulation results show that the more the relay nodes are selected, the lower the bit error rate (BER) is. The proposed BRPS scheme obtains a high concession between both BER and system capacity for CNs.     

Digital Signal Processing with Interleaved ADC Systems

This paper addresses a problem associated with interleaved ADC systems from the digital signal processing algorithm design perspective. The output streams of an interleaved ADC system are inherently in parallel format. It would be nice if DSP algorithms can be designed to take advantage of the inherently parallel signal streams in the interleaved ADC system without the need of a high speed parallel-to-serial multiplexer. Frequency response of a parallel filter bank is derived. It is found that the overall frequency response is the average of each individual interpolated channel filter plus the aliasing components. The aliasing components come from the deviation of each individual channel from the average response.Results are applied to characterize the gain mismatch of ADC arrays. Sinusoidal response is also investigated. The results can be used to characterize the frequency response mismatch of ADC arrays.Yih-Chyun Jenq received the B.S.E. degree from National Taiwan University, Taipei, Taiwan in 1971, and the M.S.E., M.A., and Ph.D. degrees in Electrical Engineering from Princeton University, Princeton, NJ in 1974, 1975, and 1976, respectively. From 1976 to 1980, he was Assistant Professor of Electrical Engineering at the State University of New York at Stony Brook, Stony Brook, NY. From 1980 to 1984, he was a Member of Technical Staff at AT&T Bell Laboratories, Homdel, NJ. From 1984 to 1990, he was a Research Manager and Principal Engineer at Tektronix Laboratories, Beaverton, OR. In September 1990, he joined the Faculty of the Department of Electrical and Computer Engineering at Portland State University, Portland, OR where he is currently a Full Professor. From 1987 to 1989, Dr. Jenq served as Associate Editor of the IEEE Transactions on Circuits and Systems in charge of Digital Signal Processing. He was the recipient of the 1988 Andrew R. Chi Prize Paper Award of the IEEE Instrumentation and Measurement Society. He holds ten (10) U.S. patents. Dr. Jenq is a fellow of the IEEE.     

A dynamic corridor‐searching algorithm to seek time‐varying instream flow releases for optimal weir operation: comparing three indices of overall hydrologic alteration

A full range of natural flow regime has been widely recognized as a primary driving force for sustaining the integrity of a riverine ecosystem. Existing instream flow methods strive to assure a constant minimum flow but not the natural flow variability. We present in this paper a dynamic corridor‐searching algorithm to seek the optimal time‐varying scheme for instream flow releases. A compromise programming (CP) is employed to search the optimal solution of an objective function aggregating the ecosystem and human needs objectives. The ecosystem need objective is represented by an overall index of hydrologic alteration, which integrates 32 indicators of hydrologic alteration (IHA) derived from the range of variability approach (RVA). The human need objectives are expressed by shortage ratios for the agricultural and municipal water supplies. The proposed method is applied to a weir operation in Taiwan. Three approaches to evaluating the overall degree of hydrologic alteration (i.e., the three‐class, fuzzy‐based, and overall‐mean approaches) are compared here. The results show that the time‐varying schemes improve the human need objective, but only slightly deteriorate the ecosystem need objective. Such advantages increase with the time‐varying frequency. For the wet periods, smaller flow releases may be prescribed; for the dry periods, however, greater releases must be specified to secure a lower degree of overall hydrologic alteration. It is also revealed that use of the three‐class approach to evaluate the overall hydrologic alteration facilitates to eliminate highly altered IHA and maintain those low‐flow characteristics subtle to flow diversions. However, such outcomes are achieved at the cost of greater deficits for human water demands. Copyright © 2007 John Wiley & Sons, Ltd.