default search action
Ori Shental
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Wei Liu, Tom Richardson, Ori Shental, Liangming Wu, Changlong Xu, Hao Xu:
Finite-Precision Methods for Energy-Based Direct Arithmetic Coding in Probabilistic Shaping. ICC 2024: 806-811 - 2023
- [j8]Silas L. Fong
, Juan Bucheli
A Mixed-Integer Linear Programming Approach to Deploying Base Stations and Repeaters. IEEE Commun. Lett. 27(12): 3414-3418 (2023) - [j7]Jürgen Cezanne, Meilong Jiang
Design of Wireless Fronthaul With mmWave LOS-MIMO and Sample-Level Coding for O-RAN and Beyond 5G Systems. IEEE Open J. Commun. Soc. 4: 1893-1912 (2023) - [c14]Thomas M. Hehn, Tribhuvanesh Orekondy, Ori Shental, Arash Behboodi, Juan Bucheli, Akash S. Doshi, June Namgoong, Taesang Yoo, Ashwin Sampath, Joseph B. Soriaga:
Transformer-Based Neural Surrogate for Link-Level Path Loss Prediction from Variable-Sized Maps. GLOBECOM 2023: 4804-4809 - [c13]Wei Liu, Tom Richardson, Ori Shental, Liangming Wu, Changlong Xu, Hao Xu:
Energy-Based Arithmetic Coding Methods for Probabilistic Amplitude Shaping. GLOBECOM 2023: 5299-5304 - [c12]Wei Liu, Tom Richardson, Hao Xu, Changlong Xu, Liangming Wu, Ori Shental:
Approximation Methods for Enumerating Sequences for Probabilistic Amplitude Shaping. ISIT 2023: 2225-2230 - [i20]Thomas M. Hehn, Tribhuvanesh Orekondy, Ori Shental, Arash Behboodi, Juan Bucheli, Akash S. Doshi, June Namgoong, Taesang Yoo, Ashwin Sampath, Joseph B. Soriaga:
Transformer-Based Neural Surrogate for Link-Level Path Loss Prediction from Variable-Sized Maps. CoRR abs/2310.04570 (2023) - 2022
- [j6]Benjamin M. Zaidel
Beyond Equal-Power Sparse NOMA: Two User Classes and Closed-Form Bounds on the Achievable Region. Entropy 24(2): 227 (2022) - [j5]Benjamin M. Zaidel
Regular Sparse NOMA: Ultimate Performance in Closed Form. IEEE J. Sel. Areas Inf. Theory 3(1): 5-20 (2022) - [j4]Meilong Jiang, Jürgen Cezanne, Ashwin Sampath, Ori Shental, Qiang Wu, Ozge Hizir Koymen, Ahmed M. Bedewy, Junyi Li:
Wireless Fronthaul for 5G and Future Radio Access Networks: Challenges and Enabling Technologies. IEEE Wirel. Commun. 29(2): 108-114 (2022) - 2020
- [c11]Benjamin M. Zaidel, Ori Shental, Shlomo Shamai Shitz:
Bounding the Achievable Region of Sparse NOMA. ISIT 2020: 3043-3048 - [i19]Junho Cho, Ori Shental:
Prefix-Free Code Distribution Matching for 5G New Radio. CoRR abs/2001.05810 (2020)
2010 – 2019
- 2019
- [c10]Ori Shental:
The Penalty in Scaling Exponent for Polar Codes Is Analytically Approximated by the Golden Ratio. GLOBECOM 2019: 1-7 - [c9]Ori Shental, Jakob Hoydis:
"Machine LLRning": Learning to Softly Demodulate. GLOBECOM Workshops 2019: 1-7 - [i18]Ori Shental:
The Penalty in Scaling Exponent for Polar Codes is Analytically Approximated by the Golden Ratio. CoRR abs/1904.03768 (2019) - [i17]Ori Shental, Jakob Hoydis:
"Machine LLRning": Learning to Softly Demodulate. CoRR abs/1907.01512 (2019) - 2018
- [j3]Ori Shental
Massive BLAST: An Architecture for Realizing Ultra-High Data Rates for Large-Scale MIMO. IEEE Wirel. Commun. Lett. 7(3): 404-407 (2018) - [c8]Benjamin M. Zaidel, Ori Shental, Shlomo Shamai Shitz
Sparse NOMA: A Closed-Form Characterization. ISIT 2018: 1106-1110 - [i16]Benjamin M. Zaidel, Ori Shental, Shlomo Shamai:
Sparse NOMA: A Closed-Form Characterization. CoRR abs/1801.04427 (2018) - 2017
- [c7]Ori Shental, Benjamin M. Zaidel, Shlomo Shamai Shitz
Low-density code-domain NOMA: Better be regular. ISIT 2017: 2628-2632 - [i15]Ori Shental, Benjamin M. Zaidel, Shlomo Shamai:
Low-Density Code-Domain NOMA: Better Be Regular. CoRR abs/1705.03326 (2017) - [i14]Ori Shental, Sivarama Venkatesan, Alexei Ashikhmin, Reinaldo A. Valenzuela:
Massive BLAST: An Architecture for Realizing Ultra-High Data Rates for Large-Scale MIMO. CoRR abs/1708.05405 (2017) - 2010
- [i13]Hadar Efraim, Nadav Yacov, Ori Shental, Ido Kanter:
An efficient CDMA decoder for correlated information sources. CoRR abs/1001.5135 (2010)
2000 – 2009
- 2008
- [j2]Ori Shental, Noam Shental, Shlomo Shamai
Discrete-Input Two-Dimensional Gaussian Channels With Memory: Estimation and Information Rates Via Graphical Models and Statistical Mechanics. IEEE Trans. Inf. Theory 54(4): 1500-1513 (2008) - [c6]Danny Bickson, Ori Shental, Danny Dolev:
Distributed Kalman filter via Gaussian Belief Propagation. Allerton 2008: 628-635 - [c5]Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev:
Polynomial Linear Programming with Gaussian belief propagation. Allerton 2008: 895-901 - [c4]Ori Shental, Paul H. Siegel, Jack K. Wolf, Danny Bickson, Danny Dolev:
Gaussian belief propagation solver for systems of linear equations. ISIT 2008: 1863-1867 - [c3]Danny Bickson, Danny Dolev, Ori Shental, Paul H. Siegel, Jack K. Wolf:
Gaussian belief propagation based multiuser detection. ISIT 2008: 1878-1882 - [i12]Ori Shental, Ido Kanter:
Shannon Meets Carnot: Mutual Information Via Thermodynamics. CoRR abs/0806.3133 (2008) - [i11]Ido Kanter, Ori Shental, Hadar Efraim, Nadav Yacov:
Carnot in the Information Age: Discrete Symmetric Channels. CoRR abs/0807.4322 (2008) - [i10]Ori Shental, Danny Bickson, Paul H. Siegel, Jack K. Wolf, Danny Dolev:
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application. CoRR abs/0810.1119 (2008) - [i9]Danny Bickson, Ori Shental, Danny Dolev:
Distributed Kalman Filter via Gaussian Belief Propagation. CoRR abs/0810.1628 (2008) - [i8]Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev:
Polynomial Linear Programming with Gaussian Belief Propagation. CoRR abs/0810.1631 (2008) - [i7]Danny Bickson, Danny Dolev, Ori Shental, Paul H. Siegel, Jack K. Wolf:
Gaussian Belief Propagation Based Multiuser Detection. CoRR abs/0810.1729 (2008) - [i6]Ori Shental, Paul H. Siegel, Jack K. Wolf, Danny Bickson, Danny Dolev:
Gaussian Belief Propagation Solver for Systems of Linear Equations. CoRR abs/0810.1736 (2008) - 2006
- [j1]Ori Shental, Ido Kanter, Anthony J. Weiss:
Capacity of complexity-constrained noise-free CDMA. IEEE Commun. Lett. 10(1): 10-12 (2006) - [i5]Ori Shental, Ido Kanter:
Optimum Asymptotic Multiuser Efficiency of Pseudo-Orthogonal Randomly Spread CDMA. CoRR abs/cs/0604083 (2006) - [i4]Nadav Yacov, Hadar Efraim, Haggai Kfir, Ido Kanter, Ori Shental:
Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources. CoRR abs/cs/0605069 (2006) - 2005
- [c2]Ori Shental, Noam Shental, Shlomo Shamai
On the achievable information rates of finite-state input two-dimensional channels with memory. ISIT 2005: 2354-2358 - [i3]Ori Shental, Noam Shental, Shlomo Shamai:
On the Achievable Information Rates of Finite-State Input Two-Dimensional Channels with Memory. CoRR abs/cs/0502077 (2005) - [i2]Ori Shental, Ido Kanter, Anthony J. Weiss:
Capacity of Complexity-Constrained Noise-Free CDMA. CoRR abs/cs/0509048 (2005) - [i1]Ori Shental, Ido Kanter, Anthony J. Weiss:
On the Achievable Information Rates of CDMA Downlink with Trivial Receivers. CoRR abs/cs/0509049 (2005) - 2004
- [c1]Ori Shental, Anthony J. Weiss, Noam Shental, Yair Weiss:
Generalized belief propagation receiver for near-optimal detection of two-dimensional channels with memory. ITW 2004: 225-229
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-09-04 00:31 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: