• Title/Summary/Keyword: Threshold Scheme

Search Result 593, Processing Time 0.026 seconds

Dynamic Multi-frame Transmission Technology Using the WiMedia MAC for Multi-hop N-screen Services

  • Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.14 no.1
    • /
    • pp.21-25
    • /
    • 2016
  • N-screen is a promising technology to improve support for multimedia multicasting, content sharing, content mobility, media scalability, and seamless mobility. In this paper, the WiMedia distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service. Furthermore, to provide a multi-hop, one source multi-use N-screen service through point to point streaming in a seamless D-MAC protocol, a dynamic multi-frame transmission technology is proposed. In this technology, a dynamic time slot allocation scheme and a multi-hop resource reservation scheme are combined. In the proposed dynamic time slot allocation scheme, two thresholds, a hard threshold and a soft threshold, are included to satisfy the power consumption and delay requirements. A multi-frame DRP reservation scheme is proposed to minimize end-to-end delay during the multi-hop transmissions between N-screen devices. The proposed dynamic multi-frame transmission scheme enhances N-screen performance in terms of the multi-hop link establishment success rate and link establishment time compared to the conventional WiMedia D-MAC system.

On the Handover Performance of a Tri-threshold Bandwidth Reservation CAC Scheme

  • Tung, Hoi Yan;Tsang, Kim Fung;Lee, Lap To;Lam, Ka Lun;Sun, Yu Ting;Kwan, Shiu Keung Ronald;Chan, Sammy
    • ETRI Journal
    • /
    • v.29 no.1
    • /
    • pp.113-115
    • /
    • 2007
  • A dynamic tri-threshold call admission control scheme has been developed. This scheme supports voice, data, and multimedia services and it complies with the universal mobile telecommunications system. The performance of the proposed scheme is evaluated under varying handover rates. The QoS performance-including channel utilization, call dropping probability, and blocking probability-is investigated. The performance of the developed scheme is found to be encouraging.

  • PDF

A Sense Amplifier Scheme with Offset Cancellation for Giga-bit DRAM

  • Kang, Hee-Bok;Hong, Suk-Kyoung;Chang, Heon-Yong;Park, Hae-Chan;Park, Nam-Kyun;Sung, Man-Young;Ahn, Jin-Hong;Hong, Sung-Joo
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.7 no.2
    • /
    • pp.67-75
    • /
    • 2007
  • To improve low sense margin at low voltage, we propose a negatively driven sensing (NDS) scheme and to solve the problem of WL-to-BL short leakage fail, a variable bitline reference scheme with free-level precharged bitline (FLPB) scheme is adopted. The influence of the threshold voltage offset of NMOS and PMOS transistors in a latch type sense amplifier is very important factor these days. From evaluating the sense amplifier offset voltage distribution of NMOS and PMOS, it is well known that PMOS has larger distribution in threshold voltage variation than that of NMOS. The negatively-driven sensing (NDS) scheme enhances the NMOS amplifying ability. The offset voltage distribution is overcome by NMOS activation with NDS scheme first and PMOS activation followed by time delay. The sense amplifier takes a negative voltage during the sensing and amplifying period. The negative voltage of NDS scheme is about -0.3V to -0.6V. The performance of the NDS scheme for DRAM at the gigabit level has been verified through its realization on 1-Gb DDR2 DRAM chip.

An Evolutionary Algorithm to the Threshold Detection Method for the M-ary Holographic Data Storage (M-ary 홀로그래픽 저장 장치의 적응적 문턱값 검출을 위한 진화 연산 기법)

  • Kim, Sunho;Lee, Jieun;Im, Sungbin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.51-57
    • /
    • 2014
  • In this paper, we introduce the adaptive threshold detection scheme based on an evolutionary arithmetic algorithm for the M-ary holographic data storage(HDS) system. The genetic algorithm is a particular class of evolutionary arithmetic based on the process of biological evolution, which is a very promising technique for optimization problem and estimation applications. In this study, to improve the detection performance that is degraded by the HDS channel environment and the pixel misalignment, the threshold value was assumed to be a population set of the evolutionary algorithm. The proposed method can find an appropriate population set of bit threshold, which minimizes bit error rate(BER) as increased generation. For performance evaluation, we consider severe misalignment effect in the 4-ary holographic data storage system. Furthermore, we measure the BER performance and compare the proposed methods with the conventional threshold detection scheme, which verifies the superiority of the proposed scheme.

A Cooperative K-out-of-n Spectrum Sensing Method Considering Optimal Threshold (최적의 임계값을 고려한 K-out-of-n 협력 스펙트럼 검출 기법)

  • Choi, Moon-Geun;Kong, Hyung-Yun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.8
    • /
    • pp.761-767
    • /
    • 2011
  • In this paper, to improve performance of spectrum sensing, we propose the method which can find optimal threshold based on power of PU(Primary User) signal. To find optimal threshold value, we will use mathematical method, and find threshold which can has lowest error probability. Each SU(Secondary User) use this threshold and All Su makes local decision. All Su Send local decision to FC(Fusion Center). In this paper we consider K-out-of-n rule to combining local decision. To make global decision value, FC find optimal n. In the FC. FC received local decision which has lowest error probability and using optimal n and these vaule. FC make global decision value. In this paper, to analysis performance proposed scheme, we simulate proposed scheme using matlab and compare with traditional OR Rule. As a result of simulation, we can know that preposed scheme can get a better performance than traditional OR rule.

