Yangfan Zhong

Learn More
—We investigate the computation of Csiszár's bounds for the joint source–channel coding (JSCC) error exponent of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent(More)
— Consider transmitting two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multi-terminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver side,(More)
We study the error exponent, E J , for reliably transmitting a discrete stationary ergodic Markov (SEM) source Q over a discrete channel W with additive SEM noise via a joint source-channel (JSC) code. We first establish an upper bound for E J in terms of the Rényi entropy rates of the source and noise processes. We next investigate the analytical(More)
BACKGROUND Artificial Neural Network (ANN), as a potential powerful classifier, was explored to assist psychiatric diagnosis of the Composite International Diagnostic Interview (CIDI). METHOD Both Back-Propagation (BP) and Kohonen networks were developed to fit psychiatric diagnosis and programmed (using 60 cases) to classify neurosis, schizophrenia and(More)
— For a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryless additive Gaussian noise channel with a quadratic power constraint at the channel input, upper and lower bounds for the joint source-channel coding excess distortion exponent (which is the exponent of the probability of excess distortion) are(More)
— In this work, we introduce the notion of Laplacian-type class and derive a type covering lemma for the memoryless Laplacian source (MLS) under the magnitude-error distortion measure. We then present an application of the type covering lemma to the lossy coding of the MLS. We establish a simple analytical lower bound for the excess distortion exponent,(More)
—We investigate the joint source–channel coding (JSCC) excess distortion exponent E J (the exponent of the probability of exceeding a prescribed distortion level) for some memo-ryless communication systems with continuous alphabets. We first establish upper and lower bounds for EJ for systems consisting of a memoryless Gaussian source under the(More)
—We study the transmission of two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multiterminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver(More)
— We establish an upper bound for the joint source-channel coding (JSCC) error exponent for a discrete stationary ergodic Markov (SEM) source and a discrete channel with additive SEM noise. This bound, which is expressed in terms of the Rényi entropy rates of the source and noise processes, admits an identical form to Csiszár's sphere-packing upper bound(More)