Sharif Digital Repository

Recent studies have revealed that spectrum congestion is due to the inefficient usage of spectrum against the availability. Cognitive radio is viewed as an approach for improving the utilisation of radio spectrum. The spectrally encoded (spread-time) code-division multiple access (SE-CDMA) technique (which is regarded as the dual of spread spectrum CDMA) is considered and its performance in cognitive radio networks is studied. In cognitive network spectrum, overlay and underlay techniques are employed to enable the primary and secondary users to coexist while improving the overall spectrum efficiency. It is shown that SE-CDMA provides considerable flexibility to design overlay and underlay... 

In this paper, we study the impact of sensing error and channel fading on the decision process of a multiple secondary user network in a primary network whose channel occupancy states are modelled as a Bernoulli process. We present a randomized access strategy to maximize total secondary network throughput. The proposed method guarantees that the probability of collision between primary and secondary users in each channel is less than the predefined value of P c = ξ. To find the optimal access strategy, we formulate secondary network throughput as an optimization problem. Then, using the KKT method to find the solution, we break the original problem into multiple sub-problems. Then, we... 

The achievement of our previously proposed space-time coding algorithm entitled full-rate linear-receiver space-time block code (FRLR STBC) has motivated us to propose, in this paper, a new class of high-rate space-time-frequency block codes (STFBCs) over frequency-selective Rayleigh fading channels. We have called these codes FRLR STFBCs with interleaving (FRLR STFBCs-I). FRLR STFBCs-I could achieve a full-diversity property over quasi-static channels. Simulation results also verify that the proposed schemes exhibit proper performances in comparison with the recently proposed STFBCs. The most outstanding characteristic of the newly introduced high-rate codes is the linear complexity of the... 

The focus of this study is the performance of the relaying network with incremental selective decode-and-forward (ISDF) protocol in non-selective slow Nakagami-m fading channels. To enhance bandwidth efficiency, when the direct transmission is not successful the relay is used to retransmit a clean copy of the source signal. The proposed protocol achieves a significant reduction in the power consumption and an improvement in performance compared to the fixed decode-and-forward (DF). The exact symbol error rate (SER) of M-PSK modulation for the ISDF protocol over general fading channels is derived. However, as the exact SER analysis is very complicated, we provide an approximated SER... 

In this brief, a new blind spectrum sensing method is proposed based on frequency comparison using a phase frequency detector (PFD). The PFD output patterns are utilized in a way to sense the spectrum with no knowledge of incoming signals, noise, or channel parameters. The detection and false alarm error probabilities are analytically calculated for additive white Gaussian noise and sine-wave input and are simulated for different inputs. It is shown that the required detection and false alarm probabilities can be achieved by changing the system parameters. The results show that the proposed method has lower complexity and outperforms the previous single-antenna blind method over flat fading... 

In this paper, we consider the problem of optimum rate adaptation and power allocation to maximize the delay-limited throughput (DLT) in a time-correlated 2×1 MISO Rayleigh fading channel with Hybrid ARQ in Chase-Combining mode (HARQ-CC). To this aim, we have first formulated the DLT equation based on the outage probability for 2×1 MISO-HARQ channel. We show that exact analytical calculation of the outage probability is not tractable. Therefore, we approximate the outage probability using a log-normal approximation approach. Based on such approximation, optimal rate and power allocations are derived. Finally, using Monte-Carlo simulation, we show that the approximation method provides... 

In this paper, by applying a new permutation to the full-diversity block circular delay diversity (BCDD) space-frequency codes (SFCs), we show that their performance could be enhanced. Furthermore, we propose a new method for performing the permutation in the absence of partial channel state information at the transmitter. This new permutation, which is done based on artificial delay and power profiles (ADPPs), could improve the performance of the BCDD SFCs more than 3 dB as simulation results demonstrate  

Space-time block codes (STBCs) with orthogonal structures provide full-diversity reception and simple decoupled detection at the receiver. Rate-one orthogonal STBCs (OSTBC) for complex constellations have been found only for two transmit antennas. On the other hand, STBCs' designs are classically based on the assumption of independent and identically distributed (i.i.d.) fading channels. However, poor scattering conditions may have harmful effects on the performance of STBCs. In this paper, we first derive the average of received signal power at the receiver over Rician fading channel, when the signals are coded with linear dispersion code (LDC). Then by using a genetic algorithm (GA), we... 

In this paper, we consider a broadband secondary transmitter-receiver pair which interferes with N narrowband primary users and study the effect of cognition and cooperation on the maximum stable throughput. In our study we focus on four transmission protocols as well as two channel types, i.e., flat fading and frequency selective fading. In the cooperative protocols, the broadband transmitter relays the packets of the primary users which have not correctly decoded at the primary receiver. The analysis includes random packet arrivals at the transmitters which may impact on the maximum stable throughput. Moreover, sensing errors at the secondary user are considered. In this paper, we derive... 

In this paper, we study two important transmission strategies in full-duplex two-way relaying in the presence of channel estimation errors. In analog network coding (ANC), the relay transmits the combined signals that were received from both sources, with the aim of achieving better spectral efficiency. However, due to imperfect channel-state information (CSI), sources cannot perfectly cancel their own data in the relayed signal. We derive an achievable information rate for ANC in imperfect-CSI conditions and show how the ANC performance can significantly be degraded as a result. Moreover, we derive cut-set bounds with channel estimation errors for traditional routing (TR), in which time... 

