Sharif Digital Repository

This paper presents a novel patchwork audio watermarking scheme with a psychoacoustic model of HAS in DFT domain that has significantly higher detection robustness compared to standard and modified patchwork watermarking algorithms. In addition, watermark is perceptually tuned, so that its embedding is transparent. The proposed algorithm can be used for transmitting hidden data through telephone channel. Experimental results show that the proposed watermarking algorithm is sustainable against compression algorithms such as MP3, LPF, resampling, requantization and AWGN attacks. © 2008 IEEE  

In this paper the structure of Maximum Likelihood (ML) CFAR for lognormal clutter is derived assuming that some reference samples are censored to avoid destructive effect of interfering targets. It is shown that under some acceptable approximations we will achieve in a simple structure for this detector which is suitable for real time processing. The proposed detector is compared with non censored ML CFAR (i.e. logt CFAR) via simulation. It is shown that while the proposed detector is a little weaker than logt CFAR in homogeneous clutter, in non homogeneous clutter it outperforms the logt CFAR  

Active Constellation Extension (ACE) is one of the techniques introduced for Peak to Average Power Ratio (PAPR) reduction of OFDM systems. In this technique, the constellation points are extended such that the PAPR is minimized but the minimum distance of the constellation points does not decrease. In this paper, an iterative ACE method is proposed for the PAPR reduction of OFDM systems with spatial diversity of Space Frequency Block Coding (SFBC). The proposed method is such that the PAPR is reduced simultaneously at all antennas, while the spatial encoding relationship still holds. In this method, at each iteration, the antenna with maximum PAPR is selected and the ACE algorithm is... 

A joint pre- and post-coder (JPROC) is proposed for MIMO OFDM-based cognitive radio systems over correlated fading channels. The main aim is to have a trade-off between licensed networks and un-licensed networks in the underlay scenario. To handle the un-desired interferences on the main networks, the eigen-values of this JPROC should be small in each licensed network, as much as possible, whereas un-licensed users have higher rates. Frequency selective MIMO fading channels are coded with orthogonal space-time-frequency block codes (OSTFBCs) to improve the bad effects of these small eigen-values on the signal to noise ratio (SNR) in the main network. On the other hand, the system is operated... 

In Cognitive Radio (CR), in order to avoid interference in the Primary Users (PU), some subcarriers need to be deactivated. In systems based on Multicarrier Code Division Multiple Access (MC-CDMA), this causes losing orthogonality among different spreading codes, leading to poor Bit Error Rate (BER) performance. The performance of such system can be improved by using Generalized Hadamard Codes (GHC) instead of conventional Hadamard codes which avoids the loss of orthogonality. This is due to the fact that unlike conventional Hadamard codes, GHC are conjectured to exist for any arbitrary length. In this paper, we propose using a novel spreading code, namely, GHC for synchronous MC-CDMA in CR... 

A multistage decoder for the internally convolutionally coded fibre-optic time-hopping code division multiple access system recently introduced is considered. In this system, the decoder consists of several stages. The first stage is implemented using one of the single-user decoders introduced. The following stages are maximum likelihood (ML) decoders each of which use the decisions made by the previous stage. The performance of the proposed decoder is evaluated by a Monte Carlo simulation. Numerical results show that a multistage decoder with only two stages greatly outperforms the single-stage decoder with negligible increase in complexity. The authors also derive the Chernoff bound for... 

Spin-transfer torque magnetic RAM (STT-MRAM) is known as the most promising replacement for static random access memory (SRAM) technology in large last-level cache memories (LLC). Despite its high density, nonvolatility, near-zero leakage power, and immunity to radiation as the major advantages, STT-MRAM-based cache memory suffers from high error rates mainly due to retention failure (RF), read disturbance, and write failure. Existing studies are limited to estimate the rate of only one or two of these error types for STT-MRAM cache. However, the overall vulnerability of STT-MRAM caches, whose estimation is a must to design cost-efficient reliable caches, has not been studied previously. In... 

