Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Karthick Parashar

dblp:47/6313 · also Karthick Nagaraj Parashar · DBLP profile ↗
← Back
10ranked-venue papers
5as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 8 · 4 first-authorSoftware engineering, systems software and programming languages · 2Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless sensing and localization · 46% Physical-layer communications · 30% Wireless networking · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 77% Performance modeling and evaluation · 23%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless sensing and localization › radar sensing
doppler radar
0.412019
Doppler Radar with In-Band Full Duplex Radios · INFOCOM 2019
Wireless networking › wireless link › full-duplex wireless
in-band full-duplex
0.412019
Doppler Radar with In-Band Full Duplex Radios · INFOCOM 2019
Wireless sensing and localization
radar sensing
0.412019
Doppler Radar with In-Band Full Duplex Radios · INFOCOM 2019
Physical-layer communications › interference cancellation
self-interference cancellation
0.412019
Doppler Radar with In-Band Full Duplex Radios · INFOCOM 2019
Electronic design automation
high-level synthesis
0.212014
Accelerated Performance Evaluation of Fixed-Point Systems With Un-Smooth Operations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2014
Physical-layer communications › receiver design
RF front-end
0.112019
Doppler Radar with In-Band Full Duplex Radios · INFOCOM 2019
Performance modeling and evaluation › simulation › architectural simulation
simulation acceleration
0.112014
Accelerated Performance Evaluation of Fixed-Point Systems With Un-Smooth Operations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2014

Methods — techniques the papers use, named apart from their topics

