• Title/Summary/Keyword: binary number

Search Result 769, Processing Time 0.039 seconds

Variable Backoff Stage(VBS) Algorithm to Reduce Collisions in IEEE 802.11 DCF (IEEE 802.11 DCF 에서의 충돌 감소를 위한 가변 백오프 스테이지(VBS) 알고리즘)

  • Kang, Seongho;Choo, Young-yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.6
    • /
    • pp.1333-1340
    • /
    • 2015
  • IEEE 802.11 MAC(Media Access Control) defines DCF(Distributed Coordination Function) for data transmission control. BEB(Binary Exponential Backoff) algorithm of DCF has a problem that if the number of stations connected are over a certain threshold, it degrades network performance because of packet collisions caused from the minimum contention window size. To cope with this problem, we proposed a novel algorithm, named as VBS(Variable Backoff Stage) algorithm, which adjusts the rate of backoff stage increment depending on the number of stations associated with an AP(Access Point). Analytic model of proposed algorithm was derived and simulations on the BEB and the VBS algorithms have been conducted on the OFDM (Orthogonal Frequency Division Multiplexing) method. Simulation results showed that when the rate of backoff state increment was 5 and 10, the number of retransmission were reduced to 1/5 and 1/10 comparing to that of BEB, respectively. Our algorithm showed improvement of 19% and 18% in network utilization, respectively. Packet delay was reduced into 1/12.

Hybrid FFT processor design using Parallel PD adder circuit (병렬 PD가산회로를 이용한 Hybrid FFT 연산기 설계)

  • 김성대;최전균;안점영;송홍복
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.10a
    • /
    • pp.499-503
    • /
    • 2000
  • The use of Multiple-Valued FFT(Fast fourier Transform) is extended from binary to multiple-valued logic(MVL) circuits. A multiple-valued FFT circuit can be implemented using current-mode CMOS techniques, reducing the transitor, wires count between devices to half compared to that of a binary implementation. For adder processing in FFT, We give the number representation using such redundant digit sets are called redundant positive-digit number representation and a Redundant set uses the carry-propagation-free addition method. As the designed Multiple-valued FFT internally using PD(positive digit) adder with the digit set 0,1,2,3 has attractive features on speed, regularity of the structure and reduced complexities of active elements and interconnections. for the mutiplier processing, we give Multiple-valued LUT(Look up table)to facilitate simple mathmatical operations on the stored digits. Finally, Multiple-valued 8point FFT operation is used as an example in this paper to illuatrates how a multiple-valued FFT can be beneficial.

  • PDF

Analysis of Dynamical State Transition of Cyclic Connection Neural Networks with Binary Synaptic Weights (이진화된 결합하중을 갖는 순환결합형 신경회로망의 동적 상태천이 해석)

  • 박철영
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.5
    • /
    • pp.76-85
    • /
    • 1999
  • The intuitive understanding of the dynamic pattern generation in asymmetric networks may be useful for developing models of dynamic information processing. In this paper, dynamic behavior of the cyclic connection neural network, in which each neuron is connected only to its nearest neurons with binary synaptic weights of $\pm$ 1, has been investigated. Simulation results show that dynamic behavior of the network can be classified into only three categories: fixed points, limit cycles with basin and limit cycles with no basin. Furthermore, the number and the type of limit cycles generated by the networks have been derived through analytical method. The sufficient conditions for a state vector of $n$-neuron network to produce a limit cycle of $n$- or 2$n$-period are also given. The results show that the estimated number of limit cycles is an exponential function of $n$. On the basis of this study, cyclic connection neural network may be capable of storing a large number of dynamic information.

  • PDF

Binarization of number plate Image with a shadow (그림자가 있는 차량 번호판의 이진화)

  • Seo, Byung-Hoon;Kim, Byeong-Man;Moon, Chang-Bae;Shin, Yoon-Sik
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.4
    • /
    • pp.1-13
    • /
    • 2008
  • In this paper, we propose a method to solve a problem in binarizing the rear number plate image captured by a camera on a moving vehicle. An image may be shadowed by the cavernous structure of the rear side of a moving vehicle and it makes us hard to get a high quality of binary image. Therefore, we first detect a shadow edge and then divide an image into the shadow part and non-shadow part by the edge. Finally, the binary image is obtained by binarizing each part and merging them In this paper, we do comparative work on a group of binarization methods including our method, the method suggested by Zheng, the method using block binarization, and the method using labeling. The result shows that our method achieves better performance than others in most cases.

  • PDF

Reduction of the Number of Power States for High-level Power Models based on Clock Gating Enable Signals (클럭 게이팅 구동신호 기반 상위수준 전력모델의 전력 상태 수 감소)

  • Choi, Hosuk;Yi, Joonhwan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.28-35
    • /
    • 2015
  • In this paper, we propose to identify redundant power states of high-level power model based on clock gating enable signals(CGENs) using dependencies of Boolean functions and structural dependencies of clock gating cells. Three functional dependencies between two CGENs, namely equvalence, inversion, and inclusion, are used. Functions of CGENs in a circuit are represented by binary decision diagrams (BDDs) and the functional relations are used to reduce the number of power states. The structural dependency appears when a clock gating cell drives another clock gating cells in a circuit. Automatic dependency checking algorithm has been proposed. The experimental results show the average number of power state is reduced by 59%.