Zerotree coding with local adaptive threshold (국부 적응 문턱값을 가지는 제로트리 부호화)

  • 엄일규;김유신;김재호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.10
    • /
    • pp.112-119
    • /
    • 1997
  • Zerotreeimage coding is known as a simple and effective image comprssion algorithm. It has the property that the compression is generated in order of improtance. Conventionally, a fixed threshold is applied to the entire wavelet coefficients regardless of frequency and local features of an image. In this paper, we propose a new zerotree coding scheme with adaptive threshold. The adaptive threshold is determined by human visual characteristics. It is shown that the image quality of the proposed method is better than that of the conventional method.

  • PDF

PERFORMANCE ANALYSIS OF A MULTIPLEXER WITH THE THRESHOLD BASED OVERLOAD CONTROL IN ATM NETWORKS

  • Park, Chul-Geun
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.643-658
    • /
    • 1998
  • In this paper we analyze the performance of a statistical ATM multiplexer with bursty input traffic and two thresholds in the buffer by using queueing model. Two priority levels are considered for source traffic which is modeled by Markov Modulated Poisson Process to represent the bursty characteristics. Service time distributions of two priority sources are assumed to be same and deterministic for ATM environment. The partial buffer sharing scheme with one threshold may experience a sensitive state change around the threshold. But the proposed multiplexer with two thresholds avoids this hysterical phenominon to improve the system operation.

A study on the overload control of the ATM switching system (ATM 교환기 과부하제어 연구)

  • 기장근;최진규;김영선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.4
    • /
    • pp.952-960
    • /
    • 1996
  • In this paper, a new overload control scheme is proposed for a control system in ATM switching system. The proposed control scheme includes a counter that conunts the number of accepted calls and is decreased at cach D time interval. In overload condition of call processor, the control scheme detects over load condition when the counter value reaches a certain threshold value. Under overload condition, processor utilization is measured and the value of the D is updataed according to the difference between measured processor utilization and target utilization. A new call is accepted accepted only if the value of the counter is less than the threshold value. In overflow condition of cell traffic, accept probability of new call is reduced exponetially according to the elapsed time. The results of simulation show that the proposed overload contorl scheme maintains the target utilization very well under the various processor overload conditions and reduces the cell loss probability under the cell overflow conditions.

  • PDF

A contention resolution scheme based on the buffer occupancy for th einput-buffer ATM switch (버퍼의 점유도에 기초한 입력버퍼 ATM 스위치의 경합제어 방식)

  • 백정훈;박제택
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.1
    • /
    • pp.36-42
    • /
    • 1997
  • This paper proposes a high-speed contention resolution scheme featuring high flexibility to the bursty traffic for an input buffering ATM switching architecture and its hardware strategy. The scheme is based on the threshold on the occupancy of the input buffer. As the proposed scheme utilizes the threshold, it has high flexibility to the fluctuations of the input traffic. The hardware strategy for the proposed policy is provided with the aim of the simple structure that achieves the reduction of the signal path and the power consumption. The performance on the average buffer size of the proposed policy is performed and compared with the conventional schame under the bursty traffic through both the analysis based on the markov hain and the simulation. The relations among the parameters on the proposed policy is analyzed to improve the performance.

  • PDF

An Authentication Protocol-based Multi-Layer Clustering for Mobile Ad Hoc Networks (이동 Ad Hoc 망을 위한 다중 계층 클러스터링 기반의 인증 프로토콜)

  • Lee Keun-Ho;Han Sang-Bum;Suh Heyi-Sook;Lee Sang-Keun;Hwang Chong-Sun
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.4
    • /
    • pp.310-323
    • /
    • 2006
  • In this paper, we describe a secure cluster-routing protocol based on a multi-layer scheme in ad hoc networks. We propose efficient protocols, Authentication based on Multi-layer Clustering for Ad hoc Networks (AMCAN), for detailed security threats against ad hoc routing protocols using the selection of the cluster head (CH) and control cluster head (CCH) using a modification of cluster-based routing ARCH and DMAC. This protocol provides scalability of Shadow Key using threshold authentication scheme in ad hoc networks. The proposed protocol comprises an end-to-end authentication protocol that relies on mutual trust between nodes in other clusters. This scheme takes advantage of Shadow Key using threshold authentication key configuration in large ad hoc networks. In experiments, we show security threats against multilayer routing scheme, thereby successfully including, establishment of secure channels, the detection of reply attacks, mutual end-to-end authentication, prevention of node identity fabrication, and the secure distribution of provisional session keys using threshold key configuration.