software-defined radio · 0.4performance analysis · 0.4perturbation theory · 0.2hybrid analytical-simulation technique · 0.2
YearPublicationVenuePosition
2020 A Retargetable MATLAB-to-C Compiler Exploiting Custom Instructions and Data Parallelism
abstract
This article presents a MATLAB-to-C compiler that exploits custom instructions present in state-of-the-art processor architectures and supports semi-automatic vectorization. A parameterized processor model is used to describe the target instruction set architecture to achieve user-friendly retargetability. Custom instructions are represented via specialized intrinsic functions in the generated code, which can then be used as input to any C/C++ compiler supporting the target processor. In addition, the compiler supports the generation of data parallel/vectorized code through the introduction of data packing/unpacking statements. The compiler has been used for code generation targeting ARM and x86 architectures for several benchmarks. The vectorized code generated by the compiler achieves an average speedup of 4.1× and 2.7× for packed fixed and floating point data, respectively, compared to scalarized code for ARM architecture and an average speedup of 3.1× and 1.5× for packed fixed and floating point data, respectively, for x86 architecture. Implementing data parallel instructions directly in the assembly code would have required a lot of design effort, and it would not been sustainable across evolving platform variants. Thus, the compiler can be employed to efficiently speed up critical sections of the target application. The compiler is therefore potentially employable to raise the design abstraction and reduce development time for both embedded and general-purpose applications.
Ioannis Latifis, Karthick Parashar, Grigoris Dimitroulakos, Hans Cappelle, Christakis Lezos, Kostas Masselos, Francky Catthoor
ACM Trans. Embed. Comput. Syst.2
2019 Doppler Radar with In-Band Full Duplex Radios
abstract
The use of in-band full duplex (IBFD) is a promising improvement over classical TDD or FDD communication schemes. To enable IBFD radios, the electrical balance duplexer (EBD) has been proposed to suppress the direct self-interference (SI) at the RF stage. The remaining SI is typically assumed to be canceled further in the digital domain. In this paper, we show that the non-zero Doppler frequencies can be extracted from the residual SI, giving information about the speed of objects in the environment. As a result, an IBFD radio can be seen as a monostatic Doppler radar which is affected by the communication signal. This paper presents a detailed performance analysis of the different sources of interference affecting the Doppler radar. The performance is also evaluated using a radar-enhanced IBFD prototype consisting of a SDR module and an EBD designed to achieve up to 55 dB Tx-Rx isolation in the 1.74 GHz RF band. A measurable Doppler component is created by moving a 15 dBsm cone at known velocities at 0. 5-1.3 m from the prototype. For an EBD SI rejection of 45 dB, speeds in the range of 200 to 800 mm/s are detected with high accuracy.
Seyed Ali Hassani, Karthick Parashar, André Bourdoux, Barend van Liempd, Sofie Pollin
INFOCOM2
2017 A MATLAB Vectorizing Compiler Targeting Application-Specific Instruction Set Processors
abstract
This article discusses a MATLAB-to-C vectorizing compiler that exploits custom instructions, for example, for Single Instruction Multiple Data (SIMD) processing and instructions for complex arithmetic present in Application-Specific Instruction Set Processors (ASIPs). Custom instructions are represented via specialized intrinsic functions in the generated code, and the generated code can be used as input to any C/C++ compiler supporting the target processor. Furthermore, the specialized instruction set of the target processor is described in a parameterized way using a target processor-independent architecture description approach, thus allowing the support of any processor. The compiler has been used for the generation of application code for two different ASIPs for several benchmarks. The code generated by the compiler achieves a speedup between 2× --74× and 2× --97× compared to the code generated by the MathWorks MATLAB-to-C compiler. Experimental results also prove that the compiler efficiently exploits SIMD custom instructions achieving a 3.3 factor speedup compared to cases where no SIMD processing is used. Thus the compiler can be employed to reduce the development time/effort/cost and time to market through raising the abstraction of application design in an embedded systems/system-on-chip development context.
Ioannis Latifis, Karthick Parashar, Grigoris Dimitroulakos, Hans Cappelle, Christakis Lezos, Kostas Masselos, Francky Catthoor
ACM Trans. Design Autom. Electr. Syst.2
2016 Leveraging power spectral density for scalable system-level accuracy evaluation
Benjamin Barrois, Karthick Parashar, Olivier Sentieys
DATE2
2016 Matlab to C compilation targeting Application Specific Instruction Set Processors
Ioannis Latifis, Karthick Parashar, Grigoris Dimitroulakos, Hans Cappelle, Christakis Lezos, Kostas Masselos, Francky Catthoor
DATE2
2014 Accelerated Performance Evaluation of Fixed-Point Systems With Un-Smooth Operations
abstract
The problem of accuracy evaluation is one of the most time consuming tasks during the fixed-point refinement process. Analytical techniques based on perturbation theory have been proposed in order to overcome the need for long fixed-point simulation. However, these techniques are not applicable in the presence of certain operations classified as un-smooth operations. In such circumstances, fixed-point simulation should be used. In this paper, an algorithm detailing the hybrid technique which makes use of an analytical accuracy evaluation technique used to accelerate fixed-point simulation is presented. This technique is applicable to signal processing systems with both feed-forward and feedback interconnect topology between its operations. The acceleration obtained as a result of applications of the proposed technique is consistent with fixed-point simulation, while reducing the time taken for fixed-point simulation by several orders of magnitude.
Karthick Parashar, Daniel Ménard, Olivier Sentieys
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2013 A polynomial time algorithm for solving the word-length optimization problem
abstract
Trading off accuracy to the system costs is popularly addressed as the word-length optimization (WLO) problem. Owing to its NP-hard nature, this problem is solved using combinatorial heuristics. In this paper, a novel approach is taken by relaxing the integer constraints on the optimization variables and obtain an alternate noise-budgeting problem. This approach uses the quantization noise power introduced into the system due to fixed-point word-lengths as optimization variables instead of using the actual integer valued fixed-point word-lengths. The noise-budgeting problem is proved to be convex in the rounding mode quantization case and can therefore be solved using analytical convex optimization solvers. An algorithm with linear time complexity is provided in order to realize the actual fixed-point word-lengths from the noise budgets obtained by solving the convex noise-budgeting problem.
Karthick Parashar, Daniel Ménard, Olivier Sentieys
ICCAD1
2010 Analytical approach for analyzing quantization noise effects on decision operators
abstract
The presence of decision operators has proved to be a serious impediment for a fully analytical noise power estimation technique. This paper proposes a generalized decision operator which can potentially capture the behavior of all possible types of decision operators and provides a fully analytical technique to handle them while performing quantization noise power estimation. The proposed method is applied to BPSK and 16-QAM decision operators. The total error rate and the PDF of the error signal are found to follow the simulation to a great degree of accuracy.
Karthick Parashar, Romuald Rocher, Daniel Ménard, Olivier Sentieys
ICASSP1
2010 Fast performance evaluation of fixed-point systems with un-smooth operators
abstract
Fixed-point refinement of signal processing systems is an essential step performed before implementation of any signal processing system. Existing analytical techniques to evaluate performance of fixed-point systems are not applicable to the errors due to quantization in the presence of un-smooth operators. Thus, it is inevitable to use simulation to evaluate performance of fixed-point systems in the presence un-smooth operators. This paper proposes a hybrid technique which can be used in place of pure simulation to accelerate the performance evaluation. The principle idea in the proposed hybrid approach is to selectively simulate parts of the system only when un-smooth errors occur but use analytical results otherwise. The acceleration thus obtained reduces the performance evaluation time which can be used to explore a wider word-length design space or speedup the optimization process. This method has been tried on a complex MIMO sphere decoding algorithm and the results obtained show several orders of magnitude improvement in terms of evaluation time.
Karthick Parashar, Daniel Ménard, Romuald Rocher, Olivier Sentieys, David Novo, Francky Catthoor
ICCAD1
2007 A Novel Event Based Simulation Algorithm for Sequential Digital Circuit Simulation
abstract
An algorithm and architecture for a hardware based simulation accelerator is presented. The accelerator can perform full timing simulation of synchronous digital circuits described at the gate level. The simulator makes use of a cycle based processor core in conjunction with event queues to execute the simulation. By ensuring that the gates are evaluated in rank order, the problem of sorting event queues is avoided. Static scheduling of the gates at compile time allows a simple control structure for the run time. The simple architecture allows large processing arrays to be implemented on relatively simple hardware. Results on ISCAS89 benchmark circuits are presented to demonstrate the scalability with hardware resources.
Karthick Parashar, Nitin Chandrachoodan
FPL1