Spin-transfer torque magnetic RAM (STT-MRAM) is known as the most promising replacement for static random access memory (SRAM) technology in large last-level cache memories (LLC). Despite its high density, nonvolatility, near-zero leakage power, and immunity to radiation as the major advantages, STT-MRAM-based cache memory suffers from high error rates mainly due to retention failure (RF), read disturbance, and write failure. Existing studies are limited to estimate the rate of only one or two of these error types for STT-MRAM cache. However, the overall vulnerability of STT-MRAM caches, whose estimation is a must to design cost-efficient reliable caches, has not been studied previously. In... 

Spin-transfer torque magnetic RAM (STT-MRAM) is known as the most promising replacement for static random access memory (SRAM) technology in large last-level cache memories (LLC). Despite its high density, nonvolatility, near-zero leakage power, and immunity to radiation as the major advantages, STT-MRAM-based cache memory suffers from high error rates mainly due to retention failure (RF), read disturbance, and write failure. Existing studies are limited to estimate the rate of only one or two of these error types for STT-MRAM cache. However, the overall vulnerability of STT-MRAM caches, whose estimation is a must to design cost-efficient reliable caches, has not been studied previously. In... 

Channel distortion may dramatically degrade speech recognition performance in a distant environment. Authors in their recent work [1] proposed a novel spectral subtraction method which they named it maximum likelihood based spectral subtraction (MLBSS). They indicated that recognition performance could be improved dramatically by adjusting filter parameters based on recognition results. Previous results show effectiveness of this method in dealing with additive distortion. In this paper we propose an approach for increasing robustness of this method against channel distortion in distant talking environment. We add Cepstral Mean Normalization (CMN) in designing MLBSS filter and show that by... 

We consider the K-user Multiple Input Multiple Output (MIMO) Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver. It is assumed that channel coefficients are constant real numbers and are available at all transmitters and at all receivers. The main objective of this paper is to characterize the number of Degrees of Freedom (DoF) of this channel. Using the real interference alignment technique introduced in [20], we show that MN/M+NK degrees of freedom can be achieved for almost all channel realizations. Also, a new upper-bound on the DoF of this channel is provided. This upper-bound coincides with our achievable DoF for K ≥ Ku≜M+N/gcd(M;N), where... 

We consider the K-user Multiple Input Multiple Output (MIMO) Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver. It is assumed that channel coefficients are constant real numbers and are available at all transmitters and at all receivers. The main objective of this paper is to characterize the number of Degrees of Freedom (DoF) of this channel. Using the real interference alignment technique introduced in Motahari et al., 2014, we show that MN M+N K degrees of freedom can be achieved for almost all channel realizations. Also, a new upper-bound on the DoF of this channel is provided. This upper-bound coincides with our achievable DoF for K K u... 

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... 

In this paper, a metric based symbol predistortion method is introduced for Peak to Average Power Ratio (PAPR) reduction of the Space Frequency Block Coded (SFBC) Orthogonal Frequency Division Multiplexing (OFDM) systems with two transmitter antennas. In the proposed method, a metric is defined which shows the contribution of each frequency domain symbol to the time domain samples with high amplitude at both antennas. Then, the symbols with the highest metric values are chosen and predistorted such that the peak powers are reduced while the SFBC relationship between two antennas holds constant. Three variants of this method will be introduced. Then, this technique is extended to the general... 

In this paper, we introduce a new class of codes for overloaded synchronous wireless and optical code-division multiple-access (CDMA) systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be reduced for a given number of users, which implies bandwidth reduction for downlink wireless systems. An upper bound for the maximum number of users for a given number of chips is derived. Also, lower and upper bounds for the sum channel capacity of a binary overloaded CDMA are derived that can predict the existence of such overloaded codes. We also propose a simplified maximum likelihood method for decoding these types of...