Total Factor Productivity Growth and Output Growth in Indian Electronics Industry in the Liberalization Era: An Empirical Examination

This paper analyses the efficiency and productivity growth of Electronics industry, which is considered one of the vibrant and rapidly growing manufacturing industry sub-sectors of India in the liberalization era since 1991. The main objective of the paper is to examine the extent and growth of Total Factor Productivity (TFP) and its components namely, Technical Efficiency Change (TEC) and Technological Progress (TP) and its contribution to total output growth. In this study, the electronics industry is broadly classified into communication equipments, computer hardware, consumer electronics and other electronics, with the purpose of performing a comparative analysis of productivity growth for each of these sub-sectors for the time period 1993-2004. The paper found that the sub-sectors have improved in terms of economies of scale and contribution of capital.The change in technical efficiency and technological progress moved in reverse directions. Three of the four industry witnessed growth in the output primarily due to TFPG and the contribution of input growth to output growth had been negative/negligible, except for Computer hardware where contribution from both input growth and TFPG to output growth were prominent. The paper explored the possible reasons that addressed the issue of low technical efficiency and technological progress in the industry.

VLSI Implementation of Spatial prediction Based Image Compression Scheme

We propose the design and implementation of hardware architecture for spatial prediction based image compression scheme, which consists of prediction phase and quantization phase. In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates an error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. The software model is tested for its performance in terms of entropy, standard deviation. The memory and silicon area constraints play a vital role in the realization of the hardware for hand-held devices. The hardware architecture is constructed for the proposed scheme, which involves the aspects of parallelism in instructions and data. The processor consists of pipelined functional units to obtain the maximum throughput and higher speed of operation. The hardware model is analyzed for performance in terms throughput, speed and power. The results of hardware model indicate that the proposed architecture is suitable for power constrained implementations with higher data rate

Compiler Assisted Leakage Energy Optimization for Clustered VLIW Architectures

Miniaturization of devices and the ensuing decrease in the threshold voltage has led to a substantial increase in the leakage component of the total processor energy consumption. Relatively simpler issue logic and the presence of a large number of function units in the VLIW and the clustered VLIW architectures attribute a large fraction of this leakage energy consumption in the functional units. However, functional units are not fully utilized in the VLIW architectures because of the inherent variations in the ILP of the programs. This underutilization is even more pronounced in the context of clustered VLIW architectures because of the contentions for the limited number of slow intercluster communication channels which lead to many short idle cycles.In the past, some architectural schemes have been proposed to obtain leakage energy bene .ts by aggressively exploiting the idleness of functional units. However, presence of many short idle cycles cause frequent transitions from the active mode to the sleep mode and vice-versa and adversely a ffects the energy benefits of a purely hardware based scheme. In this paper, we propose and evaluate a compiler instruction scheduling algorithm that assist such a hardware based scheme in the context of VLIW and clustered VLIW architectures. The proposed scheme exploits the scheduling slacks of instructions to orchestrate the functional unit mapping with the objective of reducing the number of transitions in functional units thereby keeping them off for a longer duration. The proposed compiler-assisted scheme obtains a further 12% reduction of energy consumption of functional units with negligible performance degradation over a hardware-only scheme for a VLIW architecture. The benefits are 15% and 17% in the context of a 2-clustered and a 4-clustered VLIW architecture respectively. Our test bed uses the Trimaran compiler infrastructure.

Design of a constrained high data rate CDMA system

This paper deals with the design of a high data rate code-division multiple-access (CDMA) system under a speci¯ed jamming mar- gin speci¯cation as well as hardware and band-width limitations. Several choices had to be made in coming up with the design such as specify-ing the number of subcarriers, choice of spread-ing codes and the nature of the modulation.The rationale behind each of the choices made is given. Descriptions of transmitter and receiver are also included. Relevant simulations of cross-correlation are also provided.

A Profilometric Approach to 3D Face Reconstruction and Its Application to Face Recognition

