Benjamin M. Zaidel

Dr. Benjamin M. Zaidel

Faculty of Engineering, Bar-Ilan University, Ramat Gan, Israel

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2011
Verified
Conference Paper
Closed access
YAYuval Avner
Yuval Avner
Benjamin M. ZaidelBenjamin M. Zaidel
Benjamin M. Zaidel
Shlomo Shamai (Shitz)Shlomo Shamai (Shitz)
Shlomo Shamai (Shitz)
Precoding schemes in the framework of vector perturbation (VP) for the multiple-input multiple-output (MIMO) Gaussian broadcast channel (GBC) are investigated. The VP scheme, originally a “one-shot” technique, is generalized to encompass processing over multiple time instances. Using lattice-based extended alphabets (“perturbations”), and considering the infinite time-span extension limit, a lower bound on the achievable sum-rate using the generalized VP scheme is analytically obtained, by which it is shown to achieve the optimum sum-rate in the high signal-to-noise ratio (SNR) regime (both in terms of degrees-of-freedom and power offset). The above lower bound is constructively obtained by means of an efficient practically oriented suboptimum transmit energy minimization algorithm, which has merits of its own, and it demonstrates the significant performance enhancement that can be obtained by preprocessing over multiple symbol instances, potentially eliminating the gap to the ultimate performance at high SNRs. For the 2×2 MIMO GBC, the VP scheme is generalized further, and an inner bound for the entire achievable rate region is obtained, by which an interesting correspondence is identified to the ultimate capacity region, as obtained by “dirty paper” coding (DPC).

31 January 2022 in Entropy
Verified
Journal Article
Open access
PDF file
Benjamin M. ZaidelBenjamin M. Zaidel
Benjamin M. Zaidel
Ori ShentalOri Shental
Ori Shental
Shlomo Shamai (Shitz)Shlomo Shamai (Shitz)
Shlomo Shamai (Shitz)
Non-orthogonal multiple access (NOMA) is a promising technology for future beyond-5G wireless networks, whose fundamental information-theoretic limits are yet to be fully explored. Considering regular sparse code-domain NOMA (with a fixed and finite number of orthogonal resources allocated to any designated user and vice versa), this paper extends previous results by the authors to a setting comprising two classes of users with different power constraints. Explicit rigorous closed-form analytical inner and outer bounds on the achievable rate (total class throughput) region in the large-system limit are derived and comparatively investigated in extreme-SNR regimes. The inner bound is based on the conditional vector entropy power inequality (EPI), while the outer bound relies on a recent strengthened version of the EPI. Valuable insights are provided into the potential performance gains of regular sparse NOMA in practically oriented settings, comprising, e.g., a combination of low-complexity devices and broadband users with higher transmit power capabilities, or combinations of cell-edge and cell-center users. The conditions for superior performance over dense code-domain NOMA (taking the form of randomly spread code-division multiple access), as well as a relatively small gap to the ultimate performance limits, are identified. The proposed bounds are also applicable for the analysis of interference networks, e.g., Wyner-type cellular models.

23 February 2022 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
Benjamin M. ZaidelBenjamin M. Zaidel
Benjamin M. Zaidel
Ori ShentalOri Shental
Ori Shental
Shlomo Shamai (Shitz)Shlomo Shamai (Shitz)
Shlomo Shamai (Shitz)
Understanding the fundamental limits of technologies enabling future wireless communication systems is essential for their efficient state-of-the-art design. A prominent technology of major interest in this framework is non-orthogonal multiple access (NOMA). In this paper, we derive an explicit rigorous closed-form analytical expression for the optimum spectral efficiency, in the large-system limit, of regular sparse (code-domain) NOMA, along with a closed-form formulation for the limiting spectral density of the underlying input covariance matrix. Sparse NOMA is an attractive and popular instantiation of NOMA, and its ‘regular’ variant corresponds to the case where only a fixed and finite number of orthogonal multiple-access resources are allocated to any designated user, and vice versa. Interestingly, the well-known Verdú-Shamai formula for (dense) randomly-spread code-division multiple access (RS-CDMA) turns out to coincide with the limit of the derived expression, when the number of orthogonal resources per user grows large. Furthermore, regular sparse NOMA is rigorously shown to be spectrally more efficient than RS-CDMA (viz. dense NOMA) across the entire system load range. Therefore, regular sparse NOMA may serve as an appealing means for reducing the throughput gap to orthogonal transmission in the underloaded regime, and to the ultimate Cover-Wyner bound for massive access overloaded systems. The spectral efficiency is also derived in closed form for the sub-optimal linear minimum-mean-square-error (LMMSE) receiver, which again extends the corresponding Verdú-Shamai LMMSE formula to the case of regular sparse NOMA.

17 September 2024 in IEEE Access
Verified
Journal Article
Open access
ECEldar Cohen
Eldar Cohen
LYLeonid Yavits
Leonid Yavits
Benjamin M. ZaidelBenjamin M. Zaidel
Benjamin M. Zaidel
AFAlexander Fish
Alexander Fish
Itamar LeviItamar Levi
Itamar Levi
This paper presents a scalable, fully-unrolled Number Theory Transform (NTT) architecture that eliminates memory registers. This architecture leverages Dual-Mode Logic (DML) technology to achieve configurability for various input sizes ( N ) and bit-widths ( K ). The design targets hardware acceleration, aiming to deliver NTT functionality at the speed of signal propagation without relying on registers or incurring pipeline-related trade-offs. Our implementation offers several potential optimizations, including a unique, fully-combinational, and low-cost modular reduction technique within the K-RED algorithm. Furthermore, it eliminates memory access penalties and control overhead. The widespread adoption of NTT and similar repeated structures across various fields underscores the broad applicability of our findings. Similar to large-scale DML-based architectures (e.g., MAC multipliers), our DML-NTT design can optimize both performance and energy consumption compared to standard CMOS implementations. Evaluation against its CMOS counterpart and a diverse set of existing hardware NTT implementations demonstrates high efficiency. For instance, an NTT with N = 2 10 and K = 2 5 bits achieves either high energy efficiency (0.227 μJ in static mode) or superior performance (0.018 μs in dynamic mode). These results surpass all known synchronous/iterative (rolled) or memory-based designs to date. Compared to an unrolled CMOS implementation, our design offers a 2x performance improvement in dynamic mode, albeit at a 5x energy cost. Additionally, the design incorporates a static mode that exhibits performance nearly identical to the unrolled CMOS architecture, providing flexibility for design considerations.