Loading...
Search for: side-information
0.006 seconds
Total 28 records

    Selected mapping algorithm for PAPR reduction of space-frequency coded OFDM systems without side information

    , Article IEEE Transactions on Vehicular Technology ; Volume 60, Issue 3 , 2011 , Pages 1211-1216 ; 00189545 (ISSN) Ferdosizadeh Naeiny, M ; Marvasti, F ; Sharif University of Technology
    Abstract
    Selected mapping (SLM) is a well-known technique for peak-to-average-power ratio (PAPR) reduction of orthogonal frequency-division multiplexing (OFDM) systems. In this technique, different representations of OFDM symbols are generated by rotation of the original OFDM frame by different phase sequences, and the signal with minimum PAPR is selected and transmitted. To compensate for the effect of the phase rotation at the receiver, it is necessary to transmit the index of the selected phase sequence as side information (SI). In this paper, an SLM technique is introduced for the PAPR reduction of space-frequency-block-coded OFDM systems with Alamouti coding scheme. Additionally, a suboptimum... 

    Nonlinear blind source separation for sparse sources

    , Article European Signal Processing Conference, 28 August 2016 through 2 September 2016 ; Volume 2016-November , 2016 , Pages 1583-1587 ; 22195491 (ISSN) ; 9780992862657 (ISBN) Ehsandoust, B ; Rivet, B ; Jutten, C ; Babaie Zadeh, M ; Sharif University of Technology
    European Signal Processing Conference, EUSIPCO  2016
    Abstract
    Blind Source Separation (BSS) is the problem of separating signals which are mixed through an unknown function from a number of observations, without any information about the mixing model. Although it has been mathematically proven that the separation can be done when the mixture is linear, there is not any proof for the separability of nonlinearly mixed signals. Our contribution in this paper is performing nonlinear BSS for sparse sources. It is shown in this case, sources are separable even if the problem is under-determined (the number of observations is less than the number of source signals). However in the most general case (when the nonlinear mixing model can be of any kind and there... 

    Polar codes for a quadratic-Gaussian Wyner-Ziv problem

    , Article Proceedings of the International Symposium on Wireless Communication Systems ; 2013 , Pages 718-722 ; 21540217 (ISSN) ; 9783800735297 (ISBN) Eghbalian Arani, S ; Behroozi, H ; Sharif University of Technology
    2013
    Abstract
    In this work, we study the performance of polar codes for lossy compression of a Gaussian source with a side information at decoder; known as the quadratic-Gaussian Wyner-Ziv problem. First we extend the binary polar codes to q-ary for the Wyner-Ziv problem. We show that the nested q- Ary polar codes are optimal for this case. Then we present two polar coding schemes for the Gaussian Wyner-Ziv problem. In the first scheme, we achieve a rate above the Wyner-Ziv rate-distortion function with a gap of 0.5 bits compared with the optimal rate. This scheme utilizes a successive cancellation decoder and is optimal in weak side-information cases when the decoder side-information noise variance is... 

    On the achievable rate region of a new Gaussian wiretap channel with side information

    , Article 2012 IEEE Information Theory Workshop, ITW 2012, 3 September 2012 through 7 September 2012 ; September , 2012 , Pages 657-661 ; 9781467302234 (ISBN) Bafghi, H. G ; Seyfe, B ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
    2012
    Abstract
    This paper introduces a new applicable Gaussian wiretap channel with side information. In this channel, the state of the channel to the wiretapper is separated from the main channel's one. It means that the legitimate receiver and the wiretapper are listening to the transmitted signal through the different channels with different channel states which may have some correlation to each other. The state of the main channel, is assumed to be known at the transmitter, helps the sender to encrypt its messages. The achievable equivocation-rate region for this model is drived in the Gaussian case and the results are reduced to the previous works as special cases  

    On the secrecy of the cognitive interference channel with partial channel states

    , Article Transactions on Emerging Telecommunications Technologies ; Volume 27, Issue 11 , 2016 , Pages 1472-1485 ; 21615748 (ISSN) Bafghi, H. G ; Seyfe, B ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
    Wiley Blackwell  2016
    Abstract
    The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter–receiver pairs, in which the cognitive transmitter has the message of the primary one as side information. In addition, the channel is affected by two channel state sequences, which are known at the cognitive transmitter and the corresponding receiver, separately. The cognitive transmitter should cooperate with the primary one, and it wishes to keep its message secure at the primary receiver. The achievable equivocation-rate regions for this channel are derived using two approaches: the binning scheme coding and... 

    Contourlet-based image watermarking using optimum detector in a noisy environment

    , Article IEEE Transactions on Image Processing ; Volume 19, Issue 4 , 2010 , Pages 967-980 ; 10577149 (ISSN) Akhaee, M. A ; Sahraeian, S. M. E ; Marvasti, F ; Sharif University of Technology
    Abstract
    In this paper, an improved multiplicative image watermarking system is presented. Since human visual system is less sensitive to the image edges, watermarking is applied in the contourlet domain, which represents image edges sparsely. In the presented scheme, watermark data is embedded in directional subband with the highest energy. By modeling the contourlet coefficients with General Gaussian Distribution (GGD), the distribution of watermarked noisy coefficients is analytically calculated. The tradeoff between the transparency and robustness of the watermark data is solved in a novel fashion. At the receiver, based on the Maximum Likelihood (ML) decision rule, an optimal detector by the aid... 

    Robust multiplicative audio and speech watermarking using statistical modeling

    , Article 2009 IEEE International Conference on Communications, ICC 2009, Dresden, 14 June 2009 through 18 June 2009 ; 2009 ; 05361486 (ISSN); 9781424434350 (ISBN) Akhaee, M. A ; Khademi Kalantari, N ; Marvasti, F ; Sharif University of Technology
    2009
    Abstract
    In this paper, a semi-blind multiplicative watermarking approach for audio and speech signals has been presented. At the receiver end, the optimal Maximum Likelihood (ML) detector aided by the channel side information for Gaussian and Laplacian signals in noisy environment is designed and implemented. The performance of the proposed scheme is analytically calculated and verified by simulation. Then, we adapt the proposed scheme to speech and audio signals. To improve robustness, the algorithm is applied to low frequency components of the host signal. Besides, the power of the watermark is controlled elegantly to have inaudibility using Perceptual Evaluation of Audio Quality (PEAQ) and... 

    Robust scaling-based image watermarking using maximum-likelihood decoder with optimum strength factor

    , Article IEEE Transactions on Multimedia ; Volume 11, Issue 5 , 2009 , Pages 822-833 ; 15209210 (ISSN) Akhaee, M. A ; Sahraeian, S. M. E ; Sankur, B ; Marvasti, F ; Sharif University of Technology
    2009
    Abstract
    In this paper, a new scaling-based image-adaptive watermarking system has been presented, which exploits human visual model for adapting the watermark data to local properties of the host image. Its improved robustness is due to embedding in the low-frequency wavelet coefficients and optimal control of its strength factor from HVS point of view. Maximum-likelihood (ML) decoder is used aided by the channel side information. The performance of the proposed scheme is analytically calculated and verified by simulation. Experimental results confirm the imperceptibility of the proposed method and its higher robustness against attacks compared to alternative watermarking methods in the literature....