3D Face Recognition is an active area of research for past several years. For a 3D face recognition system one would like to have an accurate as well as low cost setup for constructing 3D face model. In this paper, we use Profilometry approach to obtain a 3D face model.This method gives a low cost solution to the problem of acquiring 3D data and the 3D face models generated by this method are sufficiently accurate. We also develop an algorithm that can use the 3D face model generated by the above method for the recognition purpose.

Symmetry in Scalar Field Topology

Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction.

Speed and Area Optimized Implementation of H.264 8X8 DCT Transform and Quantizer

H.264 is a video codec standard which delivers high resolution video even at low bit rates. To provide high throughput at low bit rates hardware implementations are essential. In this paper, we propose hardware implementations for speed and area optimized DCT and quantizer modules. To target above criteria we propose two architectures. First architecture is speed optimized which gives a high throughput and can meet requirements of 4096x2304 frame at 30 frames/sec. Second architecture is area optimized and occupies 2009 LUTs in Altera’s stratix-II and can meet the requirements of 1080HD at 30 frames/sec.

Output-Sensitive Construction of Reeb Graphs

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications-surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.

Parallel Computation of 2D Morse-Smale Complexes

The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh elements of the domain in parallel to compute the Morse-Smale complex of large two-dimensional data sets at interactive speeds. We employ a reformulation of the Morse-Smale complex using Forman's Discrete Morse Theory and achieve scalability by computing the discrete gradient using local accesses only. We also introduce a novel approach to merge gradient paths that ensures accurate geometry of the computed complex. We demonstrate that our algorithm performs well on both multicore environments and on massively parallel architectures such as the GPU.

Accelerating Numerical Linear Algebra Kernels on a Scalable Run Time Reconfigurable Platform

