• Title/Summary/Keyword: Markov-Modulation

Search Result 16, Processing Time 0.029 seconds

Markov CAC model in Wireless Mobile Networks Using AMC (AMC를 사용하는 무선 이동 네트워크에서 Markov CAC 모델)

  • Kwon Eun-Hyun;Park Hyo-Soon;Lee Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.270-277
    • /
    • 2006
  • In the wireless adaptive modulation and coding(AMC) systems, the modulation type of user's connection can be changed dynamically. and the ongoing connection might fail due to the change of modulation. In this paper, we approach the AMC-induced CAC problem by focusing on the guaranteed connection. Three kinds of calls, new, handoff, and modulation-changed calls, are considered. We propose a modified guard channel CAC scheme that allows the modulation-changed and handoff calls to use the guard channel. Then we analyze a Markov model for the CAC scheme with long-term AMC in mind. According to the simulation results, the proposed approach reduces the call dropping probability for modulation-changed calls, which suggests the threshold of guard channels can be determined based on the proposed approach.

The Identification of Pulse Repetition Intervals Modulation using Markov Models Approach (마코프 모델을 이용한 펄스반복주기 변조형태 인식)

  • 김용우;양해원
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.6
    • /
    • pp.372-377
    • /
    • 2003
  • Many of modem radars use modulated pulse repetition intervals for the purpose of anti-aliasing and ECCM. The interception, analysis and identification of radar signals is a major function of a radar intercept receiver. In this paper, we discuss the identification of pulse repetition intervals modulation of radar signals which is one of the major parameters for the analysis of radar. We proposed a new algorithm based on Markov models approach. This approach is shown to be reliable and robust to the missing pulses, as well as to require only relatively few pulse data.

A Study on Signal-to-Noise Ratio of Delta Modulation for a First-Order Gauss-Markov Signal (First-Order Gauss-Markov 신호에 대한 Delta 변조방식의 신호대 잡음비에 관한 연구)

  • Moon, Sang-Jae;Son, Hyun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.17 no.3
    • /
    • pp.52-56
    • /
    • 1980
  • The Signal -to- Noise Ratio of delta modulation for a fi rEt -order Gauss -Markov signal is derived and an approximate expreession of SND is discussed, in the case that only granular noise arises. Cross covariance of input and error signals are negligible when the adjacent correlation of input signal is larger than the difference between the adjacent correlation and the prediction coefficient of local decoder. The approximately derived SNR is available for any value of adjacent correlation.

  • PDF

State Encoding of Hidden Markov Linear Prediction Models

  • Krishnamurthy, Vikram;Poor, H.Vincent
    • Journal of Communications and Networks
    • /
    • v.1 no.3
    • /
    • pp.153-157
    • /
    • 1999
  • In this paper, we derive finite-dimensional non-linear fil-ters for optimally reconstructing speech signals in Switched Predic-tion vocoders, Code Excited Linear Prediction(CELP) and Differ-ential Pulse Code Modulation (DPCM). Our filter is an extension of the Hidden Markov filter.

  • PDF

Performance Evaluation of the WiMAX Network Based on Combining the 2D Markov Chain and MMPP Traffic Model

  • Saha, Tonmoy;Shufean, Md. Abu;Alam, Mahbubul;Islam, Md. Imdadul
    • Journal of Information Processing Systems
    • /
    • v.7 no.4
    • /
    • pp.653-678
    • /
    • 2011
  • WiMAX is intended for fourth generation wireless mobile communications where a group of users are provided with a connection and a fixed length queue. In present literature traffic of such network is analyzed based on the generator matrix of the Markov Arrival Process (MAP). In this paper a simple analytical technique of the two dimensional Markov chain is used to obtain the trajectory of the congestion of the network as a function of a traffic parameter. Finally, a two state phase dependent arrival process is considered to evaluate probability states. The entire analysis is kept independent of modulation and coding schemes.

TCP Performance Analysis in Wireless Transmission using Adaptive Modulation and Coding Schemes (적응변조코딩 기법을 사용하는 무선 전송에서의 TCP 성능 분석)

  • 전화숙;최계원;정동근
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.188-195
    • /
    • 2004
  • We have analyzed the performance of TCP in the CDMA mobile communications systems with the adaptive modulation and coding(AMC). The wireless channel using AMC is characterized with not high error rate but highly varying bandwidth. Due to time-varying bandwidth, timeout events of TCP occurs more frequently, which leads to the throughput degradation. The analysis model is composed of the two parts. In the first part, we divide TCP packet stream into ‘packet groups’and derive the probability distribution of the wireless transmission time of each Packet group that reflects the time varying characteristics of AMC. In the second part, we formulate embedded Markov chain by making use of the results of the first part to model TCP timer mechanism and wireless transmission. Since our system model is characterized by the forward link high speed data transmission using AMC, the results reported in this paper can be used as a guideline for the design and operation of HSDPA, 1xEV-DO, and 1xEV-DV.

Performance Analysis of IEEE 802.15.6 MAC Protocol in Beacon Mode with Superframes

  • Li, Changle;Geng, Xiaoyan;Yuan, Jingjing;Sun, Tingting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.5
    • /
    • pp.1108-1130
    • /
    • 2013
  • Wireless Body Area Networks (WBANs) are becoming increasingly important to solve the issue of health care. IEEE 802.15.6 is a wireless communication standard for WBANs, aiming to provide a real-time and continuous monitoring. In this paper, we present our development of a modified Markov Chain model and a backoff model, in which most features such as user priorities, contention windows, modulation and coding schemes (MCSs), and frozen states are taken into account. Then we calculate the normalized throughput and average access delay of IEEE 802.15.6 networks under saturation and ideal channel conditions. We make an evaluation of network performances by comparing with IEEE 802.15.4 and the results validate that IEEE 802.15.6 networks can provide high quality of service (QoS) for nodes with high priorities.

An Optimal Power-Throughput Tradeoff Study for MIMO Fading Ad-Hoc Networks

  • Yousefi'zadeh, Homayoun;Jafarkhani, Hamid
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.334-345
    • /
    • 2010
  • In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

Finite Source Queueing Models for Analysis of Complex Communication Systems (복잡한 통신 시스템의 성능분석을 위한 유한소스 대기 모형)

  • Che-Soong Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.2
    • /
    • pp.62-67
    • /
    • 2003
  • This paper deals with a First-Come, First-Served queueing model to analyze the behavior of heterogeneous finite source system with a single server Each sources and the processor are assumed to operate in independently Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment, that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as, utilizations, mean number of requests staying at the server, mean queue lengths, average waiting and sojourn times. In the case of fast arrivals or fast service asymptotic methods can be applied. In the intermediate situations stochastic simulation Is used. As applications of this model some problems in the field of telecommunications are treated.