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

Avraham Freedman

dblp:96/3190 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorComputer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 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 · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › synchronization
carrier synchronization
0.112008
ML iterative soft-decision-directed (ML-ISDD): a carrier synchronization system for short packet turbo coded communication · IEEE Trans. Commun. 2008
Physical-layer communications
channel coding
0.112008
ML iterative soft-decision-directed (ML-ISDD): a carrier synchronization system for short packet turbo coded communication · IEEE Trans. Commun. 2008
Physical-layer communications › channel coding › error control coding › concatenated codes
turbo codes
0.112008
ML iterative soft-decision-directed (ML-ISDD): a carrier synchronization system for short packet turbo coded communication · IEEE Trans. Commun. 2008
Physical-layer communications › channel coding › decoding algorithms
iterative decoding
0.012008
ML iterative soft-decision-directed (ML-ISDD): a carrier synchronization system for short packet turbo coded communication · IEEE Trans. Commun. 2008
Information theory › signal processing › time-frequency analysis
ambiguity function
0.011985
Any two N × N costas signals must have at least one common ambiguity sidelobe if N > 3 - A proof · Proc. IEEE 1985
Information theory › signal processing › radar signal processing
radar waveform design
0.011985
Any two N × N costas signals must have at least one common ambiguity sidelobe if N > 3 - A proof · Proc. IEEE 1985

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

maximum likelihood estimation · 0.1iterative decoding · 0.1combinatorial proof · 0.0
YearPublicationVenuePosition
2009 Virtual drive test: an in-situ method for network measurements and optimization
abstract
Wireless communication has become ubiquitous and personalized. It is used more and more indoor as well as on the road. Measurements and network monitoring are essential for the operation of any cellular radio network. Terminal measurements and reports, as collected by the network, are a viable source that can fill in the gaps of drive and walk tests, especially since the latter are confined to roads and public places. Those reports, once enhanced by a location engine that attributes geographic coordinates to each call, provide a focused view on problematic areas and enable problem solution and network performance improvement based on actual user usage patterns. The combination of terminal reports together with a location engine for the purpose of network optimization is, what we call, a Virtual Drive Test. In this article the concept of the virtual drive test will be defined and explained, including the geolocation principles on which it is based. Network optimization using the virtual drive tests will be shown and demonstrated using existing cellular networks.
Avraham Freedman, Moshe Levin
IWCMC1
2008 ML iterative soft-decision-directed (ML-ISDD): a carrier synchronization system for short packet turbo coded communication
abstract
Modern communication systems are required to provide services based on high data rates burst-mode packet-data transmission, capable of operating at very low SNR conditions. Turbo codes enable the operation at low SNR, close to the Shannon limit. However, carrier frequency and phase synchronization, needed for optimal coherent performance of the receiver, still remains a problem in low SNR and short bursts conditions. This paper proposes a new carrier synchronization method, the Maximum-Likelihood Iterative-Soft-Decision-Directed (ML-ISDD), which uses the turbo-decoder soft decisions to improve the carrier synchronization performance at low SNR values. The ML-ISDD method operates iteratively and jointly with the turbo decoder, enhancing both the turbo-decoder and the synchronization performance. The ML-ISDD method has been shown by simulation to significantly increase the allowed initial frequency and phase uncertainty region, thus allowing the use of very short training sequences for initial carrier synchronization.
Yossef Rahamim, Avraham Freedman, Arie Reichman
IEEE Trans. Commun.2
2004 Methods for carrier synchronization of short packet turbo coded signals
abstract
Turbo codes, which provide superior performance, close to the Shannon limit, have found their way into WLAN and mobile system standards. Synchronization of turbo-coded signals operating at low SNR conditions may be difficult, especially for short packet transmission. This paper proposes two techniques for using the turbo decoder information to improve the carrier phase and frequency offset synchronization for short packets communication systems. One of those techniques, which are based on soft-decisions produced by the Turbo decoder, can be used for tracking. The other technique is based on maximizing a newly invented cost function, the MSSO (/spl Delta/f,/spl Phi/) function, to acquire and track the carrier frequency and phase errors, with the cost of complexity. A combination of the two techniques is introduced as well to provide a wholesome solution.
Yossef Rahamim, Avraham Freedman, Arie Reichman
PIMRC2
1996 Applying the minimum free energy spectral estimation algorithm to ISAR imaging
abstract
Inverse synthetic aperture radar (ISAR) is a technique used to obtain an image of the radar target. It can be described as a spectral analysis problem. This paper discusses the application of the minimum free energy (MFE) spectral estimation algorithm for the purpose of ISAR imaging. The MFE algorithm is a regularization algorithm which achieves a better noise performance than other methods studied previously. The paper discusses the choice of parameters for the MFE technique, and presents ISAR images obtained using MFE for various observation times. MFE indeed achieves a 3-4 times higher resolution than the classic Fourier technique, without prominent spikes in the noise region. However, some of the details observed in the Fourier image are lost. Using diversity (incoherent) combining, it is shown that based upon the same RF data, MFE and the Fourier techniques produce images of similar quality, although MFE poses a less stringent requirement on the length of the coherent observation time. The MFE can be applied to ISAR imaging of close to radial targets.
Avraham Freedman, Bernard D. Steinberg, George Chkhenkeli
ICASSP1
1995 Perfect periodic correlation sequences
Avraham Freedman, Nadav Levanon, Shimshon Gabbay
Signal Process.1
1985 Any two N × N costas signals must have at least one common ambiguity sidelobe if N > 3 - A proof
abstract
Costas signals have an ambiguity function that approaches the ideal "Thumbtack" configuration. To increase the main lobe/side-lobe ratio without increasing the number of frequencies (signal dimension, N) it may be possible to stagger Costas signal pulses whose ambiguity sidelobe patterns do not coincide. We prove here that Costas signals of the same dimension, with completely different ambiguity sidelobe patterns, do not exist for N > 3.
Avraham Freedman, Nadav Levanon
Proc. IEEE1