• Title/Summary/Keyword: Search Speed

Search Result 796, Processing Time 0.042 seconds

A Design of RS Decoder for MB-OFDM UWB (MB-OFDM UWB 를 위한 RS 복호기 설계)

  • Choi, Sung-Woo;Shin, Cheol-Ho;Choi, Sang-Sung
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2005.11a
    • /
    • pp.131-136
    • /
    • 2005
  • UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MB-OFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MB-OFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

  • PDF

A Genetic Algorithm for Scheduling Sequence-Dependant Jobs on Parallel Identical Machines (병렬의 동일기계에서 처리되는 순서의존적인 작업들의 스케쥴링을 위한 유전알고리즘)

  • Lee, Moon-Kyu;Lee, Seung-Joo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.3
    • /
    • pp.360-368
    • /
    • 1999
  • We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

  • PDF

Architecture of RS decoder for MB-OFDM UWB

  • Choi, Sung-Woo;Choi, Sang-Sung;Lee, Han-Ho
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.195-198
    • /
    • 2005
  • UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MBOFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MBOFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

  • PDF

A Study on the Evacuation Time by the Influence of Decreasing Visibility on Fire (화재시 가시도 변화에 따른 대피속도 산정에 관한 연구)

  • Rie, Dong-Ho;Park, Jong-Seung
    • Journal of the Korean Society of Safety
    • /
    • v.22 no.5
    • /
    • pp.21-26
    • /
    • 2007
  • The computer program is developed to simulate the evacauation time for a building which is made geometrically complex. The program is intended for use both as a search and a design tool to analyze the evacuation safety through a wide range of structure environments. The computer program has a function of importing FDS's result to each individual resident in the building. These attributes include a walking speed reduction by producing visibility reduction for each person on the fire. $A^*$ pathfinding algorithm is adopted to calculate the simulation of escape movement, overtaking, route deviation, and adjustments to individual speeds due to the proximity of crowd members. Finally, a case study for a theater is presented to compared the calculated evacuation time with SIMULEX in detail. This program contribute to a computer program that evaluates the evacuation time of individual occupants as they walk towards, and through the exits especially for building, underground spaces like a subway or tunnel.

Applications and Key Technologies of Biomimetic Underwater Robot for Naval Operations (생체모방형 수중로봇의 해양작전 운용개념 및 핵심소요기술)

  • Lee, Ki-Young
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.18 no.2
    • /
    • pp.189-200
    • /
    • 2015
  • This paper gives an overview on the some potential applications and key technologies of biomimetic underwater robot for naval operations. Unlike most manned underwater naval systems, biomimetic underwater robots can be especially useful in near-land or harbour areas due to their ability to operate in shallow water effectively. Biomimetic underwater robot provide advantages in reaching locations that would be difficult or too dangerous for a manned vehicle to reach, as well as providing a level of autonomy that can remove the requirement for dedicated human operator support. Using multiple or schools of underwater robots would provide increased flexibility for navigation, communication and surveillance ability. And it alleviate some of the restrictions associated with speed and endurance design constraints.

Improvement of Analysis of the Ship's Maneuverability at Early Design Stage (초기 계획 단계에서 선박조종성능 해석에 대한 정도향상 연구)

  • 이호영
    • Journal of the Korean Institute of Navigation
    • /
    • v.21 no.2
    • /
    • pp.11-17
    • /
    • 1997
  • In this paper, we studied to improve Inoue's[1] and Kijima's[2] model used to predict ship's manoeuvrability in initial design stage. To perform this work, we had PMM(Planar Motion Mechanism) test and rudder open water test for 12 Models of low-speed blunt-ship which have horn type rudder and bulb in afterbody. Using MMG(Mathematical Modelling Group) model, we analyzed hydrodynamic and MMG experimetnal coefficidnts used to search sensitivities and to estimate ship's manoeuvrability, adn the results are performed by the regression analysis of principle parameters. We varified them to analyze ship's manoeubbrability , had simulate manoeubrability to check revised MMG model and compared them wiht Inoue's method. the result of PMM test and sea trial. Then it is found that the revised method can predict the maneuverability more accurately even for an unstable ship.

  • PDF

