• Title/Summary/Keyword: area-time complexity

Search Result 238, Processing Time 0.026 seconds

Block Interpolation Search (블록 보간 탐색법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.157-163
    • /
    • 2017
  • The binary and interpolation search algorithms are the most famous among search area algorithms, the former running in $O(log_2n)$ on average, and the latter in $O(log_2log_2n)$ on average and O(n) at worst. Also, the interpolation search use only the probability of key value location without priori information. This paper proposes another search algorithm, which I term a 'hybrid block and interpolation search'. This algorithm employs the block search, a method by which MSB index of a data is determined as a block, and the interpolation search to find the exact location of the key. The proposed algorithm reduces the search range with priori information and search the reduced range with uninformed situation. Experimental results show that the algorithm has a time complexity of $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$ both on average and at worst through utilization of previously acquired information on the block search. The proposed algorithm has proved to be approximately 10 times faster than the interpolation search on average.

Digit-Serial Finite Field Multipliers for GF($3^m$) (GF($3^m$)의 Digit-Serial 유한체 곱셈기)

  • Chang, Nam-Su;Kim, Tae-Hyun;Kim, Chang-Han;Han, Dong-Guk;Kim, Ho-Won
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.10
    • /
    • pp.23-30
    • /
    • 2008
  • Recently, a considerable number of studies have been conducted on pairing based cryptosystems. The efficiency of pairing based cryptosystems depends on finite fields, similar to existing public key cryptosystems. In general, pairing based ctyptosystems are defined over finite fields of chracteristic three, GF($3^m$), based on trinomials. A multiplication in GF($3^m$) is the most dominant operation. This paper proposes a new most significant digit(MSD)-first digit- serial multiplier. The proposed MSD-first digit-serial multiplier has the same area complexity compared to previous multipliers, since the modular reduction step is performed in parallel. And the critical path delay is reduced from 1MUL+(log ${\lceil}n{\rceil}$+1)ADD to 1MUL+(log ${\lceil}n+1{\rceil}$)ADD. Therefore, when the digit size is not $2^k$, the time delay is reduced by one addition.

Efficient Cooperative Transmission Scheme for High Speed WPAN System in 60GHz (60GHz WPAN 시스템의 전송 효율 향상을 위한 협력 통신 기법)

  • Lee, Won-Jin;Lee, Jae-Young;Suh, Young-Kil;Heo, Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3C
    • /
    • pp.255-263
    • /
    • 2010
  • In this paper, we present an efficient cooperative transmission scheme for high speed 60GHz WPAN system. In 60GHz, the cooperative transmission with relay is effective scheme because signals are exceedingly attenuated according to the distance and the transmission is impossible when there is no LOS between transmitter and receiver. Moreover, the reliability of signal in destination can be improved by receiving data from a relay as well as a transmitter. However, the overall data rate is reduced because transmission time is more required for relay. To solve this problem, we propose a cooperative transmission scheme with RS-CC serial concatenated codes. In the proposed cooperative transmission scheme, the relay can reduce the transmission data size because the only parity bits of systematic RS code are transmitted after encoding by CC. But the computational complexity is increased at the relay and the destination.

User's responses to the type of campus layouts -Based on perceived safety and landscape visual preferences- ([캠퍼스 공간설계 유형에 따른 이용자의 지각반응특성에 관한 연구-안전지각과 시각선호에 대한 비교 분석-)

  • 엄붕훈;한성미
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.25 no.2
    • /
    • pp.104.1-104.1
    • /
    • 1997
  • The purpose of this study is to grasp the characteristics of user''''s response to perceived safety and visual preferences for outdoor green spaces by the types of campus layouts. This research was investigated by color slide ratings and questionnaire survey to the students who are majoring in Landscape architecture in three universities locating at Taegu area. Two research sites have similarities in many ways but have differences in campus land form and design type such as ''''Closed'''' and ''''Open'''' types. Major results were summarised as follows ; 1. As a result of the slide test, the high degree of visual preference was shown in the campus that is ''''Closed'''' type. However the degree of perceived safety was lower than that of in Youngnam Univ. campus. 2. According to the result of the comparative analysis between user''''s perceived safety and visual preferences in each campus, the degree of perceived safety at ''''Closed'''' type was lower than that of ''''Open'''' type, but the degree of visual satisfactioni was higher at ''''Closed'''' type. 3. The factors affecting visual preference in campus were shown as density of wood, land form, and diverse type of the spaces. On the other hand, the factors affecting perceived safety were ''''enclosed space by wood'''' at the day time, and ''''the condition of lighting'''' at night. 4. Regarding gender differences in sensation of each space variables, female users showed higher satisfactio on the scenic beauty. 5. Regression analysis showed that general satisfation was determined by the variables such as ''''arrangement'''', familiarity'''', ''''cleanness'''', and ''''closed feeling'''', in Kyungbook Univ. And in Youngnam Univ. , the variables were ''''texture'''', ''''perceived beauty'''', ''''cleanness'''', and ''''complexity'''' respectively. 6. In conclusion, campus users wanted the outdoor spaces that have various land form and somewhat ''''open-closed'''' mixture type, which has a good ''''Edge Effect'''' to satisfy both aspects in safety and visual preferneces.

User's responses to the type of campus layouts -Based on perceived safety and landscape visual preferences- ("캠퍼스" 공간설계 유형에 따른 이용자의 지각반응특성에 관한 연구-안전지각과 시각선호에 대한 비교 분석-)

  • 엄붕훈;한성미
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.25 no.2
    • /
    • pp.104-116
    • /
    • 1997
  • The purpose of this study is to grasp the characteristics of user's response to perceived safety and visual preferences for outdoor green spaces by the types of campus layouts. This research was investigated by color slide ratings and questionnaire survey to the students who are majoring in Landscape architecture in three universities locating at Taegu area. Two research sites have similarities in many ways but have differences in campus land form and design type such as 'Closed' and 'Open' types. Major results were summarised as follows ; 1. As a result of the slide test, the high degree of visual preference was shown in the campus that is 'Closed' type. However the degree of perceived safety was lower than that of in Youngnam Univ. campus. 2. According to the result of the comparative analysis between user's perceived safety and visual preferences in each campus, the degree of perceived safety at 'Closed' type was lower than that of 'Open' type, but the degree of visual satisfactioni was higher at 'Closed' type. 3. The factors affecting visual preference in campus were shown as density of wood, land form, and diverse type of the spaces. On the other hand, the factors affecting perceived safety were 'enclosed space by wood' at the day time, and 'the condition of lighting' at night. 4. Regarding gender differences in sensation of each space variables, female users showed higher satisfactio on the scenic beauty. 5. Regression analysis showed that general satisfation was determined by the variables such as 'arrangement', familiarity', 'cleanness', and 'closed feeling', in Kyungbook Univ. And in Youngnam Univ. , the variables were 'texture', 'perceived beauty', 'cleanness', and 'complexity' respectively. 6. In conclusion, campus users wanted the outdoor spaces that have various land form and somewhat 'open-closed' mixture type, which has a good 'Edge Effect' to satisfy both aspects in safety and visual preferneces.

  • PDF

Efficient Radio Resource Allocation for Cognitive Radio Based Multi-hop Systems (다중 홉 무선 인지 시스템에서 효과적인 무선 자원 할당)

  • Shin, Jung-Chae;Min, Seung-Hwa;Cho, Ho-Shin;Jang, Youn-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5A
    • /
    • pp.325-338
    • /
    • 2012
  • In this paper, a radio resource allocation scheme for a multi-hop relay transmission in cognitive radio (CR) system is proposed to support the employment of relay nodes in IEEE 802.22 standard for wireless regional area network (WRAN). An optimization problem is formulated to maximize the number of serving secondary users (SUs) under system constraints such as time-divided frame structure for multiplexing and a single resource-unit to every relay-hop. However, due to mathematical complexity, the optimization problem is solved with a sub-optimal manner instead, which takes three steps in the order of user selection, relay/path selection, and frequency selection. In the numerical analysis, this proposed solution is evaluated in terms of service rate denoting as the ratio of the number of serving SUs to the number of service-requesting SUs. Simulation results show the condition of adopting multi-hop relay and the optimum number of relaying hops by comparing with the performance of 1-hop system.

Hierarchical Search-based Fast Schemes for Consecutive Block Error Concealment (연속된 블록 오류 은닉을 위한 계층 탐색 기반의 고속 알고리즘)

  • Jeon Soo-Yeol;Sohn Chae-Bong;Oh Seoung-Jun;Ahn Chang-Beom
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.446-454
    • /
    • 2004
  • With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

A New Parallel Multiplier for Type II Optimal Normal Basis (타입 II 최적 정규기저를 갖는 유한체의 새로운 병렬곱셈 연산기)

  • Kim Chang-Han;Jang Sang-Woon;Lim Jong-In;Ji Sung-Yeon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.4
    • /
    • pp.83-89
    • /
    • 2006
  • In H/W implementation for the finite field, the use of normal basis has several advantages, especially, the optimal normal basis is the most efficient to H/W implementation in GF($2^m$). In this paper, we propose a new, simpler, parallel multiplier over GF($2^m$) having a type II optimal normal basis, which performs multiplication over GF($2^m$) in the extension field GF($2^{2m}$). The time and area complexity of the proposed multiplier is same as the best of known type II optimal normal basis parallel multiplier.

Automated 3D scoring of fluorescence in situ hybridization (FISH) using a confocal whole slide imaging scanner

  • Ziv Frankenstein;Naohiro Uraoka;Umut Aypar;Ruth Aryeequaye;Mamta Rao;Meera Hameed;Yanming Zhang;Yukako Yagi
    • Applied Microscopy
    • /
    • v.51
    • /
    • pp.4.1-4.12
    • /
    • 2021
  • Fluorescence in situ hybridization (FISH) is a technique to visualize specific DNA/RNA sequences within the cell nuclei and provide the presence, location and structural integrity of genes on chromosomes. A confocal Whole Slide Imaging (WSI) scanner technology has superior depth resolution compared to wide-field fluorescence imaging. Confocal WSI has the ability to perform serial optical sections with specimen imaging, which is critical for 3D tissue reconstruction for volumetric spatial analysis. The standard clinical manual scoring for FISH is labor-intensive, time-consuming and subjective. Application of multi-gene FISH analysis alongside 3D imaging, significantly increase the level of complexity required for an accurate 3D analysis. Therefore, the purpose of this study is to establish automated 3D FISH scoring for z-stack images from confocal WSI scanner. The algorithm and the application we developed, SHIMARIS PAFQ, successfully employs 3D calculations for clear individual cell nuclei segmentation, gene signals detection and distribution of break-apart probes signal patterns, including standard break-apart, and variant patterns due to truncation, and deletion, etc. The analysis was accurate and precise when compared with ground truth clinical manual counting and scoring reported in ten lymphoma and solid tumors cases. The algorithm and the application we developed, SHIMARIS PAFQ, is objective and more efficient than the conventional procedure. It enables the automated counting of more nuclei, precisely detecting additional abnormal signal variations in nuclei patterns and analyzes gigabyte multi-layer stacking imaging data of tissue samples from patients. Currently, we are developing a deep learning algorithm for automated tumor area detection to be integrated with SHIMARIS PAFQ.

Design of XOR Gate Based on QCA Universal Gate Using Rotated Cell (회전된 셀을 이용한 QCA 유니버셜 게이트 기반의 XOR 게이트 설계)

  • Lee, Jin-Seong;Jeon, Jun-Cheol
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.3
    • /
    • pp.301-310
    • /
    • 2017
  • Quantum-dot cellular automata(QCA) is an alternative technology for implementing various computation, high performance, and low power consumption digital circuits at nano scale. In this paper, we propose a new universal gate in QCA. By using the universal gate, we propose a novel XOR gate which is reduced time/hardware complexity. The universal gate can be used to construct all other basic logic gates. Meanwhile, the proposed universal gate is designed by basic cells and a rotated cell. The rotated cell of the proposed universal gate is located at the central of 3-input majority gate structure. In this paper, we propose an XOR gate using three universal gates, although more than five 3-input majority gates are used to design an XOR gate using the 3-input majority gate. The proposed XOR gate is superior to the conventional XOR gate in terms of the total area and the consumed clock because the number of gates are reduced.