Sharif Digital Repository

Cell search is a crucial process in the synchronization procedure for the 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) system. In this paper, a high-speed, low-complexity and reliable architecture is proposed for both steps of cell search: sector ID and cell ID group detection. For the sector ID detection, two novel methods, sign-bit reduction and wise resource sharing, are proposed. In addition, for the cell ID group detection, we proposed an algorithm based on the Maximum Likelihood Sequence Detection (MLSD) called 'sign-bit MLSD'. Simulations show that the proposed methods result in more than 90% reduction in area compared to the state-of-the-art. We designed and... 

In this paper we propose a new model for the near-far effect in a CDMA system. We derive upper and lower bounds for the maximum near-far effect for errorless transmission. Using these bounds, we propose some near-far resistant codes. Also a very low complexity ML decoder for a subclass of the proposed codes is suggested  

In this letter, we introduce a novel method for constructing large size Generalized Welch Bound Equality (GWBE) matrices. This method can also be used for the construction of large WBE matrices. The advantage of this method is its low complexity for constructing large size matrices and low computational complexity using Maximum Likelihood (ML) decoders for a subclass of these codes. © 2010 IEEE  

Evaluating the statistical dimension is a common tool to determine the asymptotic phase transition in compressed sensing problems with Gaussian ensemble. Unfortunately, the exact evaluation of the statistical dimension is very difficult and it has become standard to replace it with an upper-bound. To ensure that this technique is suitable, [1] has introduced an upper-bound on the gap between the statistical dimension and its approximation. In this work, we first show that the error bound in [1] in some low-dimensional models such as total variation and ell _{1} analysis minimization becomes poorly large. Next, we develop a new error bound which significantly improves the estimation gap... 

For technological purposes and theoretical curiosity, it is very interesting to have a building block that produces a considerable amount of entanglement between on-demand sites through a simple control of a few sites. Here, we consider permanently- coupled spin networks and study entanglement generation between qubit pairs to find low-complexity structures capable of generating considerable entanglement between various qubit pairs.We find that in axially symmetric networks the generated entanglement between some qubit pairs is rather larger than generic networks. We show that in uniformly-coupled spin rings each pair can be considerably entangled through controlling suitable vertices. To... 

This paper presents the first ASIC implementation of an LR algorithm which achieves ML diversity. The VLSI implementation is based on a novel hardware-optimized LLL algorithm that has 70% lower complexity than the traditional complex LLL algorithm. This reduction is achieved by replacing all the computationally intensive CLLL operations (multiplication, division and square root) with low-complexity additions and comparisons. The VLSI implementation uses a pipelined architecture that produces an LR-reduced matrix every 40 cycles, which is a 60% reduction compared to current implementations. The proposed design was synthesized in both 130μm and 65nm CMOS resulting in clock speeds of 332MHz and... 

This paper presents a VLSI architecture of a novel softoutput K-Best MIMO detector. The proposed detector attains low computational complexity using three improvement ideas: relevant discarded paths selection, last stage on-demand expansion, and relaxed LLR computation. A deeply pipelined architecture for a soft-output MIMO detector is implemented for a 4x4 64-QAM MIMO system realizing a peak throughput of 655Mbps, while consuming 174K gates and 195mW in 0.13um CMOS. Synthesis results in 65nm CMOS show the potential to support a sustained throughput up to 2Gbps achieving the data rates envisioned by emerging IEEE 802.16m and LTE-Advanced wireless standards  

We introduce a new secret-key cryptosystem based on 1-level QC-LDPC integer lattices. These lattices are practically implementable in high dimensions due to their low-complexity encoding and decoding algorithms. We exploit their efficient encoding and decoding algorithms to make a significant reduction in the complexity of lattice-based cryptosystems. Furthermore, the sparseness of the corresponding parity check matrix of 1-level QC-LDPC lattices and their good error performance, make them efficient choices in real world applications. In this paper, we propose a Rao-Nam like encryption scheme using 1-level QC-LDPC lattices. Some chosen-plaintext attacks and recent results on the Rao-Nam... 