Numerical Linear Algebra (NLA) kernels are at the heart of all computational problems. These kernels require hardware acceleration for increased throughput. NLA Solvers for dense and sparse matrices differ in the way the matrices are stored and operated upon although they exhibit similar computational properties. While ASIC solutions for NLA Solvers can deliver high performance, they are not scalable, and hence are not commercially viable. In this paper, we show how NLA kernels can be accelerated on REDEFINE, a scalable runtime reconfigurable hardware platform. Compared to a software implementation, Direct Solver (Modified Faddeev's algorithm) on REDEFINE shows a 29X improvement on an average and Iterative Solver (Conjugate Gradient algorithm) shows a 15-20% improvement. We further show that solution on REDEFINE is scalable over larger problem sizes without any notable degradation in performance.

Design space exploration of systolic realization of QR factorization on a runtime reconfigurable platform

In the world of high performance computing huge efforts have been put to accelerate Numerical Linear Algebra (NLA) kernels like QR Decomposition (QRD) with the added advantage of reconfigurability and scalability. While popular custom hardware solution in form of systolic arrays can deliver high performance, they are not scalable, and hence not commercially viable. In this paper, we show how systolic solutions of QRD can be realized efficiently on REDEFINE, a scalable runtime reconfigurable hardware platform. We propose various enhancements to REDEFINE to meet the custom need of accelerating NLA kernels. We further do the design space exploration of the proposed solution for any arbitrary application of size n × n. We determine the right size of the sub-array in accordance with the optimal pipeline depth of the core execution units and the number of such units to be used per sub-array.

Phenylboronic acids in crystal engineering: Utility of the energetically unfavorable syn,syn-conformation in co-crystal design

Phenylboronic acids can exist, in principle, in three different conformers (syn,syn; syn,anti and anti,anti) with distinct energy profiles. In their native state, these compounds prefer the energetically favored syn, anti-conformation. In molecular complexes, however, the functionality exhibits conformational diversity. In this paper we report a series of co-crystals, with N-donor compounds, prepared by a design strategy involving the synthons based on the syn, syn-conformation of the boronic acid functionality. For this purpose, we employed compounds with the 1,2-diazo fragment (alprazolam, 1H-tetrazole, acetazolamide and benzotriazole), 1,10-phenanthroline and 2,2'-bipyridine for the co-crystallization experiments. However, our study shows that the mere presence of the 1,2-diazo fragment in the coformer does not guarantee the successful formation of co-crystals with a syn, syn-conformation of the boronic acid. [GRAPHICS] The -B(OH)(2) fragment makes unsymmetrical O-H center dot center dot center dot N heterosynthons with alprazolam (ALP) and 1,10-phenanthroline (PHEN). In the co-crystals of phenylboronic acids with 1H-tetrazole (TETR) and 2,2'-bipyridine (BPY), the symmetrical boronic acid dimer is the major synthon. In the BPY complex, boronic acid forms linear chains and the pyridine compound interacts with the lateral OH of boronic acid dimers that acts as a connector, thus forming a ladder structure. In the TETR complex, each heterocycle interacts with three boronic acids. While two boronic acids interact using the phenolic group, the third molecule generates O-H center dot center dot center dot N hydrogen bonds using the extra OH group, of -B(OH)(2) fragment, left after the dimer formation. Thus, although molecules were selected retrosynthetically with the 1,2-diazo fragment or with nearby hetero-atoms to induce co-crystal formation using the syn,syn-orientation of the -B(OH)(2) functionality, co-crystal formation is in fact selective and is probably driven by energy factors. Acetazolamide (ACET) contains self-complementary functional groups and hence creates stable homosynthons. Phenylboronic acids being weak competitors fail to perturb the homosynthons and hence the components crystallize separately. Therefore, besides the availability of possible hydrogen bond acceptors in the required position and orientation, the ability of the phenyl-boronic acid to perturb the existing interactions is also a prerequisite to form co-crystals. This is illustrated in the table below. In the case of ALP, PHEN and BPY, the native structures are stabilized by weak interactions and may be influenced by the boronic acid fragment. Thus phenylboronic acids can attain co-crystals with those compounds, wherein the cyclic O-H center dot center dot center dot N hydrogen bonds are stronger than the individual homo-interactions. This can lower the lattice energy of the molecular complex as compared with the individual crystals. [GRAPHICS] Phenylboronic acids show some selectivity in the formation of co-crystals with N-heterocycles. The differences in solubility of the components fall short to provide a possible reason for the selective formation of co-crystals only with certain compounds. These compounds, being weak acids, do not follow the Delta pK(a) analysis and hence fail to provide any conclusive observation. Theoretical results show that of the three conformers possible, the syn,anti conformer is the most stable. The relative stabilities of the three conformers syn,anti,syn,syn and anti,anti are 0.0, 2.18 and 3.14 kcal/mol, respectively. The theoretical calculations corroborate the fact that only energetically favorable synthons can induce the formation of heterosynthons, as in ALP and PHEN complexes. From a theoretical and structural analysis it is seen that phenylboronic acids will form interactions with those molecules wherein the heterocyclic and acidic fragments can interrupt the homosynthons. However, the energy profile is shallow and can be perturbed easily by the presence of competing functional groups (such as OH and COOH) in the vicinity. [GRAPHICS] .

Relaxation: Application to the matrix reconstruction problem

This report describes some preliminary experiments on the use of the relaxation technique for the reconstruction of the elements of a matrix given their various directional sums (or projections).

A simple and fast scheme for code compression for VLIW processors

Summary form only given. A scheme for code compression that has a fast decompression algorithm, which can be implemented using simple hardware, is proposed. The effectiveness of the scheme on the TMS320C62x architecture that includes the overheads of a line address table (LAT) is evaluated and obtained compression rates ranging from 70% to 80%. Two schemes for decompression are proposed. The basic idea underlying the scheme is a simple clustering algorithm that partially maps a block of instructions into a set of clusters. The clustering algorithm is a greedy algorithm based on the frequency of occurrence of various instructions.

Object Tracking Using Motion Direction Detection

We present an algorithm for tracking objects in a video sequence, based on a novel approach for motion detection. We do not estimate the velocity �eld. In-stead we detect only the direction of motion at edge points and thus isolate sets of points which are moving coherently. We use a Hausdor� distance based matching algorithm to match point sets in local neighborhood and thus track objects in a video sequence. We show through some examples the e�ectiveness of the algo- rithm.