Výsledky vyhledávání - "Vem, Avinash"

Report

Sionna: An Open-Source Library for Next-Generation Physical Layer Research

Autor: Hoydis, Jakob, Cammerer, Sebastian, Aoudia, Fayçal Ait, Vem, Avinash, Binder, Nikolaus, Marcus, Guillermo, Keller, Alexander

Sionna is a GPU-accelerated open-source library for link-level simulations based on TensorFlow. It enables the rapid prototyping of complex communication system architectures and provides native support for the integration of neural networks. Sionna

Externí odkaz: http://arxiv.org/abs/2203.11854

Zobrazit plný text záznamu

Report

Sparse IDMA: A Joint Graph-Based Coding Scheme for Unsourced Random Access

Autor: Pradhan, Asit, Amalladinne, Vamsi, Vem, Avinash, Narayanan, Krishna R., Chamberland, Jean-Francois

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned into two grou

Externí odkaz: http://arxiv.org/abs/1906.05410

Zobrazit plný text záznamu

Report

A Coupled Compressive Sensing Scheme for Unsourced Multiple Access

Autor: Amalladinne, Vamsi K., Vem, Avinash, Soma, Dileep Kumar, Narayanan, Krishna R., Chamberland, Jean-Francois

This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally efficient al

Externí odkaz: http://arxiv.org/abs/1806.00138

Zobrazit plný text záznamu

Report

Sub-string/Pattern Matching in Sub-linear Time Using a Sparse Fourier Transform Approach

Autor: Janakiraman, Nagaraj T., Vem, Avinash, Narayanan, Krishna R., Chamberland, Jean-Francois

We consider the problem of querying a string (or, a database) of length $N$ bits to determine all the locations where a substring (query) of length $M$ appears either exactly or is within a Hamming distance of $K$ from the query. We assume that sketc

Externí odkaz: http://arxiv.org/abs/1704.07852

Zobrazit plný text záznamu

Report

Group Testing using left-and-right-regular sparse-graph codes

Autor: Vem, Avinash, Janakiraman, Nagaraj T., Narayanan, Krishna R.

We consider the problem of non-adaptive group testing of $N$ items out of which $K$ or less items are known to be defective. We propose a testing scheme based on left-and-right-regular sparse-graph codes and a simple iterative decoder. We show that f

Externí odkaz: http://arxiv.org/abs/1701.07477

Zobrazit plný text záznamu