Sharif Digital Repository

In this work we present a high-throughput, low-complexity design for linear precoding in massive Multiple-Input Multiple-Output (MIMO) systems. Large number of Base Station (BS) antennas in massive MIMO at one hand has caused the performance of linear precoders to be near-optimal and at the other hand has increased their complexity due to the need for the inversion of matrices with large dimensions. To avoid this complexity, approximate inversion methods based on Neumann Series have been proposed. However, in this work, we propose an architecture for Zero Forcing (ZF) precoder based on the Neumann Series approximate inversion that further reduces the complexity by replacing matrix-matrix... 

Due to the increasing usage and capabilities of smart devices, mobile application developers build a large number of resource intensive applications, such as WAR applications. Even with the rapid development in hardware technology, the computing capability and battery capacity on wearable devices and smartphones still cannot meet the application demands with heavy computations and high battery drain. Pervasive computing addresses this problem by migrating applications to the resource providers external to mobile devices. The profitability of this method heavily depends on how to implement it and when to use it. Although there are many computation offloading systems proposed in the... 

Despite complex fluctuations, missing data, and maintenance costs of detectors, traffic volume forecasting at intersections is still a challenge. Moreover, most existing forecasting methods consider an isolated intersection instead of multiple adjacent ones. By accurately forecasting the volume of short-term traffic, a low-cost method can be provided to solve the problems of congestion, delay, and breakdown of detectors in the road transport system. This paper outlines a novel hybrid method based on deep learning to estimate short-term traffic volume at three adjacent intersections. The gated recurrent unit (GRU) and long short-term memory (LSTM) bilayer network with wavelet transform (WL)... 

A hydroelastic hybrid model is developed to simulate the fluid-structure interaction in water entry problems using the partitioned approach. The interactions between a flat plate and the water are modeled by a hydroelastic model using explicit and implicit couplings. Both couplings are unstable due to numerical instability associated with the fluid added mass. To overcome the instability, an extended Wagner's model is combined with the hydroelastic model, and a hybrid model is developed. The extended Wagner's model is the extension of the classical Wagner's model that is used to estimate the fluid inertial, damping, and restoring forces of a flexible plate within the potential flow theory.... 

We propose an efficient optimal algorithm for determining the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand and zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system with single price break point and resale of the excess units is acceptable at the ordering time. The problem is divided into the sub-plans with specific properties by the dynamic programming (DP) method already presented. By modifying the main structure of the DP method, we present a branch-and-bound algorithm to obtain the optimal ordering policy for each sub-plans. Furthermore, we... 

We propose a new nonlinear Rao-Nam like symmetric key encryption scheme. In our design, we employ a specific type of coded modulation schemes namely quasi-cyclic low-density parity-check (QC-LDPC) lattice-codes which have low-complexity encoding and decoding algorithms. Due to the application of coded modulation schemes in our design, the proposed scheme performs encryption, encoding and modulation simultaneously. Therefore, we regard the proposed scheme as a joint cryptosystem. The proposed joint cryptosystem withstands all variants of chosen plaintext attacks applied on Rao-Nam like cryptosystems due to its nonlinearity. Moreover, some conditions implying the uniformity of the ciphertexts... 

This paper develops an economic production quantity model for a multi-product multi-objective inventory control problem with fuzzy-stochastic demand and backorders. In this model, the annual demand is represented by trapezoidal fuzzy random numbers. The centroid defuzzification and the expected value methods are applied to defuzzify and make decisions in a random environment. In the case where the warehouse space is limited, the Lagrangian relaxation procedure is first employed to determine the optimal order and the maximum backorder quantities of the products such that the total inventory cost is minimized. The optimal solution obtained by the proposed approach is compared with that... 

A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The problem of proper labeling offers many variants and received a great interest during recent years. We consider the algorithmic complexity of some variants of the proper labeling problems, we present some polynomial time algorithms and NP-completeness results for them  

A graph G is weakly semiregular if there are two numbers a,b, such that the degree of every vertex is a or b. The weakly semiregular number of a graph G, denoted by wr(G), is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is a weakly semiregular graph. We present a polynomial time algorithm to determine whether the weakly semiregular number of a given tree is two. On the other hand, we show that determining whether wr(G)=2 for a given bipartite graph G with at most three numbers in its degree set is NP-complete. Among other results, for every tree T, we show that wr(T)≤2log2 δ(T)+O(1), where δ(T) denotes the maximum... 

