The Experts below are selected from a list of 71460 Experts worldwide ranked by ideXlab platform
Zhen Yang - One of the best experts on this subject based on the ideXlab platform.
-
Joint Source-relay selection for improving wireless physical-layer security
2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings, 2017Co-Authors: Weifeng Cao, Yu Long Zou, Zhen YangAbstract:Abstract-We explore the physical-layer security for a multiSource multi-relay wireless network in the presence of an eavesdropper, in which one of multiple Sources is scheduled to send its message to a destination with the assistance of multiple decode-and-forward (DF) relays. One eavesdropper is considered at the receiver side, and assumed to be capable of overhearing the transmission from relays to destination. In this paper, the round-robin scheduling and the Joint Source-relay selection schemes are presented to improve the physical-layer security of the multi-Source multi-relay system, and their closedform intercept probability expressions are derived over Rayleigh fadingchannels.Numericalresultsdemonstratethattheproposed Joint Source-relay selection scheme achieves a better performance than the traditional round-robin scheduling in terms of the intercept probability.
-
GLOBECOM - Joint Source-Relay Selection for Improving Wireless Physical-Layer Security
2016 IEEE Global Communications Conference (GLOBECOM), 2016Co-Authors: Zhen YangAbstract:Abstract-We explore the physical-layer security for a multiSource multi-relay wireless network in the presence of an eavesdropper, in which one of multiple Sources is scheduled to send its message to a destination with the assistance of multiple decode-and-forward (DF) relays. One eavesdropper is considered at the receiver side, and assumed to be capable of overhearing the transmission from relays to destination. In this paper, the round-robin scheduling and the Joint Source-relay selection schemes are presented to improve the physical-layer security of the multi-Source multi-relay system, and their closedform intercept probability expressions are derived over Rayleigh fadingchannels.Numericalresultsdemonstratethattheproposed Joint Source-relay selection scheme achieves a better performance than the traditional round-robin scheduling in terms of the intercept probability.
H. Vincent Poor - One of the best experts on this subject based on the ideXlab platform.
-
Joint Source and Channel Coding
IEEE Signal Processing Magazine, 2010Co-Authors: Maria Fresia, H. Vincent Poor, Fernando Perez-cruz, Sergio VerduAbstract:The objectives of this article are two-fold: First, to present the problem of Joint Source and channel (JSC) coding from a graphical model perspective and second, to propose a structure that uses a new graphical model for Jointly encoding and decoding a redundant Source. In the first part of the article, relevant contributions to JSC coding, ranging from the Slepian-Wolf problem to Joint decoding of variable length codes with state-of-the-art Source codes, are reviewed and summarized. In the second part, a double low-density parity-check (LDPC) code for JSC coding is proposed. The double LDPC code can be decoded as a single bipartite graph using standard belief propagation (BP) and its limiting performance is analyzed by using extrinsic information transfer (EXIT) chart approximations.
-
Limits on the Robustness of MIMO Joint Source-Channel Codes
arXiv: Information Theory, 2009Co-Authors: M. Taherzadeh, H. Vincent PoorAbstract:In this paper, the theoretical limits on the robustness of MIMO Joint Source channel codes is investigated. The case in which a single Joint Source channel code is used for the entire range of SNRs and for all levels of required fidelity is considered. Limits on the asymptotic performance of such a system are characterized in terms of upper bounds on the diversity-fidelity tradeoff, which can be viewed as an analog version of the diversity-multiplexing tradeoff. In particular, it is shown that there is a considerable gap between the diversity-fidelity tradeoff of robust Joint Source-channel codes and the optimum tradeoff (without the constraint of robustness).
-
Joint Source-Channel Coding at the Application Layer for Parallel Gaussian Sources
arXiv: Information Theory, 2009Co-Authors: Ozgun Y. Bursalioglu, Maria Fresia, Giuseppe Caire, H. Vincent PoorAbstract:In this paper the multicasting of independent parallel Gaussian Sources over a binary erasure broadcasted channel is considered. Multiresolution embedded quantizer and layered Joint Source-channel coding schemes are used in order to serve simultaneously several users at different channel capacities. The convex nature of the rate-distortion function, computed by means of reverse water-filling, allows us to solve relevant convex optimization problems corresponding to different performance criteria. Then, layered Joint Source-channel codes are constructed based on the concatenation of embedded scalar quantizers with binary rateless encoders.
-
ISIT - Joint Source-channel coding at the application layer for parallel Gaussian Sources
2009 IEEE International Symposium on Information Theory, 2009Co-Authors: Ozgun Y. Bursalioglu, Maria Fresia, Giuseppe Caire, H. Vincent PoorAbstract:In this paper the multicasting of independent parallel Gaussian Sources over a binary erasure broadcast channel is considered. Multiresolution embedded quantization and layered Joint Source-channel coding schemes are used in order to serve simultaneously several users at different channel capacities. The convex nature of the rate-distortion function, computed by means of reverse water-filling, allows us to solve relevant convex optimization problems corresponding to different performance criteria. Then, layered Joint Source-channel codes are constructed based on the concatenation of embedded scalar quantizers with binary rateless encoders.
Yue Rong - One of the best experts on this subject based on the ideXlab platform.
-
APCC - Joint Source and relay optimization for distributed MIMO relay system
The 17th Asia Pacific Conference on Communications, 2011Co-Authors: Apriana Toding, Muhammad R. A. Khandaker, Yue RongAbstract:In this paper, we develop the optimal transmit beamforming vector and the relay amplifying factors for a multiple-input multiple-output (MIMO) relay communication system with distributed relay nodes. Using the optimal beamforming vector, an iterative Joint Source and relay beamforming algorithm is developed to minimize the mean-squared error (MSE) of the signal waveform estimation. Numerical simulations are carried out to demonstrate the performance of the proposed Joint Source and relay beamforming algorithm.
-
Optimal Joint Source and Relay Beamforming for Parallel MIMO Relay Networks
2010 International Conference on Computational Intelligence and Software Engineering, 2010Co-Authors: Apriana Toding, Muhammad R. A. Khandaker, Yue RongAbstract:In this paper, we study the optimal structure of the Source precoding matrix and the relay amplifying matrices for multiple-input multiple-output (MIMO) relay communication systems with parallel relay nodes. We show that both the optimal Source precoding matrix and the optimal relay amplifying matrices have a beamforming structure. Using the optimal structure, a Joint Source and relay power loading algorithm is developed to minimize the mean-squared error (MSE) of the signal waveform estimation. Compared with existing algorithms for parallel MIMO relay networks, the proposed Joint Source and relay beamforming algorithm has a significant improvement in the system bit-error-rate performance.
Yuval Kochman - One of the best experts on this subject based on the ideXlab platform.
-
results on combinatorial Joint Source channel coding
Information Theory Workshop, 2012Co-Authors: Yuval Kochman, Arya Mazumdar, Yury PolyanskiyAbstract:This paper continues the investigation of the combinatorial formulation of the Joint Source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem is proposed and some initial results are put forward.
-
the adversarial Joint Source channel problem
International Symposium on Information Theory, 2012Co-Authors: Yuval Kochman, Arya Mazumdar, Yury PolyanskiyAbstract:This paper introduces the problem of Joint Source-channel coding in the setup where channel errors are adversarial and the distortion is worst case. Unlike the situation in the case of stochastic Source-channel model, the separation principle does not hold in adversarial setup. This surprising observation demonstrates that designing good distortion-correcting codes cannot be done by serially concatenating good covering codes with good error-correcting codes. The problem of the Joint code design is addressed and some initial results are offered.
-
ISIT - A strong converse for Joint Source-channel coding
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Da Wang, Amir Ingber, Yuval KochmanAbstract:We consider a discrete memoryless Joint Source-channel setting. In this setting, if a Source sequence is reconstructed with distortion below some threshold, we declare a success event. We prove that for any Joint Source-channel scheme, if this threshold lower (better) than the optimum average distortion, then the success probability approaches zero as the block length increases. Furthermore, we show that the probability has an exponential behavior, and evaluate the optimal exponent. Surprisingly, the best exponential behavior is attainable by a separation-based scheme.
-
ISIT - The adversarial Joint Source-channel problem
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Yuval Kochman, Arya Mazumdar, Yury PolyanskiyAbstract:This paper introduces the problem of Joint Source-channel coding in the setup where channel errors are adversarial and the distortion is worst case. Unlike the situation in the case of stochastic Source-channel model, the separation principle does not hold in adversarial setup. This surprising observation demonstrates that designing good distortion-correcting codes cannot be done by serially concatenating good covering codes with good error-correcting codes. The problem of the Joint code design is addressed and some initial results are offered.
-
ITW - Results on combinatorial Joint Source-channel coding
2012 IEEE Information Theory Workshop, 2012Co-Authors: Yuval Kochman, Arya Mazumdar, Yury PolyanskiyAbstract:This paper continues the investigation of the combinatorial formulation of the Joint Source-channel coding problem. In particular, the connections are drawn to error-reducing codes, isometric embeddings and list-decodable codes. The optimal performance for the repetition construction is derived and is shown to be achievable by low complexity Markov decoders. The compound variation of the problem is proposed and some initial results are put forward.
Weifeng Cao - One of the best experts on this subject based on the ideXlab platform.
-
Joint Source-relay selection for improving wireless physical-layer security
2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings, 2017Co-Authors: Weifeng Cao, Yu Long Zou, Zhen YangAbstract:Abstract-We explore the physical-layer security for a multiSource multi-relay wireless network in the presence of an eavesdropper, in which one of multiple Sources is scheduled to send its message to a destination with the assistance of multiple decode-and-forward (DF) relays. One eavesdropper is considered at the receiver side, and assumed to be capable of overhearing the transmission from relays to destination. In this paper, the round-robin scheduling and the Joint Source-relay selection schemes are presented to improve the physical-layer security of the multi-Source multi-relay system, and their closedform intercept probability expressions are derived over Rayleigh fadingchannels.Numericalresultsdemonstratethattheproposed Joint Source-relay selection scheme achieves a better performance than the traditional round-robin scheduling in terms of the intercept probability.
