activity
20082024
most citedResource Management and Admission Control for Tactile Internet in Next Generation of RAN

9 citations · 18 across the 12 of their papers we have counts for

collaborators
Showing cs.ITShow all

7 papers · 1 filter

cs.IT2019

Multi-Purpose Aerial Drones for Network Coverage and Package Delivery

Mohammadjavad Khosravi, Hamid Saeedi, Hossein Pishro-Nik

Unmanned aerial vehicles (UAVs) have become important in many applications including last-mile deliveries, surveillance and monitoring, and wireless networks. This paper aims to de…

cs.IT2019★ 1 cited

Joint Dynamic Pricing and Radio Resource Allocation Framework for IoT Services

Mohammad Moltafet, Atefeh Rezaei, Nader Mokari +3

In this paper, we study the problem of resource allocation as well as pricing in the context of Internet of things (IoT) networks. We provide a novel pricing model for IoT services…

cs.IT2017★ 1 cited

A New Multiple Access Technique for 5G: Power Domain Sparse Code Multiple Access (PSMA)

Nader Mokari, Mohammad. R Javan, Mohammad Moltafet +2

In this paper, a new approach for multiple access (MA) in fifth generation (5G) of cellular networks called power domain sparse code multiple access (PSMA) is proposed. In PSMA, we…

cs.IT2017

Design of Capacity Approaching Ensembles of LDPC Codes for Correlated Sources using EXIT Charts

Mohamad Khas Mohamadi, Hamid Saeedi, Reza Asvadi

This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources wher…

cs.IT2011

LLR Approximation for Wireless Channels Based on Taylor Series and Its Application to BICM with LDPC Codes

Reza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari +1

A new approach for the approximation of the channel log-likelihood ratio (LLR) for wireless channels based on Taylor series is proposed. The approximation is applied to the uncorre…

cs.IT2011★ 6 cited

Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices

A. Makhdoumi Kakhaki, H. Karkeh Abadi, P. Pad +3

In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear co…