Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gideon Kutz

dblp:46/1050 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2026
0000-0002-8762-294XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 67% Cellular and mobile networks · 33%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
equalization
0.112007
Determination of Tap Positions for Sparse Equalizers · IEEE Trans. Commun. 2007
Physical-layer communications › channel modeling
frequency-selective channel
0.112007
Determination of Tap Positions for Sparse Equalizers · IEEE Trans. Commun. 2007
Cellular and mobile networks › 3g network
WCDMA
0.112007
Determination of Tap Positions for Sparse Equalizers · IEEE Trans. Commun. 2007
Algorithms and data structures › search algorithms
sequential search
0.012007
Determination of Tap Positions for Sparse Equalizers · IEEE Trans. Commun. 2007

Methods — techniques the papers use, named apart from their topics

low-complexity metric design · 0.1forward sequential search · 0.1
YearPublicationVenuePosition
2026 Average is Good Enough: Low-Complexity UE Receivers for Non-linear Precoded OFDM in Green Networks
Gideon Kutz, Amit Moses, Ronen Shaked, Yaniv Eistein, Assaf Touboul
ICC1
2010 Blind channel identification from burst data using implicit matching of HOS
Dan Raphaeli, Udi Suissa, Gideon Kutz
Signal Process.3
2007 Determination of Tap Positions for Sparse Equalizers
abstract
Sparse equalizers, in which only a small subset of the filter taps is selected to be nonzero, were recently proposed as a low-complexity solution for receivers operating in wireless frequency-selective channels with sparse power profiles. The performance of the sparse equalizer heavily depends on its tap-positioning algorithm. This paper presents efficient low-complexity algorithms for determination of sparse equalizer tap positions based on a forward sequential search. We develop low-complexity metrics for the evaluation of the candidate tap positions in the search space as well as methods to effectively reduce the search space size. The proposed algorithms are shown to be superior over previously proposed algorithms in a wide range of channel conditions. Actually, the proposed algorithms yield, in most of the tested cases, performance identical to the optimal, prohibitively complex, tap-positioning algorithm. The main emphasis is on linear equalization suitable for wideband code-division multiple-access systems but the algorithm can be extended to a variety of equalization schemes and channels.
Gideon Kutz, Dan Raphaeli
IEEE Trans. Commun.1
2001 Improved DCT-DST prime factor algorithms
Gideon Kutz, Hanoch Ur
Signal Process.1