Cost Effective VLSI Architectures for Full-Search Block-Matching Motion Estimation Algorithm

In this paper, we present efficient VLSI architectures for full-search block-matching motion estimation (BMME) algorithm. Given a search range, we partition it into sub-search arrays called tiles. By fully exploiting data dependency within a tile, efficient VLSI architectures can be obtained. Using the proposed VLSI architectures, all the block-matchings in a tile can be processed in parallel. All the tiles within a search range can be processed serially or concurrently depending on various requirements. With the consideration of processing speed, hardware cost, and I/O bandwidth, the optimal tile size for a specific video application is analyzed. By partitioning a search range into tiles with appropriate size, flexible VLSI designs with different throughput can be obtained. In this way, cost effective VLSI designs for a wide range of video applications, from H.261 to HDTV, can be achieved.     

Distribution of recombination currents in the space charge regionof heterostructure bipolar devices

This paper addresses the problem of the space charge region Shockley-Read-Hall (SRH) recombination currents in heterojunctions with one noncrystalline side. A formulation which generalizes previous works is discussed. The approach is based on the drift-diffusion model with a thermionic-field emission boundary condition. The main physical parameters which determine the relative contribution of each zone of the space charge region (SCR) to the total recombination current are identified. The general analysis is applied for the first time to amorphous/crystalline heterojunctions and design criteria are established to minimize the total recombination current     

Surveillance after colorectal cancer surgery

Early diagnosis of local and distant recurrences of colorectal cancer remains difficult and there is no agreement on the effectiveness of follow-up in these patients. The aim of this study is to assess the value of our method of follow-up. We consider 239 patients with colorectal cancer and at least 2 years follow-up following radical resection. A local recurrence appeared in 26 patients (10.9%), a distant metastasis in 41 (17.1%), while in seven (2.9%) local and distant recurrences appeared simultaneously. Local recurrence was detected because of an increase in carcinoembryonic antigen (CEA) level in 15 patients (57.7%), during a scheduled endoscopy in four (15.4%) and because of symptoms in seven (26.9%). In seven patients (26.9%) a radical resection was possible. Distant metastases were detected by CEA levels in 20 patients (48.8%), by ultrasonography (U.S.) in 12 (29.3%) and by chest X-ray in five (12.2%). In 13 of 26 patients with liver metastases a resection was performed. This study shows that few patients benefit from follow-up and only CEA levels and liver U.S. performed intensively between 15 and 36 months after surgery are useful in early detection of recurrences. A modification of the follow-up to the single patient, according to the stage, location and grading of cancer, could improve the results, so lowering the costs of this expensive practice.     

Distributed memory systems for simulating artificial neural networks

In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number [O(10¹¹)] of neurons which are interconnected by a dense interconnection network [O(10⁵) connections per neuron]. Artificial neural network (ANN) paradigms adopt the structure of the brain to try to emulate the intelligent information processing methods of the brain. ANN techniques are being employed to solve problems in areas such as pattern recognition, and robotic processing. Simulation of ANNs involves implementation of large number of neurons and a massive interconnection network. In this paper, we discuss various simulation models of ANNs and their implementation on distributed memory systems. Our investigations reveal that communication-efficient networks of distributed memory systems perform better than other topologies in implementing ANNs.     

Method for error recovery of line spectral frequencies

The authors have exploited the ideas used in vector quantisation for error recovery of scalar quantised LSFs. The good performance of this method has provided high resistance of the LSFs to channel errors, outperforming other schemes by, possibly, a considerable margin. Better objective and subjective performances were obtained with this new method which obviates the need for more powerful FEC schemes for transmission over noisy channels.<>     

A novel electrochemical process for the production of ammonium perchlorate

Perchloric acid, HCLO₄, and ammonium perchlorate, NH₄ClO₄, of high purity have been produced by electrolysis of chloric acid and subsequent reaction with high purity ammonium hydroxide to produce ammonium perchlorate. The process involves no alkali metals, chlorides or transition metals such as chromates, and thus produces propellant and explosive grade ammonium perchlorate of high purity and with no associated instability or pollution problems. The products can be recovered by solution crystallization-drying or direct spray-drying, respectively.     

Deterministic and stochastic Petri net models of protection schemes

The authors establish the relevance of Petri net modeling to protection studies. They illustrate how the different Petri net models capture the information that is of importance to both qualitative and quantitative evaluation of protection schemes. The marked Petri nets allow one to evaluate the qualitative performance measures of conservativeness, safeness, and properness. Time Petri nets are able to represent the timing parameters of protection schemes, and serve as a tool for the establishment of relationships between these parameters, in order that the coordination between primary and backup protection is ensured. An alternative means of representing timing information is the timed Petri net, which is useful in the computation of the cycle times of the operational cycles of protection schemes. Stochastic Petri nets adequately represent the stochastic nature of protection. Their advantage over simulation techniques as a means of computing the mean sojourn time and the steady-state probability of occupancy of each state of the protection scheme is demonstrated