A Simulation Model for Nakagmi-m Fading Channel with m>1
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2015, Vol 6, Issue 10
Abstract
In this paper, we propose a model to simulate a wireless fading channel based on Nakagami-m distribution with m>1. The Nakagami-m fading channel is the most generalized distribution as it can generate one-sided Gaussian distribution, Rayleigh distribution and Rician distribution for m equals to 0.5, 1 and >1 respectively. In this work we have proposed a method to generate a wireless fading channel based on Nakagami-m distribution as this distribution fits to a wide class of fading channel conditions. Simulation results were obtained using Matlab R2013a and compared with the analytical results.
Authors and Affiliations
Sandeep Sharma, Rajesh Mishra
Keywords
Related Articles
- EP ID EP143465
- DOI 10.14569/IJACSA.2015.061040
- Views 127
- Downloads 0
An Adaptive Key Exchange Procedure for VANET
VANET is a promising technology for intelligent transport systems (ITS). It offers new opportunities aiming at improving the circulation of vehicles on the roads and improving road safety. However, vehicles are interconn...
Introducing a Method for Modeling Knowledge Bases in Expert Systems Using the Example of Large Software Development Projects
Goal of this paper is to develop a meta-model, which provides the basis for developing highly scalable artificial intelligence systems that should be able to make autonomously decisions based on different dynamic and spe...
Graphing emotional patterns by dilation of the iris in video sequences
For this paper, we took videos of iris of people while induced a feeling of joy or sadness, using videos to motivate the states affective. The manuscript implemented is a system of recognition affective pattern by dilati...
Effective Performance of Information Retrieval by using Domain Based Crawler
World Wide Web continuously introduces new capabilities and attracts many people[1]. It consists of more than 60 billion pages online. Due to this explosion in size, the information retrieval system or Search Engines are...
A Method for Implementing Probabilistic Entity Resolution
Deterministic and probabilistic are two approaches to matching commonly used in Entity Resolution (ER) systems. While many users are familiar with writing and using Boolean rules for deterministic matching, fewer are as...