• Title/Summary/Keyword: table size

Search Result 634, Processing Time 0.031 seconds

A Rendezvous Router Decision Algorithm Considering Routing Table Size (라우팅 테이블의 크기를 고려한 랑데부 라우터 선정 알고리즘)

  • Cho, Kee-Seong;Jang, Hee-Seon;Kim, Dong-Whee
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.905-912
    • /
    • 2006
  • Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

Detection of Absolute Position for Magneto-Optical Encoder Using Linear Table Compensation (선형 테이블 보상법을 이용한 마그네틱-옵티컬 엔코더의 절대 위치 검출에 관한 연구)

  • Kim, Seul Ki;Kim, Hyeong Jun;Lee, Suk;Park, Sung Hyun;Lee, Kyung Chang
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.33 no.12
    • /
    • pp.1007-1013
    • /
    • 2016
  • This paper presents the development of a magneto-optical encoder for higher precision and smaller size. In general, optical encoders can have very high precision based on the position information of the slate, while their sizes tend to be larger due to the presence of complex and large components, such as an optical module. In contrast, magnetic encoders have exactly the opposite characteristics, i.e., small size and low precision. In order to achieve encoder features encompassing the advantages of both optical and magnetic encoders, i.e., high precision and small size, we designed a magneto-optical encoder and developed a method to detect absolute position, by compensating for the error of the hall sensor using the linear table compensation method. The performance of the magneto-optical encoder was evaluated through an experimental testbed.

Fingerprint region and table segmentation in fingerprint document (지문원지의 영역분할 및 도표 인식)

  • 정윤주;이영화;이준재;심재창
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.552-555
    • /
    • 1999
  • In this paper, a method for extracting the fingerprint regions and the table from fingerprint document which is the size of A4 including ten fingerprints images in a table is presented. The extraction of each fingerprint region is carried out by segmenting the foreground fingerprint region using a block filtering method and detecting its center point. The table extraction, by detecting a horizontal line using line tracing, and detecting a vertical line by its orthogonal equation. Here, T-shaped mask is proposed for finding the starting points of the vertical line intersecting horizontal line by the form of 'T'. Experimental results show above 95% correct rate of extracting the fingerprint region and table.

  • PDF

Low-power VLSI Architecture Design for Image Scaler and Coefficients Optimization (영상 스케일러의 저전력 VLSI 구조 설계 및 계수 최적화)

  • Han, Jae-Young;Lee, Seong-Won
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.6
    • /
    • pp.22-34
    • /
    • 2010
  • Existing image scalers generally adopt simple interpolation methods such as bilinear method to take cost-benefit, or highly complex architectures to achieve high quality resulting images. However, demands for a low power, low cost, and high performance image scaler become more important because of emerging high quality mobile contents. In this paper we propose the novel low power hardware architecture for a high quality raster scan image scaler. The proposed scaler architecture enhances the existing cubic interpolation look-up table architecture by reducing and optimizing memory access and hardware components. The input data buffer of existing image scaler is replaced with line memories to reduce the number of memory access that is critical to power consumption. The cubic interpolation formula used in existing look-up table architecture is also rearranged to reduce the number of the multipliers and look-up table size. Finally we analyze the optimized parameter sets of look-up table, which is a trade-off between quality of result image and hardware size.

Area Aware-DSDV Routing Protocol on Ad hoc Networking (Ad Hoc 망에서 AA-DSDV 라우팅 프로토콜)

  • Cho, Se-Hyun;Park, Hea-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.590-593
    • /
    • 2011
  • Time goes on, Ad Hoc network is hot issues. So far, there are a lot of protocols have been proposed for Ad Hoc routing protocol to support the mobility. This paper presents an enhanced DSDV(Destination-Sequenced Distance Vector) routing protocol which nominates one node to take care of a specific area. Simply Area-Aware(AA) DSDV routing protocol has one nominee to take care of some area. It has two jobs. One is to take care of its neighbour and another is to transfer the routing table to its other node as it works. It is called as Area Nominee(AN). The new scheme extends the routing table to include the nominee in the area. The general node is the same as the previous DSDV routing protocol. In the other hands, the node which is nominated has two routing protocols. One is for Regional Routing(RR) table which is the same routing table in DSDV. Another is Global Routing(GR) table which is about the area round its area which it cares nearby. GR table is the table for the designated node like the nominee. Each area has one nominee to transfer between ANs. It has only nominee's information about every area. This concept decreases the topology size and makes the information of topology more accurate.

Implementation of Look-Up Table for Quasi-Bi-Quadratic Interpolation Based on Least Square Approximation for LCD Displays (LCD 디스플레이 구동을 위한 최소 자승 근사에 의한 Quasi-Bi-Quadratic 보간법의 LUT 구현)

  • Park, Hee-Bum;Lee, Chul-Hee
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.425-426
    • /
    • 2006
  • Overdriving schemes are used to improve the response time of liquid crystal display. Typically they are implemented by using LUTs (look-up table) within an image processor. However, the size of LUT is limited by the physical memory size and system cost. In this paper, we present an improved method for LUT implementation using linear interpolation and piecewise least-square polynomial regression. Using the proposed method, the performance of LUT can be improved and memory size of that can be reduced.

  • PDF