In this paper, we introduce a new class of sigature matrices for overloaded synchronous CDMA systems that have a very low complexity decoder. While overloaded systems are more efficient from the bandwidth point of view, the Maximum Likelihood (ML) implementation for decoding is impractical even for moderate dimensions. Simulation results show that the performance of the proposed decoder is very close to that of the ML decoder. Indeed, the proposed decoding scheme needs neither multiplication nor addition and requires only a few comparisons. Furthermore, the computational complexity and the probability of error vs. Signal to Noise Ratios (SNR) are derived analytically  

In this paper, we study and analyze the performance of matched and partially-matched receivers for a typical ultra wide-band Spectrally-Encoded Spread-Time (SE/ST) CDMA in the presence of multiple tone jammers. We investigate a scenario where there is no information about the jammer frequencies in the transmitter side while it is desirable to cancel it in the receiver side. We will demonstrate the performance of the SE/ST system would be improved through partially matched filter at the receiver. In addition, we approximate the two-dimensional RAKE receiver by a simple one-dimensional RAKE for the scenario where there are K asynchronous users. Furthermore, closed form formula for the... 

A pipelined architecture is developed for a Sequential Monte Carlo (SMC) receiver that performs joint channel estimation and data detection. The promising feature of the proposed SMC receiver is achieving the near-bound performance in fading channels without using any decision feedback, training or pilot symbols. The proposed architecture exploits the parallelism intrinsic to the algorithm and consists of three blocks, i.e., the SMC core, weight calculator, and resampler. Hardware efficient/parallel architectures for each functional block including the resampling block is developed. The novel feature of the proposed architecture is that makes the execution time of the resampling independent... 

In this paper, we propose a novel timing synchronization method for Orthogonal Frequency Division Multiplexing (OFDM) systems. The new method takes advantage of symmetrical correlation between some parts of the transmitted training symbol and produces an impulse-like timing metric. While reducing the complexity, our method provides an easy and efficient way for timing estimation. The proposed method does not need any differential cross-correlation or frequency correction to produce an impulse-like timing metric. It is shown that the new timing metric outperforms the previously presented methods in fading channels  

This paper proposes efficient cooperative cyclostationary spectrum sensing schemes in which each secondary-user (SU) performs single-cycle (SC) cyclostationary detection for fast and simple implementation, while collaboration between SUs in final decision on the presence or absence of the primary-user (PU) is explored to improve its performance. As the SUs simultaneously measure the spectral correlation functions at different cycle-frequencies (CF) and exchange their information regarding the measured results, a sufficient number of CFs are effectively examined with parallel searching, which makes the proposed cooperative spectrum sensing more reliable. This paper presents another look at... 

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private messages and also a common message to q receivers and each receiver decodes all of the messages, is considered. The capacity region of the discrete memoryless channel is characterized. Then, the general Gaussian fading MAC with common information wherein partial Channel State Information (CSI) is available at the transmitters (CSIT) and perfect CSI is available at the receivers (CSIR) is investigated. A coding theorem is proved for this model that yields an... 

A symmetric semideterministic relay network is introduced, generalizing Aref networks. In the considered model, there is no interference at the relays, but the links from the source and the relays to the sink are interfering and nondeterministic. An achievable rate is determined for an arbitrary number of relays, based on symmetric relaying and simultaneous partial and backward decoding at the sink. The information expressions of the achievable rate match those of the standard cut-set bound, but the set of probability distributions is substantially different. We also study a wireless example of the defined network where nondeterministic links are replaced with fading AWGN channels, and... 

In this paper, we propose a distributed rate and power allocation algorithm for real time traffic by using second order statistics of the channel. Our method minimizes the average delay of transmission over the fading channel. We assume that each sub carrier relies on its own buffer, and a constant arrival rate from higher layer application arrives at input buffers of each sub-carrier. This constant rate is optimally distributed through individual sub-rates transmitted over each sub-channel. Optimum power coefficients are also derived to minimize the average delay of transmission. In addition, collision and buffer overflows are taken into account while achieving acceptable throughputs  

Two important objectives in wireless sensor networks are reliability and reducing energy consumption. Hence, overcoming energy constraints and utilizing error control schemes such as Automatic Repeat Request (ARQ) and Forward Error Correction (FEC) are necessary to improve the energy efficiency and reliability. However, these two concerns are at odds, so there is a trade-off between them. Considering this point, the impact of various error control schemes on these objectives and the trade-off between them has been considered in Bluetooth networks recently. However, all these works consider ideal assumptions (e.g., perfect error detection) only. This work evaluates the energy-efficiency of... 

In this paper a novel Space Time Diversity Generalized Decorrelating Discrete Time Rake (STD-GD-DTR) for Upstream DS-CDMA system is proposed. The chosen algorithm for estimating the correct data is Maximum likelihood. In this method, a robust receiver based on maximum likelihood estimation is represented in which, space time diversity technique has been combined with generalized decorrelating discrete-time RAKE (GD-DTR) receiver to obtain higher performance than other widely used techniques for data estimation. Our proposed STD-GD-DTR ML based receiver provides high gains in the presence of channel estimation errors from similar methods. Simulation results illustrate the appropriate...