D. Burshtein

发表

Large vocabulary natural language continuous speech recognition

Michael Picheny, Jerome R. Bellegarda, Dimitri Kanevsky, 1989, International Conference on Acoustics, Speech, and Signal Processing,.

Minimum Impurity Partitions

V. D. Pietra, A. Nádas, D. Burshtein, 1992 .

A Splitting Theorem For Tree Construction

D. Burshtein, V. Della Pietra, D. Kamevsky, 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

Linear complexity approximate LP decoding of LDPC codes: Generalizations and improvements

D. Burshtein, 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

Bounds on the maximum likelihood decoding error probability of low density parity check codes

D. Burshtein, G. Miller, 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

Upper bounds on the rate of LDPC codes

D. Burshtein, M. Krivelevich, S. Litsyn, 2002, Proceedings IEEE International Symposium on Information Theory,.

Bounds on the performance of belief propagation decoding

D. Burshtein, D. Burshtein, G. Miller, 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

On the application of the Wald statistic to order estimation of ARMA models

E. Weinstein, D. Burshtein, D. Burshtein, 1991 .

Approximate iterative LP decoding of LDPC codes over GF(q) in linear complexity

David Burshtein, Dina Goldin, D. Burshtein, 2010, 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel.

Modeling intra-speaker variability for speaker recognition

Hagai Aronowitz, Dror Irony, David Burshtein, 2005, INTERSPEECH.

Efficient speaker identification and retrieval

Hagai Aronowitz, David Burshtein, D. Burshtein, 2005, INTERSPEECH.

Speaker indexing in audio archives using test utterance Gaussian mixture modeling

Hagai Aronowitz, Amihood Amir, David Burshtein, 2004, INTERSPEECH.

Text independent speaker recognition using speaker dependent word spotting

Hagai Aronowitz, Amihood Amir, David Burshtein, 2004, INTERSPEECH.

Unsupervised Linear and Nonlinear Channel Equalization and Decoding Using Variational Autoencoders

David Burshtein, Avi Caciularu, D. Burshtein, 2019, IEEE Transactions on Cognitive Communications and Networking.

Nondirect convergence radius and number of iterations of the Hopfield associative memory

David Burshtein, D. Burshtein, 1994, IEEE Trans. Inf. Theory.

Signal enhancement using beamforming and nonstationarity with applications to speech

Ehud Weinstein, Sharon Gannot, David Burshtein, 2001, IEEE Trans. Signal Process..

Deep Learning Methods for Improved Decoding of Linear Codes

David Burshtein, Warren J. Gross, Loren Lugosch, 2017, IEEE Journal of Selected Topics in Signal Processing.

Learning to decode linear codes using deep learning

Yair Be'ery, David Burshtein, Eliya Nachmani, 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance

David Burshtein, Idan Goldenberg, D. Burshtein, 2010, IEEE Transactions on Information Theory.

Scaled random trajectory segment models

Jacob Goldberger, David Burshtein, D. Burshtein, 1998, Comput. Speech Lang..

On the finite length scaling of ternary polar codes

David Burshtein, Dina Goldin, D. Burshtein, 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

Iterative and sequential Kalman filter-based speech enhancement algorithms

Ehud Weinstein, Sharon Gannot, David Burshtein, 1998, IEEE Trans. Speech Audio Process..

Performance Bounds of Concatenated Polar Coding Schemes

David Burshtein, Dina Goldin, D. Burshtein, 2019, IEEE Transactions on Information Theory.

Performance bounds of concatenated polar coding schemes

David Burshtein, Dina Goldin, D. Burshtein, 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

Lower Bounds on the Error Rate of LDPC Code Ensembles

David Burshtein, Ohad Barak, D. Burshtein, 2007, IEEE Transactions on Information Theory.

Upper Bounds on the Error Exponents of LDPC Code Ensembles

David Burshtein, Ohad Barak, D. Burshtein, 2006, 2006 IEEE International Symposium on Information Theory.

Scaled random segmental models

Jacob Goldberger, David Burshtein, D. Burshtein, 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

Segmental modeling using a continuous mixture of nonparametric models

Jacob Goldberger, David Burshtein, Horacio Franco, 1997, IEEE Trans. Speech Audio Process..

Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels

David Burshtein, Amir Bennatan, D. Burshtein, 2005, IEEE Transactions on Information Theory.

Asymptotic enumeration methods for analyzing LDPC codes

David Burshtein, Gadi Miller, D. Burshtein, 2004, IEEE Transactions on Information Theory.

Simplified End-to-End MMI Training and Voting for ASR

David Burshtein, Lior Fritz, D. Burshtein, 2017, 1703.10356.

Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel

D. Burshtein, Yonatan Urman, 2021, International Symposium on Information Theory.

Efficient Belief Propagation List Ordered Statistics Decoding of Polar Codes pdf

David Burshtein, Yonatan Urman, Guy Mogilevsky, 2021, ArXiv.

Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

David Burshtein, Gadi Miller, D. Burshtein, 2004, IEEE Transactions on Information Theory.

Maffucci's syndrome—The result of neural abnormalities? Evidence of mitogenic neurotransmitters present in enchondromas and soft tissue hemangiomas

D. Burshtein, N. Halperin, D. Robinson, 1994, Cancer.

RNN Decoding of Linear Block Codes pdf

Yair Be'ery, David Burshtein, Eliya Nachmani, 2017, ArXiv.

Bounds on the belief propagation threshold of non-binary LDPC codes