Study on How the Height of the Table Influences of the Functional Ability Perfomence to Patients Group with Stroke (뇌졸중 환자군을 대상으로 한 작업대 높이가 수행도에 미치는 영향에 대한 연구)

  • Yu, Young-Yul;Kim, Hee-Soo
    • Journal of the Ergonomics Society of Korea
    • /
    • v.28 no.4
    • /
    • pp.9-15
    • /
    • 2009
  • Our study goal is to find out how the table height influences functional ability of upper extremity to patients with stroke when they are having therapy. In this study, we tested forty patients with stroke at the age of over sixty-five who do not have visual, auditory disability and have no difficulty in communicating and moving things by using upper extremity. And they were able to pinch grip in hospital. We used occupational table for occupational therapy as Lab Materials. We also used cube and pegs board to test upper extremity functional ability. We used occupational table for occupational therapy as Lab Materials and we used cube and pegs board to test upper extremity functional ability. The method is that we measured the recommended table height that takes the subjects' size into consideration and patients' preferred table height and therapists' preferred table height and we applied them and then we have done a comparative analysis and set significance level(p<0.05). As the result, we found the Statistically significant between the recommended height and the other two, which are patients' preferred height and therapists' preferred height. We also discovered that functional ability of upper extremity varies significantly depending on each table height. We came to a conclusion that the table height had effects on the upper extremity functional ability of patients with stroke who are over sixty-five years old. It is therefore considered that the proper table height is important to improve upper extremity functional ability of patients with stroke for their physical therapy.

Optimized Implementation of Lightweight Block Cipher PIPO Using T-Table (T-table을 사용한 경량 블록 암호 PIPO의 최적화 구현)

  • Minsig Choi;Sunyeop Kim;Insung Kim;Hanbeom Shin;Seonggyeom Kim;Seokhie Hong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.3
    • /
    • pp.391-399
    • /
    • 2023
  • In this paper, we presents for the first time an implementation using T-table for PIPO-64/128, 256 which are lightweight block ciphers. While our proposed implementation requires 16 T-tables, we show that the two types of T-tables are circulant and obtain variants implementations that require a smaller number of T-tables. We then discuss trade-off between the number of required T-tables (code size) and throughput by evaluating the throughput of the variant implementations on an Intel Core i7-9700K processor. The throughput-optimized versions for PIPO-64/128, 256 provide better throughput than TLU(Table-Look-Up) reference implementation by factors of 3.11 and 2.76, respectively, and bit-slice reference implementation by factors of 3.11 and 2.76, respectively.

A Fast IP Lookups using Dynamic Trie Compression (능동적 트라이 압축을 이용한 고속 IP 검색)

  • Oh, Seung-Hyun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.5
    • /
    • pp.453-462
    • /
    • 2003
  • IP address lookup of router searches and decide proper output link using destination address of IP packet that arrie into router. The IP address lookup is essential part in te development of high-speed router needed to high-speed backbone network as one of bottleneck of router performance. This paper introduces DTC data structure that can support gigabit IP address lookup by dynamic trie compression technique that just uses small memory in conventional Pentium CPU. When make a forwarding table by trie compression, the DTC can dynamically select a size of data structure with considering correlation between table's size and searching speed. Also, when compress the prefix trie, DTC makes IP address lookup on the forwarding table of a search on the high speed SRAM cache by minimizing the size of data structure reflecting the structure of the trie. In the experiment result, the DTC data structure recorded performance of maximum $12.5{\times}10^5$ LPS (lookup per second) in conventional Pentium CPU through a dynamic building of most suitable compression over variety of routing tables.

One-step Sample Size Determination for 2×2 Bioequivalence Study (2×2 생물학적 동등성 시험 적정 피험자 수의 간단한 계산 방법)

  • Lee, Young-Joo;Yi, Hong-Jae;Kim, Han-Gyul;Oh, Ju-Hee;Shin, Yong-Jun;Kim, Young-Gi;Kim, Sang-Nyun
    • Journal of Pharmaceutical Investigation
    • /
    • v.39 no.3
    • /
    • pp.217-219
    • /
    • 2009
  • There are several approaches to calculate a sample size for bioequivalence test. Among these approaches, sample sizes determination based on Schuirmann's two one-sided tests procedures has been used most popularly in case of 2${\times}$2 bioequivalence study. Here we proposed simple sample size table for conventional 2${\times}$2 bioequivalence test based on Schuirmann's two one-sided tests in accordance with Korean Guidelines for Bioequivalence Test. This table will allow researchers with a little statistical background to calculate the sample size for bioequivalence with easy process.