default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoshi Takabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Satoshi Takabe
, Takashi Abe:
Hubbard-Stratonovich Detector for Simple Trainable MIMO Signal Detection. IEEE Wirel. Commun. Lett. 13(3): 701-705 (2024)- [i31]Ryo Hagiwara, Satoshi Takabe:
Convergence Acceleration of Markov Chain Monte Carlo-based Gradient Descent by Deep Unfolding. CoRR abs/2402.13608 (2024) - [i30]Yuya Kawamura, Satoshi Takabe:
Accelerating Convergence of Stein Variational Gradient Descent via Deep Unfolding. CoRR abs/2402.15125 (2024) - 2023
- [j8]Tadashi Wadayama, Satoshi Takabe:
Proximal Decoding for LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(3): 359-367 (2023) - [c16]Kazuya Nagasato, Satoshi Takabe, Kazuyuki Shudo:
Hypergraph Embedding Based on Random Walk with Adjusted Transition Probabilities. DaWaK 2023: 91-100 - [i29]Satoshi Takabe, Takashi Abe:
Hubbard-Stratonovich Detector for Simple Trainable MIMO Signal Detection. CoRR abs/2302.04461 (2023) - [i28]Satoshi Takabe:
Deep Unfolded Simulated Bifurcation for Massive MIMO Signal Detection. CoRR abs/2306.16264 (2023) - 2022
- [j7]Satoshi Takabe, Tadashi Wadayama:
Convergence Acceleration via Chebyshev Step: Plausible Interpretation of Deep-Unfolded Gradient Descent. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(8): 1110-1120 (2022) - [c15]Tadashi Wadayama, Satoshi Takabe:
Asymptotic Mean Squared Error of Noisy Periodical Successive Over-Relaxation. ISIT 2022: 2273-2278 - 2021
- [j6]Satoshi Takabe, Yuki Yamauchi, Tadashi Wadayama:
Deep-Unfolded Sparse CDMA: Multiuser Detector and Sparse Signature Design. IEEE Access 9: 40027-40038 (2021) - [j5]Tadashi Wadayama, Satoshi Takabe:
Chebyshev Periodical Successive Over-Relaxation for Accelerating Fixed-Point Iterations. IEEE Signal Process. Lett. 28: 907-911 (2021) - [c14]Satoshi Takabe, Tadashi Wadayama, Masahito Hayashi:
Refined Density Evolution Analysis of LDPC Codes for Successive Interference Cancellation. GLOBECOM 2021: 1-6 - [c13]Tadashi Wadayama, Satoshi Takabe:
MSE-Optimaized Linear Transform for Noisy Fronthaul Channels in Distributed MIMO C-RAN. GLOBECOM 2021: 1-6 - [c12]Tadashi Wadayama, Satoshi Takabe:
Proximal Decoding for LDPC-coded Massive MIMO Channels. ISIT 2021: 232-237 - [i27]Tadashi Wadayama, Satoshi Takabe:
Proximal Decoding for LDPC-coded Massive MIMO Channels. CoRR abs/2102.05256 (2021) - 2020
- [j4]Satoshi Takabe, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Behavior of Spatial Coupling LDPC Coding for Compute-and-Forward Two-Way Relaying. IEEE Trans. Commun. 68(7): 4063-4072 (2020) - [c11]Satoshi Takabe, Tadashi Wadayama:
Deep Unfolded Multicast Beamforming. GLOBECOM 2020: 1-6 - [c10]Satoshi Takabe, Tadashi Wadayama, Yonina C. Eldar:
Complex Trainable Ista for Linear and Nonlinear Inverse Problems. ICASSP 2020: 5020-5024 - [c9]Satoshi Takabe, Yuki Yamauchi, Tadashi Wadayama:
Trainable Projected Gradient Detector for Sparsely Spread Code Division Multiple Access. ICC Workshops 2020: 1-6 - [i26]Tadashi Wadayama, Satoshi Takabe:
Chebyshev Inertial Iteration for Accelerating Fixed-Point Iterations. CoRR abs/2001.03280 (2020) - [i25]Satoshi Takabe, Tadashi Wadayama:
Theoretical Interpretation of Learned Step Size in Deep-Unfolded Gradient Descent. CoRR abs/2001.05142 (2020) - [i24]Tadashi Wadayama, Satoshi Takabe:
Chebyshev Inertial Landweber Algorithm for Linear Inverse Problems. CoRR abs/2001.06126 (2020) - [i23]Satoshi Takabe, Tadashi Wadayama:
Deep Unfolded Multicast Beamforming. CoRR abs/2004.09345 (2020) - [i22]Satoshi Takabe, Tadashi Wadayama:
Convergence Acceleration via Chebyshev Step: Plausible Interpretation of Deep-Unfolded Gradient Descent. CoRR abs/2010.13335 (2020) - [i21]Tadashi Wadayama, Satoshi Takabe:
Acceleration of Cooperative Least Mean Square via Chebyshev Periodical Successive Over-Relaxation. CoRR abs/2011.11927 (2020)
2010 – 2019
- 2019
- [j3]Satoshi Takabe, Masayuki Imanishi, Tadashi Wadayama, Ryo Hayakawa, Kazunori Hayashi:
Trainable Projected Gradient Detector for Massive Overloaded MIMO Channels: Data-Driven Tuning Approach. IEEE Access 7: 93326-93338 (2019) - [j2]Daisuke Ito, Satoshi Takabe, Tadashi Wadayama:
Trainable ISTA for Sparse Signal Recovery. IEEE Trans. Signal Process. 67(12): 3113-3125 (2019) - [j1]Satoshi Takabe, Tadashi Wadayama:
Approximation Theory for Connectivity of Ad Hoc Wireless Networks With Node Faults. IEEE Wirel. Commun. Lett. 8(4): 1240-1243 (2019) - [c8]Satoshi Takabe, Masayuki Imanishi, Tadashi Wadayama, Kazunori Hayashi:
Deep Learning-Aided Projected Gradient Detector for Massive Overloaded MIMO Channels. ICC 2019: 1-6 - [c7]Tadashi Wadayama, Satoshi Takabe:
Deep Learning-Aided Trainable Projected Gradient Decoding for LDPC Codes. ISIT 2019: 2444-2448 - [c6]Satoshi Takabe, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying. ISIT 2019: 2923-2927 - [i20]Tadashi Wadayama, Satoshi Takabe:
Deep Learning-Aided Trainable Projected Gradient Decoding for LDPC Codes. CoRR abs/1901.04630 (2019) - [i19]Satoshi Takabe, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying. CoRR abs/1901.05262 (2019) - [i18]Satoshi Takabe, Tadashi Wadayama:
Complex Field-Trainable ISTA for Linear and Nonlinear Inverse Problems. CoRR abs/1904.07409 (2019) - [i17]Satoshi Takabe, Tadashi Wadayama, Ángeles Vázquez-Castro, Masahito Hayashi:
Compute-and-forward relaying with LDPC codes over QPSK scheme. CoRR abs/1904.08306 (2019) - [i16]Satoshi Takabe, Yuki Yamauchi, Tadashi Wadayama:
Trainable Projected Gradient Detector for Sparsely Spread Code Division Multiple Access. CoRR abs/1910.10336 (2019) - 2018
- [c5]Satoshi Takabe, Tadashi Wadayama:
Connectivity of Ad Hoc Wireless Networks with Node Faults. GLOBECOM 2018: 1-6 - [c4]Tadashi Wadayama, Satoshi Takabe:
Quantizer Optimization Based on Neural Quantizerfor Sum-Product Decoder. GLOBECOM 2018: 1-6 - [c3]Daisuke Ito, Satoshi Takabe, Tadashi Wadayama:
Trainable ISTA for Sparse Signal Recovery. ICC Workshops 2018: 1-6 - [c2]Satoshi Takabe, Yuta Ishimatsu, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels. ISIT 2018: 1021-1025 - [c1]Satoshi Takabe, Tadashi Wadayama:
k-connectivity of Random Graphs and Random Geometric Graphs in Node Fault Model. ISITA 2018: 252-256 - [i15]Daisuke Ito, Satoshi Takabe, Tadashi Wadayama:
Trainable ISTA for Sparse Signal Recovery. CoRR abs/1801.01978 (2018) - [i14]Satoshi Takabe, Tadashi Wadayama:
k-connectivity of Random Graphs and Random Geometric Graphs in Node Fault Model. CoRR abs/1801.02818 (2018) - [i13]Satoshi Takabe, Yuta Ishimatsu, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels. CoRR abs/1801.06328 (2018) - [i12]Satoshi Takabe, Koji Hukushima, Alexander K. Hartmann:
Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem. CoRR abs/1802.02350 (2018) - [i11]Tadashi Wadayama, Satoshi Takabe:
Joint Quantizer Optimization based on Neural Quantizer for Sum-Product Decoder. CoRR abs/1804.06002 (2018) - [i10]Satoshi Takabe, Tadashi Wadayama:
Connectivity of Ad Hoc Wireless Networks with Node Faults. CoRR abs/1804.07368 (2018) - [i9]Masayuki Imanishi, Satoshi Takabe, Tadashi Wadayama:
Deep Learning-Aided Iterative Detector for Massive Overloaded MIMO Channels. CoRR abs/1806.10827 (2018) - [i8]Satoshi Takabe, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Analysis of Spatial Coupling Coding for Compute-and-Forward Relaying. CoRR abs/1807.01599 (2018) - [i7]Satoshi Takabe, Masayuki Imanishi, Tadashi Wadayama, Kazunori Hayashi:
Trainable Projected Gradient Detector for Massive Overloaded MIMO Channels: Data-driven Tuning Approach. CoRR abs/1812.10044 (2018) - 2017
- [i6]Jun Takahashi, Satoshi Takabe, Koji Hukushima:
An exact algorithm exhibiting RS-RSB/easy-hard correspondence for the maximum independent set problem. CoRR abs/1704.06899 (2017) - [i5]Satoshi Takabe, Takanori Maehara, Koji Hukushima:
Typical Approximation Performance for Maximum Coverage Problem. CoRR abs/1706.08721 (2017) - [i4]Satoshi Takabe, Takafumi Nakano, Tadashi Wadayama:
Fault Tolerance of Random Graphs with respect to Connectivity: Phase Transition in Logarithmic Average Degree. CoRR abs/1712.07807 (2017) - 2016
- [i3]Satoshi Takabe, Koji Hukushima:
Statistical-mechanical Analysis of Linear Programming Relaxation for Combinatorial Optimization Problems. CoRR abs/1601.04273 (2016) - [i2]Satoshi Takabe, Koji Hukushima:
Typical Performance of Approximation Algorithms for NP-hard Problems. CoRR abs/1605.04679 (2016) - 2013
- [i1]Satoshi Takabe, Koji Hukushima:
Typical behavior of the linear programming method for combinatorial optimization problems: From a statistical-mechanical perspective. CoRR abs/1309.6925 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
