activity
20132023
most citedTrainable ISTA for Sparse Signal Recovery

235 citations · 345 across the 30 of their papers we have counts for

collaborators
Showing 2018Show all

9 papers · 1 filter

cs.IT2018★ 5 cited

Trainable Projected Gradient Detector for Massive Overloaded MIMO Channels: Data-driven Tuning Approach

Satoshi Takabe, Masayuki Imanishi, Tadashi Wadayama +2

This paper presents a deep learning-aided iterative detection algorithm for massive overloaded multiple-input multiple-output (MIMO) systems where the number of transmit antennas $…

cs.IT2018★ 2 cited

Asymptotic Analysis of Spatial Coupling Coding for Compute-and-Forward Relaying

Satoshi Takabe, Tadashi Wadayama, Masahito Hayashi

Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed to decode a linear combina…

cs.IT2018★ 4 cited

Deep Learning-Aided Projected Gradient Detector for Massive Overloaded MIMO Channels

Satoshi Takabe, Masayuki Imanishi, Tadashi Wadayama +1

The paper presents a deep learning-aided iterative detection algorithm for massive overloaded MIMO systems. Since the proposed algorithm is based on the projected gradient descent…

cs.IT2018

Connectivity of Ad Hoc Wireless Networks with Node Faults

Satoshi Takabe, Tadashi Wadayama

Connectivity of wireless sensor networks (WSNs) is a fundamental global property expected to be maintained even though some sensor nodes are at fault. In this paper, we investigate…

cs.IT2018★ 2 cited

Joint Quantizer Optimization based on Neural Quantizer for Sum-Product Decoder

Tadashi Wadayama, Satoshi Takabe

A low-precision analog-to-digital converter (ADC) is required to implement a frontend device of wideband digital communication systems in order to reduce its power consumption. The…

cond-mat.dis-nn2018

Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem

Satoshi Takabe, Koji Hukushima, Alexander K. Hartmann

The distribution of the computational cost of linear-programming (LP) relaxation for vertex cover problems on Erdos-Renyi random graphs is evaluated by using the rare-event samplin…