David Burshtein, Leonid Geller, D. Burshtein, 2012, 2012 IEEE Information Theory Workshop.

The Approximate Maximum-Likelihood Certificate

David Burshtein, Idan Goldenberg, D. Burshtein, 2011, IEEE Transactions on Information Theory.

Bounds on rates of LDPC codes for BEC with varying erasure rate

Uri Erez, David Burshtein, Ohad Barak, 2010, 2008 IEEE International Symposium on Information Theory.

Error bounds for repeat-accumulate codes decoded via linear programming

David Burshtein, Idan Goldenberg, D. Burshtein, 2009, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

D. Burshtein, I. Goldenberg, 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate

Uri Erez, David Burshtein, Ohad Barak, 2008, IEEE Transactions on Communications.

Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity

David Burshtein, D. Burshtein, 2008, IEEE Transactions on Information Theory.

Upper Bound on Error Exponent of Regular LDPC Codes Transmitted Over the BEC

David Burshtein, Idan Goldenberg, D. Burshtein, 2008, IEEE Transactions on Information Theory.

Bounds on the thresholds of non-binary LDPC codes

D. Burshtein, O. Levi, 2008, 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel.

On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm

David Burshtein, D. Burshtein, 2007, IEEE Transactions on Information Theory.

Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity

Simon Litsyn, David Burshtein, Shay Freundlich, 2007, 2006 IEEE International Symposium on Information Theory.

Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity

Simon Litsyn, David Burshtein, Shay Freundlich, 2006, IEEE Transactions on Information Theory.

EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels

David Burshtein, Amir Bennatan, D. Burshtein, 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

Lower bounds on the spectrum and error rate LDPC code ensembles

David Burshtein, Ohad Barak, D. Burshtein, 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

Bounds on achievable rates of LDPC codes used over the binary erasure channel

Meir Feder, David Burshtein, Ohad Barak, 2004, IEEE Transactions on Information Theory.

On the application of LDPC codes to arbitrary discrete-memoryless channels

David Burshtein, Amir Bennatan, D. Burshtein, 2003, IEEE Transactions on Information Theory.

Decoding algorithms for LDPC codes transmitted over channels with ISI

D. Burshtein, Tamar Friedlander, D. Burshtein, 2002, The 22nd Convention on Electrical and Electronics Engineers in Israel, 2002..

Upper bounds on the rate of LDPC codes as a function of minimum distance

Simon Litsyn, Michael Krivelevich, David Burshtein, 2002, IEEE Transactions on Information Theory.

Iterative decoding of LDPC codes: some bounds and properties

David Burshtein, Gadi Miller, D. Burshtein, 2001 .

Expander graph arguments for message-passing algorithms

David Burshtein, Gadi Miller, D. Burshtein, 2001, IEEE Trans. Inf. Theory.

Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes

David Burshtein, Gadi Miller, D. Burshtein, 2000, IEEE Trans. Inf. Theory.

Blind Channel Equalization Using Variational Autoencoders

David Burshtein, Avi Caciularu, D. Burshtein, 2018, 2018 IEEE International Conference on Communications Workshops (ICC Workshops).

On Polar Coding for Side Information Channels

David Burshtein, Barak Beilin, D. Burshtein, 2021, IEEE Transactions on Information Theory.

On Polar Coding for Binary Dirty Paper

David Burshtein, Barak Beilin, D. Burshtein, 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

Improved Bounds on the Finite Length Scaling of Polar Codes

David Burshtein, Dina Goldin, D. Burshtein, 2013, IEEE Transactions on Information Theory.

Feedback Channel Communication with Low Precision Arithmetic

D. Burshtein, Yonatan Urman, 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

Superposition coding for side-information channels

Shlomo Shamai, Giuseppe Caire, David Burshtein, 2006, IEEE Transactions on Information Theory.

Polar write once memory codes

David Burshtein, Alona Strugatski, D. Burshtein, 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

Confidence intervals for the maximum entropy spectrum

E. Weinstein, D. Burshtein, D. Burshtein, 1987, IEEE Trans. Acoust. Speech Signal Process..

Robust parametric modeling of durations in hidden Markov models

David Burshtein, D. Burshtein, 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

An efficient algorithm for calculating the likelihood and likelihood gradient of ARMA models

D. Burshtein, 1993, IEEE Trans. Autom. Control..

Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity

David Burshtein, Dina Goldin, D. Burshtein, 2013, IEEE Transactions on Information Theory.

End-to-End MAP Training of a Hybrid HMM-DNN Model pdf

David Burshtein, Lior Fritz, D. Burshtein, 2017, ArXiv.

An enhanced dynamic time warping model for improved estimation of DTW parameters

David Burshtein, Ran Yaniv, D. Burshtein, 2003, IEEE Trans. Speech Audio Process..

Support Vector Machine Training for Improved Hidden Markov Modeling

David Burshtein, Alba Sloin, D. Burshtein, 2008, IEEE Transactions on Signal Processing.

Speech enhancement using a mixture-maximum model

Sharon Gannot, David Burshtein, D. Burshtein, 1999, IEEE Trans. Speech Audio Process..

Joint modeling and maximum-likelihood estimation of pitch and linear prediction coefficient parameters.

D. Burshtein, D Burshtein, 1992, The Journal of the Acoustical Society of America.

Some relations between the various criteria for autoregressive model order determination

Ehud Weinstein, David Burshtein, D. Burshtein, 1985, IEEE Trans. Acoust. Speech Signal Process..