Impact of using Infinity-Norm with Initial Radius on Performance and Complexity of SD Algorithm in MIMO systems

Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2016, Vol 15, Issue 6

Abstract

 In recent years, the iterative decoding techniques have played a role in improving the performance (e.g., bit error rate) and reducing the complexity of various digital communication systems. Techniques of Multiple-Input Multiple-Output (MIMO) are the main technology to enhance and achieve high-speed, high data rates, improved reliability and coverage in wireless communications. The modern wireless communications require a low complexity system for detection, since a high CPU processing involves more energy consumption and thus less flexibility in mobility terms. The sphere decoding (SD) technique proposed to solve this problem, such as an efficient algorithm. The norm-2 or l^2-norm (Euclidean metric) considered as a traditional norm that is used to achieve the tree traversal stage in SD algorithm. This work is divided into two parts; Firstly, we propose to using Infinity-Norm or l^∞-norm instead l^2-norm to decreases the hardware complexity of SD with a loss of performance is negligible, the simulation results show that the proposed l^∞-norm SD needs 14.5% to 5.9% fewer complexities than l^2-norm SD. Secondly, we are investigating the impact of choosing initial radius on the performance and complexity of SD algorithm, we can conclude from the simulation results, that gain a better performance requires increasing in the initial radius of an SD algorithm from d1 (γ =2) to d3 (γ =8), and this mean addition more complexity due to the tradeoff  between performance and complexity.      In recent years, the iterative decoding techniques have played a role in improving the performance (e.g., bit error rate) and reducing the complexity of various digital communication systems. Techniques of Multiple-Input Multiple-Output (MIMO) are the main technology to enhance and achieve high-speed, high data rates, improved reliability and coverage in wireless communications. The modern wireless communications require a low complexity system for detection, since a high CPU processing involves more energy consumption and thus less flexibility in mobility terms. The sphere decoding (SD) technique proposed to solve this problem, such as an efficient algorithm. The norm-2 or -norm (Euclidean metric) considered as a traditional norm that is used to achieve the tree traversal stage in SD algorithm. This work is divided into two parts; Firstly, we propose to using Infinity-Norm or -norm instead -norm to decreases the hardware complexity of SD with a loss of performance is negligible, the simulation results show that the proposed -norm SD needs 14.5% to 5.9% fewer complexities than -norm SD. Secondly, we are investigating the impact of choosing initial radius on the performance and complexity of SD algorithm, we can conclude from the simulation results, that gain a better performance require increasing in the initial radius of an SD algorithm from d1 ( =2) to d3 ( =8), and this mean addition more complexity due to the tradeoff  between performance and complexity.

Authors and Affiliations

Mohammed Sulttan

Keywords

Related Articles

A Self-Orgnizing Model for Peer-to-Peer Systems using Trust Relations

Peer-to-Peer systems enables the interactions of peers to accomplish tasks. Attacks of peers with malicious can be reduced by establishing trust relationship among peers. In this paper we presents algorithms which helps...

Ontology Mapping using Fuzzy Decision Tree and Formal Concept Analysis

An ontology describes and defines the terms used to describe and represent an area of knowledge. Different people or organizations come up with their own ontology; having their own view of the domain. So, for systems to...

Application of Steganography in Symmetric Key Cryptography with Genetic Algorithm

Embedding maximum information in a stego-image with minimum change in its appearance has been a major concern in image-based steganography techniques. In this paper, utilizing Genetic algorithm (GA) we have built up a co...

Identifying Effective Factors on Using Service Oriented Achitecture in E-Banking

One of the common problems of most banks in information technology  in banking area is the lack of software integrity and data banks. For integrating goals, various methods and technologies have been developed. Service...

Occlusion Detection in M-FISH Human Chromosome Images

Automation of Chromosome Analysis has long been considered a tedious task due to the partial occlusion of chromosomes. This calls for a non-trivial, dedicated procedure to segment chromosomes. In this paper, a new method...

Download PDF file
  • EP ID EP650851
  • DOI 10.24297/ijct.v15i6.1614
  • Views 114
  • Downloads 0

How To Cite

Mohammed Sulttan (2016). Impact of using Infinity-Norm with Initial Radius on Performance and Complexity of SD Algorithm in MIMO systems. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 15(6), 6857-6864. https://europub.co.uk/articles/-A-650851