• 제목/요약/키워드: Markov channel

검색결과 142건 처리시간 0.022초

Multi-band Approach to Deep Learning-Based Artificial Stereo Extension

  • Jeon, Kwang Myung;Park, Su Yeon;Chun, Chan Jun;Park, Nam In;Kim, Hong Kook
    • ETRI Journal
    • /
    • 제39권3호
    • /
    • pp.398-405
    • /
    • 2017
  • In this paper, an artificial stereo extension method that creates stereophonic sound from a mono sound source is proposed. The proposed method first trains deep neural networks (DNNs) that model the nonlinear relationship between the dominant and residual signals of the stereo channel. In the training stage, the band-wise log spectral magnitude and unwrapped phase of both the dominant and residual signals are utilized to model the nonlinearities of each sub-band through deep architecture. From that point, stereo extension is conducted by estimating the residual signal that corresponds to the input mono channel signal with the trained DNN model in a sub-band domain. The performance of the proposed method was evaluated using a log spectral distortion (LSD) measure and multiple stimuli with a hidden reference and anchor (MUSHRA) test. The results showed that the proposed method provided a lower LSD and higher MUSHRA score than conventional methods that use hidden Markov models and DNN with full-band processing.

Utility Bounds of Joint Congestion and Medium Access Control for CSMA based Wireless Networks

  • Wang, Tao;Yao, Zheng;Zhang, Baoxian;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권1호
    • /
    • pp.193-214
    • /
    • 2017
  • In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

추계적 페트리 네트를 이용한 무선망에서의 호 수락 제어 기법 (A Call Admission Control Technique of Wireless Networks using Stochastic Petri Nets)

  • 노철우
    • 한국콘텐츠학회논문지
    • /
    • 제3권4호
    • /
    • pp.55-62
    • /
    • 2003
  • 본 논문에서는 무선망에서 핸드오프 호의 분실확률을 줄일 수 있는 호 제어 기법을 제안한다. 제안한 기법은 진행 중인 시스템 용량인 유효로드와 임계치를 이용하여 호의 수락 여부를 결정하며 측정된 유효로드가 미리 정해진 임계치보다 크면 신규 호는 차단시키고, 핸드오프 호는 큐잉을 허용한다. 호 수락 제어 기법의 성능분석을 위하여 추계적 페트리 네트의 확장인 SRN 모델이 개발된다. SRN 모델링 기법은 성능분석을 위하여 필요한 마르코프 체인의 복잡한 해석적 분석대신 보상 개념에 의한 손쉬운 성능분석 수행방법을 보여준다.

  • PDF

Markovian 간섭 신호하에서의 Stop-­and-­Wait ARQ Protocol의 성능 분석 (Analysis of Stop-and-Wait ARQ Protocol under Markovian interruption)

  • 김성일;신병철
    • 한국정보통신학회논문지
    • /
    • 제7권8호
    • /
    • pp.1674-1683
    • /
    • 2003
  • Markovian 신호의 간섭(interruption)하에서 Stop­-and-­Wait ARQ protocol을 적용한 패킷 데이터 다중화기의 성능을 분석한다. 시스템 모델을 살펴보면 입력 프로세스는 Poisson 프로세스로, 출력 채널은 연속되는 시간 슬롯(slot)으로 분할되고 데이터 패킷은 이 슬롯 시간 동안에 전송된다. 이 시스템에서, 프레임 시간은 왕복 지연 시간으로 정의되었다. 이 모델에서 출력 채널은 Markovian 간섭에 의해 데이타 전송이 중단되는 blocking state와 간섭이 없는 non-­blocking state로 구분된다. Markovian 간섭신호를 고려하면서, 2개의 연속적인 프레임이나 slot사이에 버퍼 상태에 관한 관계식을 고려하여 전체적인 시스템이 분석되었다. 분석된 자료 값이 시뮬레이션과 비교적 잘 일치함을 확인하였다.

Hybrid 가드채널이 있는 이동통신시스템이 성능 평가 (Performance Analysis of a Cellular Mobile Communication System with Hybrid Guard Channels)

  • 홍성조;최진영
    • 산업경영시스템학회지
    • /
    • 제29권4호
    • /
    • pp.100-106
    • /
    • 2006
  • We analyze a voice/data integrated traffic model of the cellular mobile communication system with hybrid guard channels for voice and handoff calls. In a multi-service integrated wireless environment, quality of service guarantee is crucial for smooth transportation of real time information. Real time voice traffic requires a guaranteed upper bounded on both delay and packet error rate, whereas data traffic does not. Voice traffic has high transmission priority over data packets. Thus one of the important problems is the design of admission control schemes which can efficiently accommodate the differential quality of service requirements. In this paper, a hybrid guard channel scheme is considered in which arriving calls are assigned channels as long as the number of busy channels in the cell is below a predetermined first threshold. When the number of busy channels reaches the first threshold, new originating data calls are queued in the infinite data buffer. Then reaches second threshold, only handoff calls are assigned the remaining channels and new originating voice calls are blocked. We evaluate the system by a two-dimensional Markov chain approach and generating function method and obtain performance measures included blocking probability and forced termination probability.