A Retrospective Statistical Analysis of Miniscalpel Needle Therapy for Herniated Intervertebral Disc or Spinal Stenosis

  • Kim, Jae Ik;Jeong, Jeong Kyo;Kim, Myung Kwan;Jeon, Ju Hyun;Kim, Eun Seok;Kim, Young Il
    • Journal of Acupuncture Research
    • /
    • v.35 no.4
    • /
    • pp.226-237
    • /
    • 2018
  • Background: This study examined the characteristics and prognosis of patients admitted to the Dunsan Korean medicine hospital for treatment of herniated intervertebral disc (HIVD) or spinal stenosis with Miniscalpel needle therapy (MSN). Methods: Patients were admitted to the Dunsan Korean medicine hospital from January 01, 2016 to September 30, 2017 for the treatment of HIVD or spinal stenosis with MSN. Crossover analysis, Independent sample t test, one-way ANOVA, multiple linear regression analysis, and binary logistic regression analysis were performed. Results: Crossover analysis showed statistically significant differences in treatment methods according to gender, current pain according to the disease duration, satisfaction of MSN according to disease duration, treatment methods, and intention of re-treatment with MSN according to treatment methods. Independent t test and one-way ANOVA showed that there was a difference in current Numeric Rating Scale (NRS) according to disease duration, and difference between discharge and current NRS, and number of MSN according to disease. Multiple linear regression analysis showed that age, disease duration, and number of MSN affect discharge NRS, disease duration, and number of MSN affect current NRS, and Western medical treatment after MSN, discharge NRS, and current NRS affect satisfaction of MSN. Binary logistic regression analysis showed that discharge NRS affects current pain, and gender, discharge NRS, and treatment methods affect intention of re-treatment with MSN. Conclusion: Characteristics, prognosis, satisfaction and variables affecting prognosis of MSN were statistically significant, indicating that more systematic studies are required to further examine the effects of MSN on HIVD or spinal stenosis.

Design and Implementation of Accelerator Architecture for Binary Weight Network on FPGA with Limited Resources (한정된 자원을 갖는 FPGA에서의 이진가중치 신경망 가속처리 구조 설계 및 구현)

  • Kim, Jong-Hyun;Yun, SangKyun
    • Journal of IKEEE
    • /
    • v.24 no.1
    • /
    • pp.225-231
    • /
    • 2020
  • In this paper, we propose a method to accelerate BWN based on FPGA with limited resources for embedded system. Because of the limited number of logic elements available, a single computing unit capable of handling Conv-layer, FC-layer of various sizes must be designed and reused. Also, if the input feature map can not be parallel processed at one time, the output must be calculated by reading the inputs several times. Since the number of available BRAM modules is limited, the number of data bits in the BWN accelerator must be minimized. The image classification processing time of the BWN accelerator is superior when compared with a embedded CPU and is faster than a desktop PC and 50% slower than a GPU system. Since the BWN accelerator uses a slow clock of 50MHz, it can be seen that the BWN accelerator is advantageous in performance versus power.

Heat Transfer Correlation to Predict the Evaporation of a Water Droplet in Superheated Steam during Reflood Phase of a LOCA

  • Kim, Yoo;Ban, Chang-Hwan
    • Journal of Energy Engineering
    • /
    • v.9 no.3
    • /
    • pp.261-268
    • /
    • 2000
  • A heat transfer correlation to predict the vaporization of a water droplet in highly superheated steam during a loss-of-coolant accident(LOCA) of a nuclear power plant is provided. Vaporization of liquid fuel or water droplets in superheated air or steam and subsequent interface heat transfer between a liquid droplet and superheated gas is typically correlated by way of a Nusselt number as a function of Reynolds number, Prantl number, and in some cases including mass transfer number. Presently available correlations and experimental data of the evaporation of liquid droplets in air or steam are analyzed and a new Nusselt number correlation is proposed taking Schmidt number into consideration in order to account for binary diffusion of the vapor as well, Nu$\_$f/(1+B)$\^$0.7/=2+0.53Sc$\_$f/$\^$-1/5/Re$\_$M/$\^$$\sfrac{1}{2}$/Pr$\_$f/$\^$$\sfrac{1}{3}$/ for which properties are evaluated at film condition except the density of Reynolds number evaluated at ambient condition. Diverse correlations for various combinations of liquid and gas species are put into single equation. The blowing correction factor of (1+B)$\^$0.7/ is confirmed appropriate, and a criterion to distinguish so-called high- and low-temperature condition of ambient gas is set forth.

  • PDF

Lineament Extraction from DEM Using Raindrop Tracing Algorithm

  • Yun, Sang-ho
    • Proceedings of the KSRS Conference
    • /
    • 1999.11a
    • /
    • pp.290-295
    • /
    • 1999
  • Lineament extraction from mountain area often provides valuable geological information. In many cases, the lineaments correspond to a series of continuous large valleys. This paper introduces a new lineament extraction method from Digital Elevation Model (DEM) using Raindrop Tracing Algorithm (RTA). The main advantage of this algorithm over conventional Segment Tracing Algorithm (STA) is that it utilizes DEM directly unlike the STA Which utilizes the shaded relief of DEM. The RTA simulates the real life of raindrops that converge into a large valley. The simulation has been done by sprinkling the randomized raindrops over DEM and counting the number of raindrop path that follows the negative gradient of the DEM. The large counting number indicates the location of a big valley where the raindrops converge. With the help of the counting number array (accumulator array) recording the flowing path information, RTA can produce perfectly unbiased binary image of the lineament.

  • PDF

A Scheduling Method on Parallel Computation Models with Limited Number of Processors Using Genetic Algorithms (프로세서의 수가 한정되어있는 병렬계산모델에서 유전알고리즘을 이용한 스케쥴링해법)

  • 성기석;박지혁
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.15-27
    • /
    • 1998
  • In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

  • PDF