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

Arie Reichman

dblp:24/6315 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Computer networks · 5 · 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
4 papers
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.122008
ML iterative soft-decision-directed (ML-ISDD): a carrier synchronization system for short packet turbo coded communication · IEEE Trans. Commun. 2008
Convolutionally Coded Frequency-Hopping Communications with Nonideal Interleaving · IEEE J. Sel. Areas Commun. 1990
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 › 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
Physical-layer communications
spread spectrum
0.021990
Convolutionally Coded Frequency-Hopping Communications with Nonideal Interleaving · IEEE J. Sel. Areas Commun. 1990
Adaptive Spread-Spectrum Systems Using Least-Squares Lattice Algorithms · IEEE J. Sel. Areas Commun. 1985
Physical-layer communications › channel coding › error control coding
convolutional codes
0.011990
Convolutionally Coded Frequency-Hopping Communications with Nonideal Interleaving · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications › spread spectrum
frequency hopping
0.011990
Convolutionally Coded Frequency-Hopping Communications with Nonideal Interleaving · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications › channel coding › convolutional decoding
viterbi decoding
0.011990
Convolutionally Coded Frequency-Hopping Communications with Nonideal Interleaving · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications › receiver design
adaptive receiver
0.011987
Adaptive Receiver for Digital Communication Over HF Channels · IEEE J. Sel. Areas Commun. 1987
Physical-layer communications
channel coding and estimation
0.011987
Adaptive Receiver for Digital Communication Over HF Channels · IEEE J. Sel. Areas Commun. 1987
Physical-layer communications › channel estimation › time-varying channel estimation
channel tracking
0.011987
Adaptive Receiver for Digital Communication Over HF Channels · IEEE J. Sel. Areas Commun. 1987
Physical-layer communications
fading channels
0.011987
Adaptive Receiver for Digital Communication Over HF Channels · IEEE J. Sel. Areas Commun. 1987
Physical-layer communications › fading channels
HF channel
0.011987
Adaptive Receiver for Digital Communication Over HF Channels · IEEE J. Sel. Areas Commun. 1987
Physical-layer communications › channel coding › error control coding
interleaving
0.011990
Convolutionally Coded Frequency-Hopping Communications with Nonideal Interleaving · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications
signal processing for communications
0.011985
Adaptive Spread-Spectrum Systems Using Least-Squares Lattice Algorithms · IEEE J. Sel. Areas Commun. 1985

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

maximum likelihood estimation · 0.1iterative decoding · 0.1upper bound analysis · 0.0soft decision diversity combining · 0.0training sequence · 0.0adaptive equalization · 0.0simulation · 0.0recursive least-squares lattice algorithms · 0.0
YearPublicationVenuePosition
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.3
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
PIMRC3
1990 Convolutionally Coded Frequency-Hopping Communications with Nonideal Interleaving
abstract
The interleaving span of coded frequency-hopped (FH) systems is often constrained to be smaller than the decoder memory length, i.e. nonideal interleaving is performed. An upper bound on the performance of a Viterbi decoder of a convolutional code with nonideal interleaving is presented. A soft decision diversity combining technique is introduced, and the performance of combined convolutional and diversity coding subject to worst-case partial band noise jamming is investigated. Optimization of the FH system performance subject to constraints of allowed delay and synthesizer settling time provides the best combination of interleaving span and hopping rate. The FH system considered employs M-ary frequency-shift key (MFSK) modulation and noncoherent demodulation with 2-b soft decision based on Viterbi's ratio-threshold technique.>
Shaul Laufer, Arie Reichman
IEEE J. Sel. Areas Commun.2
1987 Adaptive Receiver for Digital Communication Over HF Channels
abstract
The fading characteristics of the HF channel make communication over this channel difficult, even at moderate data rates. In this correspondence, a practical communication system is presented which has a near-optimal receiver for data detection and adaptive optimization of the receiver to channel parameters. The channel tracking is performed during the training sequence as well as during the detected data sequence. The receiver is fast converging, therefore suitable for frequency hopping. The correspondence presents the performance obtained on fading HF channels and the computational complexity via comparisons to previously published results. The performance is shown to be superior at comparable computational complexity.
J. M. Perl, A. Shpigel, Arie Reichman
IEEE J. Sel. Areas Commun.3
1986 Performance of Adaptive Detection and Channel Estimation Methods in Multipath Environment
J. M. Perl, A. Shpigel, Arie Reichman
ICC3
1985 Adaptive Spread-Spectrum Systems Using Least-Squares Lattice Algorithms
abstract
Practical communication systems must cope with many uncertainties in addition to determining the transmitted data, e.g., the direction, timing, and distortion of the desired signal, and the spectral and spatial distribution of the interference, all of which may change with time. This paper describes exact least-squares (LS) recursive lattice algorithms which resolve these uncertainties in a direct-sequence spread-spectrum digital communication system. The adaptive LS algorithm is recursive beth in order and time, and converges rapidly to the uncertain parameters. Time-discrete algorithms may be mechanized by a receiver containing integrate-and-dump circuits operating at the chip rate of the pseudonoise (PN) sequence, one in each in-phase and each quadrature channel of each sensor array element's output. Different configurations of optimal time-discrete receivers are presented and transformed into adaptive receivers by taking advantage of the spectral properties of the different kinds of LS filters. Simulation results are presented and some guide lines are given for the architecture of an adaptive direct-sequence spread-spectrum system.
Arie Reichman, Robert A. Scholtz
IEEE J. Sel. Areas Commun.1