Saroj Kaushik

Bio: Saroj Kaushik is an academic researcher from Indian Institute of Technology Delhi. The author has contributed to research in topics: Residue number system & Modular design. The author has an hindex of 2, co-authored 6 publications receiving 11 citations. Previous affiliations of Saroj Kaushik include Indian Institutes of Technology & Shiv Nadar University.

Information Extraction from Hindi Texts

Abstract: The paper presents an information extraction system that takes input from Hindi texts and improves the information content retrieved by using anaphor/pronoun resolution mechanism The information extraction system developed consists of three major modules: The language Parser, Resolution System and Information Extractor The language parser used is HPSG (Head-Driven Phrase Structure Grammar) based that provides both syntactic and semantic information to the anaphor resolution system HPSG was chosen because it provides a set of constraint on the co-referential structures in the language, which bounds the search for an antecedent to a more precise location in the discourse The semantic information included in its parsing may be helpful for removing ambiguity in anaphor/pronoun resolution The anaphor resolution system uses few heuristic rules to resolve intrasentential references while centering theory is used for intersentential resolution

Sign detection in Non-Redundant Residue Number System with reduced information

Abstract: A necessary and sufficient condition for sign detection in Non-Redundant Residue Number System by reducing the information of a residue digit has been obtained. The function to reduce the information of a residue digit x p corresponding to a modulus m p has been assumed to be periodic with the period length equation, where equation and equation. A sequential method for determining the sign of a number is shown to demonstrate the applicability of the results thus proved.

A new Euclidean division algorithm for residue number systems

Abstract: We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large moduli, with the aim of manipulating very large integers on a parallel computer or a special-purpose architecture. The two basic features of our algorithm are on one hand the use of a high-radix division method, and on the other hand the use of a floating-point arithmetic that should run in parallel with the modular arithmetic.

Multiple error correction and additive overflow detection with magnitude indices in residue code

Abstract: A new approach for correcting multiple errors and detecting an additive overflow in the Residue Number System (RNS) is suggested. It works with the code whose redundancy is in the form of magnitude indices. The residue representation of a number with magnitude index is reconsidered. The RNS with magnitude index were first studied by Sasaki16 and Rao15 and then by Barsi and Maestrini5, 6. The range of a given RNS is divided into intervals of equal width and the magnitude of a number X is defined as a integer locating X into one of such intervals. We have proposed algorithm which detects and corrects multiple errors in residue number. The algorithms for special cases viz., single burst residue error and single residue error are also suggested. Some of the advantages are pointed out over the existing approaches.