*********************

Marius GOOSEN, Saurabh SINHA, Alexandru MÜLLER
A Low Switching Time BiCMOS CML Transmitter for High Speed Adaptive Pre-Emphasis Serial Links
pp. 101–111

Abstract. Due to the advances in multimedia applications in recent years, the requirement for high user end bandwidth has increased significantly. The increase in data rates cause jitter requirements to become even more stringent. An adaptive finite impulse response (FIR) filter is proposed to compensate for the non-ideal channel causing data dependant jitter (DDJ), hence improving signal integrity. This paper proposes a current mode logic (CML) based transmitter which incorporates BiCMOS logic, to reduce the rise/fall times of the high speed transmitter. Simulation results of the BiCMOS CML transmitter is presented showing a 30 % improvement in rise/fall times under high current and high output load conditions. Read the pdf

 

 

 

 

 

 

 

 

 

 

 

*********************

Radu Adrian COJAN, Cristian MURTAZA
A Matching Network Free Approach in Designing Inductorless Low Noise Amplifiers with Programmable Gain for FM-Radio Receivers
pp. 112–122

Abstract. In this paper an approach in designing Low Noise Amplifiers suitable for usage in FM-Radio receivers without a matching network is presented. The LNA presented in this paper is implemented in a standard 60 nm RF process. The matching network-free approach is meant to minimize the overall PCB cost of the FM Radio Receiver. In order to eliminate the matching network the input impedance of the LNA is designed to be in accordance with the antenna impedance. The presented LNA has a total gain of 27 dB, programmable in 1 dB-step, in the FM-Radio bandwidth. The noise figure of the LNA is 2 dB, its P1dB is –27 dBm and the current consumption is 3mA. Read the pdf.

 

 

 

 

 

 

 

 

 

 

 

*********************

Vijay SHARMA, V. K. SAXENA, K. B. SHARMA, Deepak BHATNAGAR
Radiation Performance of an Elliptical Patch Antenna with Three Orthogonal Sector Slots
pp. 123–130

Abstract.In this paper, we present two complexity metrics for the assessment of schema quality written in Document Type Definition (DTD) language. Both “Entropy (E) metric: E(DTD)” and “Distinct Structured Element Repetition Scale (DSERS) metric: DSERS(DTD)” are intended to measure the structural complexity of schemas in DTD language. These metrics exploit a directed graph representation of schema document and consider the complexity of schema due to its similar structured elements and the occurrences of these elements. The empirical and theoretical validations of these metrics prove the robustness of the metrics. Read the pdf

 

 

 

 

 

 

 

 

 

 

 

*********************

Mihai Daniel ILIE, Cristian NEGRESCU, Dumitru STANOMIR
Circular Interpolation for Morphing 3D Facial Animations
pp. 131–148

 

Abstract. The paper presents design and radiation performance of an elliptical patch antenna with three orthogonal sector slots and its performance is compared with that of a conventional elliptical microstrip patch antenna (EMPA) operating under similar test conditions. The proposed elliptical microstrip patch antenna has two sector slots along the major axes aligned opposite to each other and a sector slot orthogonal to these two slots and aligned along the minor axis. The location and dimensions of these sector slots are optimized to obtain improved bandwidth close to 10.96% which is nearly four times higher than that of a conventional EMPA tested under identical test conditions. The gain of antenna is marginally improved still it needs further improvement. The measured E and H plane co and cross polar patterns of modified antenna are also present for better understanding. The modified antenna meets the bandwidth requirements for the IEEE 802.11 a5 wireless local area network (WLAN) applications. . Read the pdf

 

 

 

 

 

 

 

 

 

 

 

*********************

Radu RĂDESCU
LIPT-Derived Transform Methods Used in Lossless Compression of Text Files
pp. 149–158

Abstract. In this paper, we present a novel shape interpolation method that gives very good results for mesh morphing 3D facial animations. Our method interpolates vertices using circle arcs, thus generating, in a preprocessing algorithm, a specific circle center in 3D cartesian space for each pair of vertices. The arc is more or less accentuated, depending on the coordinates which the algorithm chooses for the circle center. These are calculated depending on the relation between the two vertex normals that correspond to the initial vertex and target vertex, and thereby a novel vertex normal weighting method is presented. The efficiency of our algorithm was tested on several facial animation examples with most dissimilar geometries and with very different features, and the results verify the fact that our method gives undoubtedly better results than linear interpolation does, avoiding the undesired and unnatural shrinkage problem which occurs in the latter case. Moreover, our method strikes significantly better computational costs as compared to other non-linear shape interpolation methods developed so far, which is a major advantage. Read the pdf

 

 

 

 

 

 

 

 

 

 

 

*********************

Virginia NICULESCU
PARES – A Model for Parallel Recursive Programs
pp. 159–182

Abstract. PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories we define a model of parallel computation with a very high level of abstraction – PARES (Parallel Recursive Structures). A model of parallel computation, to be useful must address the following set of requirements: abstractness, software development methodology, architecture independence, cost measures, no preferred scale of granularity, efficiently implementable. We show in this paper that all these requirements are fulfilled for the proposed model. Read the pdf

 

 

 

 

 

 

 

*********************

Ionuţ DINCĂ
Computing Partial Recursive Functions by Deterministic Symport/Antiport P-Systems
pp. 183–199

Abstract. In this paper, we prove that deterministic 1-membrane systems with symport/antiport rules are Turing-complete. Our proof is based on the notion of numerical partial recursive function computed by numerical programs of a language with simple instructions, defined by Martin Davis and Elaine Weyuker [10]. We reduced the task from partial recursive functions to numerical programs and then to symport/antiport P systems. Read the pdf