In this paper we propose two mutual authentication protocols for RFID systems. Generally, in RFID systems, a reader can authenticate tags in the real-time and batch modes. This paper proposes the first authentication protocol for the real-time mode. It also proposes an efficient robust mutual authentication protocol for the batch mode. Some significant characteristics of the protocols are forward security, tag anonymity, location privacy, low complexity on the back-end server, and scalability. To the best of our knowledge, our protocols offer the most enhanced security features in RFID mutual authentication protocols with respect to user privacy. In analyzing the protocols, we show how... 

The analytical study of microchannels has been considered as a preliminary approach to alleviate the difficulties which are normally encountered in numerical and experimental studies. Among the analytical solutions, those with high robustness and low complexities are certainly more attractive. In this work, we present a theoretical approach to predict the temperature field in micro-Poiseuille channel flow with constant wall temperature. The use of power series method simplifies the solution in the current analytical approach. The current analytical derivations are examined for channels with both hot-wall and cold-wall conditions. The current solutions agree well with the numerical solutions... 

A novel low-complexity detection scheme is proposed for the multiple-input multiple-output (MIMO) single-carrier frequency division-multiple access (SC-FDMA) systems, which is suitable for ASIC implementations. The proposed detection scheme makes an initial estimate of the transmitted signal based on a minimum mean square error (MMSE) frequency domain equalizer (FDE) detector and finds symbols with higher error probability among them and browse more candidates for them in the constellation to improve their initial estimate. Based on this approach, architecture is introduced that achieves superior bit error rate (BER) performance compared to the conventional MMSE FDE. The performance of the... 

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  

Orthogonal frequency division multiplexing (OFDM) is one of the widely used multiplexing techniques in wireless communications and especially cognitive radio networks. One of the key challenges of this technique is its high peak to average power ratio (PAPR) of the transmitted signal. This paper, introduces a new approach to PAPR reduction of OFDM signals using harmony search algorithm (HSA) based on the partial transmit sequence (PTS) method. The simulation results demonstrate that the proposed algorithm has better PAPR reduction performance as an accurate and low complexity approach for OFDM systems  

In this paper, we present basic equation of efficient recursive least square algorithm based on GMSK modulation by linear superposition of amplitude modulated pulses for reduction complexity in equalizer. In this here, the DFE method be improved using of signal processing technique and soft decision which is called "generalized DFE or GDFEmethodquot;. We compare the performance and complexity GDFE with MLSE method for different channels used in GSM systems. The GDFE differs from the conventional DFE in its tap values and value of tap feedback filter related with channel length, which discussed in simulation result. Our simulation results, obtained for fading multi path channels, show that... 

Low-complexity error concealment techniques for missing macroblock (MB) recovery based on the boundary matching principle are extensively studied and evaluated. In this paper, an improved boundary matching algorithm (BMA) using adaptive search is presented to conceal channel errors in inter-frames of video images. The proposed scheme adaptively selects proper candidate regions to conceal the artifact of a lost block. The candidate regions are examined based on analyzing motion activity of the neighboring MBs. Simulations show that the proposed scheme outperforms both on PSNR and visual quality obviously of about 1-4dB compared to existing methods  

The complexity of the optimal phase control problem in wireless MIMO systems with scalar feedback quantization and equal-gain transmission is studied. The problem is shown to be NP-hard when the number of receive antennas grows linearly with the number of transmit antennas. For the case where the number of receive antennas is constant, the problem can be solved in polynomial time. An optimal algorithm is explicitly constructed. For practical purposes, a low-complexity algorithm based on local search is presented. Simulation results show that its performance is nearly optimal  

Scaling of CMOS devices being aggressively decreasing by reduce of transistor dimensions. However, such level of integration leads to many physical limit and transistors cannot get much smaller than their current size. Quantum-dot Cellular Automate is a novel technology which significantly reduces physical limit of CMOS devices implementation, thus, it can be an appropriate candidate to be substituted for CMOS technology. In addition to high integration density of QCA circuits, other unique specifications such as high speed and low power consumption encourage researchers to utilize this technology instead of CMOS technology. In this paper, a new layout of XOR gate is presented in QCA...