A Privacy-preserving and Energy-efficient Offloading Algorithm based on Lyapunov Optimization

  • Chen, Lu;Tang, Hongbo;Zhao, Yu;You, Wei;Wang, Kai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권8호
    • /
    • pp.2490-2506
    • /
    • 2022
  • In Mobile Edge Computing (MEC), attackers can speculate and mine sensitive user information by eavesdropping wireless channel status and offloading usage pattern, leading to user privacy leakage. To solve this problem, this paper proposes a Privacy-preserving and Energy-efficient Offloading Algorithm (PEOA) based on Lyapunov optimization. In this method, a continuous Markov process offloading model with a buffer queue strategy is built first. Then the amount of privacy of offloading usage pattern in wireless channel is defined. Finally, by introducing the Lyapunov optimization, the problem of minimum average energy consumption in continuous state transition process with privacy constraints in the infinite time domain is transformed into the minimum value problem of each timeslot, which reduces the complexity of algorithms and helps obtain the optimal solution while maintaining low energy consumption. The experimental results show that, compared with other methods, PEOA can maintain the amount of privacy accumulation in the system near zero, while sustaining low average energy consumption costs. This makes it difficult for attackers to infer sensitive user information through offloading usage patterns, thus effectively protecting user privacy and safety.

Korean Broadcast News Transcription Using Morpheme-based Recognition Units

  • Kwon, Oh-Wook;Alex Waibel
    • The Journal of the Acoustical Society of Korea
    • /
    • 제21권1E호
    • /
    • pp.3-11
    • /
    • 2002
  • Broadcast news transcription is one of the hardest tasks in speech recognition because broadcast speech signals have much variability in speech quality, channel and background conditions. We developed a Korean broadcast news speech recognizer. We used a morpheme-based dictionary and a language model to reduce the out-of·vocabulary (OOV) rate. We concatenated the original morpheme pairs of short length or high frequency in order to reduce insertion and deletion errors due to short morphemes. We used a lexicon with multiple pronunciations to reflect inter-morpheme pronunciation variations without severe modification of the search tree. By using the merged morpheme as recognition units, we achieved the OOV rate of 1.7% comparable to European languages with 64k vocabulary. We implemented a hidden Markov model-based recognizer with vocal tract length normalization and online speaker adaptation by maximum likelihood linear regression. Experimental results showed that the recognizer yielded 21.8% morpheme error rate for anchor speech and 31.6% for mostly noisy reporter speech.

무선 근거리 통신망에서의 BRAM(The Broadcast Recognizing Access Method) 프로토콜 성능 분석 (Performance Analysis of a BRAM (The Broadcast Recognizing Aceess Method) Protocol in a Wireless LAN)

  • 김재현;이종규
    • 전자공학회논문지A
    • /
    • 제31A권1호
    • /
    • pp.1-8
    • /
    • 1994
  • In this paper, we have analyzed the performance of a BRAM (The Broadcasting Recognizing Access Method) protocol, as a CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) scheme, which is widely used in wireles LAN systems. We have selected a Fair BRAM protocol among CSMA/CA schemes, considering the fairness of channel usage and the simplicity of the protocol. We have compared the performance of BRAM protocol to that of CSMA/CD. to research the characteristics of BRAM in wireless LAN system. In order to analyze the performance of this system, we have set up an imbedded Markov chain and calculated state transition probabilities. Then we have calculated steady state probabilities and finally derived the throughput of a Fair BRAM moder. To verify our analysis, we have simulated practical models. Then, we have found that analytic results are very close to simulation ones. Our analysis of the BRAM protocol will be expected to be very helpful to design and evaluate a MAC (Media Access Control) protocol in wireless LAN systems.

  • PDF

WBAN MAC Protocols- Non-Saturation Modeling and Performance Analysis

  • Khan, Pervez;Ullah, Niamat;Kim, Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권3호
    • /
    • pp.1462-1476
    • /
    • 2017
  • The current literature on discrete-time Markov chain (DTMC) based analysis of IEEE 802.15.6 MAC protocols for wireless body area networks (WBANs), do not consider the ACK timeout state, wherein the colliding nodes check the ill fate of their transmissions, while other contending nodes perform backoff check that slot as usual. In this paper, our DTMC model accurately captures the carrier sense multiple access with collision avoidance (CSMA/CA) mechanism of IEEE 802.15.6 medium access control (MAC) and allows the contending nodes performing backoff to utilize the ACK timeout slot during collisions. The compared rigorous results are obtained by considering a non-ideal channel in non-saturation conditions, and CSMA/CA parameters pertaining to UWB PHY of IEEE 802.15.6 MAC protocols.

Rate Bounds for MIMO Relay Channels

  • Lo, Caleb K.;Vishwanath, Sriram;Heath, Jr., Robert W.
    • Journal of Communications and Networks
    • /
    • 제10권2호
    • /
    • pp.194-203
    • /
    • 2008
  • This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the design and analysis of optimal cooperative strategies more complex. In this paper, a partial cooperation strategy that combines transmit-side message splitting and block-Markov encoding is presented. Lower bounds on capacity that improve on a previously proposed non-cooperative lower bound are derived for Gaussian MIMO relay channels.