Comparison of Go and C++ TBB on Parallel Processing (Go와 C++ TBB의 병렬처리 비교)

  • Park, Dong-Ha;Moon, Bong-Kyo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.04a
    • /
    • pp.64-67
    • /
    • 2017
  • Applying concurrent structure and parallel processing are a common issue for these day's programs. In this research, Dynamic Programming is used to compare the parallel performance of Go language and Intel C++ Thread Building Blocks. The experiment was performed on 4 core machine and its result contains execution time under Simultaneous Multi-Threading environment. Static Optimal Binary Search Tree was used as an example. From the result, the speed-up of Go was higher than the number of cores, and that of TBB was close to it. TBB performed better in general, but for larger scale, Go was partially faster than the other.

Structure-based Functional Discovery of Proteins: Structural Proteomics

  • Jung, Jin-Won;Lee, Weon-Tae
    • BMB Reports
    • /
    • v.37 no.1
    • /
    • pp.28-34
    • /
    • 2004
  • The discovery of biochemical and cellular functions of unannotated gene products begins with a database search of proteins with structure/sequence homologues based on known genes. Very recently, a number of frontier groups in structural biology proposed a new paradigm to predict biological functions of an unknown protein on the basis of its three-dimensional structure on a genomic scale. Structural proteomics (genomics), a research area for structure-based functional discovery, aims to complete the protein-folding universe of all gene products in a cell. It would lead us to a complete understanding of a living organism from protein structure. Two major complementary experimental techniques, X-ray crystallography and NMR spectroscopy, combined with recently developed high throughput methods have played a central role in structural proteomics research; however, an integration of these methodologies together with comparative modeling and electron microscopy would speed up the goal for completing a full dictionary of protein folding space in the near future.

Comparison and Analysis of Competition Strategies in Competitive Coevolutionary Algorithms (경쟁 공진화 알고리듬에서 경쟁전략들의 비교 분석)

  • Kim, Yeo Keun;Kim, Jae Yun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.1
    • /
    • pp.87-98
    • /
    • 2002
  • A competitive coevolutionary algorithm is a probabilistic search method that imitates coevolution process through evolutionary arms race. The algorithm has been used to solve adversarial problems. In the algorithms, the selection of competitors is needed to evaluate the fitness of an individual. The goal of this study is to compare and analyze several competition strategies in terms of solution quality, convergence speed, balance between competitive coevolving species, population diversity, etc. With two types of test-bed problems, game problems and solution-test problems, extensive experiments are carried out. In the game problems, sampling strategies based on fitness have a risk of providing bad solutions due to evolutionary unbalance between species. On the other hand, in the solution-test problems, evolutionary unbalance does not appear in any strategies and the strategies using information about competition results are efficient in solution quality. The experimental results indicate that the tournament competition can progress an evolutionary arms race and then is successful from the viewpoint of evolutionary computation.

A Design of Optimal GA-PI Controller of Power System with SVC to Improve System Stability (시스템 안정도 향상을 위하여 SVC를 포함한 전력계통의 최적 GA-PI 제어기 설계)

  • 정형환;허동렬;이종민;주석민
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.24 no.2
    • /
    • pp.63-71
    • /
    • 2000
  • This paper deals with a systematic approach to GA-PI controller design for static VAR compensator(SVC) using genetic algorithm(GA) to improve system stability. Genetic algorithms(GAs) are search algorithms based on the mechanics of natural selection and natural genetics. To verify the validity of the proposed method, investigated damping ratio of the eigenvalues of the electro-mechanical modes system with and without SVC. Also, we considered dynamic response of terminal speed deviation and terminal voltage deviation by applying a power fluctuation at heavy load, normal load and light to verify the robustness of the proposed. Thus, we proved usefulness of GA-PI controller design to improve the stability of single machine-bus with SVC system.

  • PDF