activity
20172026
most citedSionna: An Open-Source Library for Next-Generation Physical Layer Research

105 citations · 129 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CL2026

Nemotron 3 Ultra: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Model for Agentic Reasoning

NVIDIA, :, Aaron Blakeman +572

We introduce Nemotron 3 Ultra, a 550 billion total and 55 billion active parameter Mixture-of-Experts Hybrid Mamba-Attention language model. We pre-trained Nemotron 3 Ultra on 20 t…

cs.IT2022★ 105 cited

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

Jakob Hoydis, Sebastian Cammerer, Fayçal Ait Aoudia +4

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 p…

cs.IT2019

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

Asit Pradhan, Vamsi Amalladinne, Avinash Vem +2

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as fo…

eess.SP2018★ 14 cited

A Coded Compressed Sensing Scheme for Uncoordinated Multiple Access

Vamsi K. Amalladinne, Jean-Francois Chamberland, Krishna R. Narayanan

This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverag…

cs.IT2018

A Coupled Compressive Sensing Scheme for Unsourced Multiple Access

Vamsi K. Amalladinne, Avinash Vem, Dileep Kumar Soma +2

This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing…

cs.IT2017★ 2 cited

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

Nagaraj T. Janakiraman, Avinash Vem, Krishna R. Narayanan +1

We consider the problem of querying a string (or, a database) of length bits to determine all the locations where a substring (query) of length appears either exactly or is…