A graph G is weakly semiregular if there are two numbers a,b, such that the degree of every vertex is a or b. The weakly semiregular number of a graph G, denoted by wr(G), is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is a weakly semiregular graph. We present a polynomial time algorithm to determine whether the weakly semiregular number of a given tree is two. On the other hand, we show that determining whether wr(G)=2 for a given bipartite graph G with at most three numbers in its degree set is NP-complete. Among other results, for every tree T, we show that wr(T)≤2log2⁡Δ(T)+O(1), where Δ(T) denotes the maximum... 

We show that the two-dimensional (12D) Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all its spin-spin coupling equal to iπ4 and all parameters of the original model are contained in the local magnetic fields of the Ising model. This result has already been derived by using techniques from quantum information theory and by exploiting the universality of cluster states. Here we do not use the quantum formalism and hence make the completeness result accessible to a wide audience. Furthermore, our method has the advantage of being algorithmic... 

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

5-th generation mobile networks aim the peak data rates in excess of few Gbs, which may appear to be challenging to achieve due to the existence of some blocks such as the turbo decoder. In fact, the interleaver is known to be a major challenging part of the turbo decoder due to its need to the parallel interleaved memory access. LTE uses Quadratic Permutation Polynomial (QPP) interleaver, which makes it suitable for the parallel decoding. In this paper, a new property of the QPP interleaver, called the correlated shifting property, is theoretically proved, leading to a fully scalable interleaver and a low-complexity address generator for an arbitrary order of parallelism. The proposed... 

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

This letter proposes a novel normalized subband adaptive filter (NSAF) algorithm, which applies variable step sizes to subband filters to improve the convergence performance of the conventional NSAF and update only a subset of the subbands per iteration to reduce its computational complexity. The selection process for each subband is based on the amount of improvement it makes to the mean square deviation at every iteration. Simulation results show significant reduction in computational complexity, faster convergence rate, and lower misadjustment error achieved using the proposed scheme  

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

Elliptic curve cryptography (ECC) has received attention, because it can achieve the same security level as other asymmetric methods while using a key with smaller length. Although ECC is more efficient compared with other asymmetric methods, the fast computation of ECC is always desirable. In this paper, a fixed-base comb point multiplication method has been used to perform regular point multiplication. In addition, two low-complexity (LC) and low-latency (LL) architectures for the regular point multiplication using fixed-base comb method have been proposed. The point multiplication architectures have been implemented using field-programmable gate array and application-specific integrated... 

This paper presents a hybrid QR decomposition (QRD) design that reduces the number of computations and increases their execution parallelism by using a unique combination of Multi-dimensional Givens rotations, Householder transformations and conventional 2-D Givens rotations. A semi-pipelined semi-iterative architecture is presented for the QRD core, that uses innovative design ideas to develop 2-D, Householder 3-D and 4-D/2-D configurable CORDIC processors, such that they can perform the maximum possible number of vectoring and rotation operations within the given number of cycles, while minimizing gate count and maximizing the resource utilization. Test results for the 0.3 mm 2 QRD chip,... 

A novel architecture for QR decomposition-based recursive least squares is presented. It offers low latency for applications where the channel equalization and adaptive filtering are mandatory. This approach reduces the computations by rewriting the equations in a manner that lets intense hardware resource sharing by reusing similar values in different computations. Moreover, precision range conversion allows for combining complex operations such as root square and division with minimum effect on the overall quantization error. Hence, an efficient lookup table-based solution has highly enhanced the performance of the design by 2.7 times with respect to the previous works  

The design of a complex active-RC filter for low-IF Wireless applications is described. Fifth-order complex Butterworth filter is designed using Class-AB operational amplifier architecture. This new structure makes the filter suitable for low power applications with high dynamic range. Simulation results show that the filter provides more than 40 dB image rejection ratio (IIR) and dynamic range of 82dB. The complete filter including on-chip tuning circuit consumes only 4.3mW with 1.8V single supply voltage. © 2007 IEEE