• Title/Summary/Keyword: 하드웨어 구조

Search Result 1,786, Processing Time 0.027 seconds

A Design and Implementation of the Management Sever for the Gateway Supporting Home Networking Using the UML (UML을 이용한 흠 네트워킹 지원 게이트웨이 관리 서버 설계 및 구현)

  • 권진혁;민병조;강명석;남의석;김학배
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.3
    • /
    • pp.393-404
    • /
    • 2004
  • Recently, public home have used a more than two computer connected with network, and several home appliances using independently with internet or network are developing to be related closely with the network. Therefore, the home utilized for a simple terminal of the global network in the past is being expanded to another part of the sub network. For a variety of connecting home-area protocols with the existing existing network, we require a new Residential Gateway(RG) that does not only make the home-area network operating in the sub network but also connects to the external network. In this paper, RG has intrinsic limits against flexible service due to IP address assignment and hardware capacity. In order to solve this problem in the RG, we propose a Management Server(MS). The MS that offers the integrated managements and control services for a variety of devices connected the RG in the home-area. It can not only solve the dynamic IP address assigning problem but also assigns private IP addresses to the home network devices through the Network Address Translation(NAT). It also provides somewhat useful functions for the home network and the RG for other additional services. <중략> The MS is using a SNMP protocol for managing the RG in the domain, a polling method of the MS and the RG compose a sequence polling method, a polling method using a multi-process and a multi-thread. In this paper, we introduce a problem with polling method separately, show a polling method between the MS and the RG using a multi-thread.

  • PDF

GPS L5 Signal Tracking Scheme Using GPS L1 Signal Tracking Results (GPS L1 신호추적 결과를 이용한 GPS L5 신호추적 기법)

  • Joo, Inone;Lee, Sanguk
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.99-104
    • /
    • 2012
  • The United States will proceed with the effort to modernize the GPS system, and one of its main content is to provide L5 signal. L5 will be transmitted in a radio band reserved exclusively for aviation safety services. And, L5, in combination with L1, will improve the position accuracy via ionospheric correction and robustness via signal redundancy. However, The acquisition processing time of L5 takes longer than that of L1 as the code length of L5 is 10 times longer than that of L1. To reduce this acquisition processing time, a higher number of correlators in the aquisition module should be used. However, there is a problem that this causes increase in the complexity of the correlator configuration and the computation power. So, in this paper, we propose L5 signal tracking scheme using tracking results in the GPS L1/L5 receiver. The proposed scheme could reduce the hardware complexity as the GPS L5 signal acquisition module is not needed, and provide fast and stable tracking of L5 signal by aiding L1 tracking results such as PRN, the code phase synchronization, and the Doppler frequency. The feasibility of the proposed scheme is demonstrated through simulation results.

Serialized Multitasking Code Generation from Dataflow Specification (데이타 플로우 명세로부터 직렬화된 멀티태스킹 코드 생성)

  • Kwon, Seong-Nam;Ha, Soon-Hoi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.9_10
    • /
    • pp.429-440
    • /
    • 2008
  • As embedded system becomes more complex, software development becomes more important in the entire design process. Most embedded applications consist of multi -tasks, that are executed in parallel. So, dataflow model that expresses concurrency naturally is preferred than sequential programming language to develop multitask software. For the execution of multitasking codes, operating system is essential to schedule multi-tasks and to deal with the communication between tasks. But, it is needed to execute multitasking code without as when the target hardware platform cannot execute as or target platforms are candidates of design space exploration, because it is very costly to port as for all candidate platforms of DSE. For this reason, we propose the serialized multitasking code generation technique from dataflow specification. In the proposed technique, a task is specified with dataflow model, and generated as a C code. Code generation consists of two steps: First, a block in a task is generated as a separate function. Second, generated functions are scheduled by a multitasking scheduler that is also generated automatically. To make it easy to write customized scheduler manually, the data structure and information of each task are defined. With the preliminary experiment of DivX player, it is confirmed that the generated code from the proposed framework is efficiently and correctly executed on the target system.

A 16 bit FPGA Microprocessor for Embedded Applications (실장제어 16 비트 FPGA 마이크로프로세서)

  • 차영호;조경연;최혁환
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.7
    • /
    • pp.1332-1339
    • /
    • 2001
  • SoC(System on Chip) technology is widely used in the field of embedded systems by providing high flexibility for a specific application domain. An important aspect of development any new embedded system is verification which usually requires lengthy software and hardware co-design. To reduce development cost of design effort, the instruction set of microprocessor must be suitable for a high level language compiler. And FPGA prototype system could be derived and tested for design verification. In this paper, we propose a 16 bit FPGA microprocessor, which is tentatively-named EISC16, based on an EISC(Extendable Instruction Set Computer) architecture for embedded applications. The proposed EISC16 has a 16 bit fixed length instruction set which has the short length offset and small immediate operand. A 16 bit offset and immediate operand could be extended using by an extension register and an extension flag. We developed a cross C/C++ compiler and development software of the EISC16 by porting GNU on an IBM-PC and SUN workstation and compared the object code size created after compiling a C/C. standard library, concluding that EISC16 exhibits a higher code density than existing 16 microprocessors. The proposed EISC16 requires approximately 6,000 gates when designed and synthesized with RTL level VHDL at Xilinix's Virtex XCV300 FPGA. And we design a test board which consists of EISC16 ROM, RAM, LED/LCD panel, periodic timer, input key pad and RS-232C controller. 11 works normally at 7MHz Clock.

  • PDF

Research on 3D software characteristics suitable for university (대학 3D애니메이션 교육에 적합한 소프트웨어 특성 연구:Autodesk사의 Maya와 3ds Max를 중심으로)

  • Kwon, Dong-Hyun
    • Cartoon and Animation Studies
    • /
    • s.16
    • /
    • pp.223-243
    • /
    • 2009
  • Computer graphic where the most useful and effective production methods are used for animation or films has expanded into actors' performance beyond object expression, background expression and special effect. Unlike 2D drawing software focusing on user's sense, 3D mainly depends on hardware performance and software functions. Therefore, for 3D users, learning 3D functions is directly related to new expression, and quick learning and effective representation are keys to productivity growth in animation industry. In line with industrial needs, basic 3D animation software training is provided in school. Unfortunately, however, many problems such as lack of professional instructors, time allocation and education environment prevent various 3D animation software from being taught. Moreover, functional use does not live up to industrial rapid trends. In order to improve effects of software functional education in restricted education fields, this research aims to find out what functions of 3D animation software are used in industries, what are those function used for, and how schools provide 3D animation software training.

  • PDF

Design and Implementation of Preemptive EDF Scheduling Algorithm in TinyOS (TinyOS에서의 선점적 EDF 스케줄링 알고리즘 설계 및 구현)

  • Yoo, Jong-Sun;Kim, Byung-Kon;Choi, Byoung-Kyu;Heu, Shin
    • The KIPS Transactions:PartA
    • /
    • v.18A no.6
    • /
    • pp.255-264
    • /
    • 2011
  • A sensor network is a special network that makes physical data sensed by sensor nodes and manages the data. The sensor network is a technology that can apply to many parts of field. It is very important to transmit the data to a user at real-time. The core of the sensor network is a sensor node and small operating system that works in the node. TinyOS developed by UC Berkeley is a sensor network operating system that used many parts of field. It is event-driven and component-based operating system. Basically, it uses non-preemptive scheduler. If an urgent task needs to be executed right away while another task is running, the urgent one must wait until another one is finished. Because of that property, it is hard to guarantee real-time requirement in TinyOS. According to recent study, Priority Level Scheduler, which can let one task preempt another task, was proposed in order to have fast response in TinyOS. It has restrictively 5 priorities, so a higher priority task can preempt a lower priority task. Therefore, this paper suggests Preemptive EDF(Earliest Deadline First) Scheduler that guarantees a real-time requirement and reduces average respond time of user tasks in TinyOS.

Direction-Embedded Branch Prediction based on the Analysis of Neural Network (신경망의 분석을 통한 방향 정보를 내포하는 분기 예측 기법)

  • Kwak Jong Wook;Kim Ju-Hwan;Jhon Chu Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.1
    • /
    • pp.9-26
    • /
    • 2005
  • In the pursuit of ever higher levels of performance, recent computer systems have made use of deep pipeline, dynamic scheduling and multi-issue superscalar processor technologies. In this situations, branch prediction schemes are an essential part of modem microarchitectures because the penalty for a branch misprediction increases as pipelines deepen and the number of instructions issued per cycle increases. In this paper, we propose a novel branch prediction scheme, direction-gshare(d-gshare), to improve the prediction accuracy. At first, we model a neural network with the components that possibly affect the branch prediction accuracy, and analyze the variation of their weights based on the neural network information. Then, we newly add the component that has a high weight value to an original gshare scheme. We simulate our branch prediction scheme using Simple Scalar, a powerful event-driven simulator, and analyze the simulation results. Our results show that, compared to bimodal, two-level adaptive and gshare predictor, direction-gshare predictor(d-gshare. 3) outperforms, without additional hardware costs, by up to 4.1% and 1.5% in average for the default mont of embedded direction, and 11.8% in maximum and 3.7% in average for the optimal one.

Design and Implementation of a High-Performance Index Manager in a Main Memory DBMS (주기억장치 DBMS를 위한 고성능 인덱스 관리자의 설계 및 구현)

  • Kim, Sang-Wook;Lee, Kyung-Tae;Choi, Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7B
    • /
    • pp.605-619
    • /
    • 2003
  • The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss the index manager of the Tachyon, a next-generation MMDBMS. Recently, the gap between the CPU processing and main memory access times is becoming much wider due to rapid advance of CPU technology. By devising data structures and algorithms that utilize the behavior of the cache in CPU, we are able to enhance the overall performance of MMDBMSs considerably. In this paper, we address the practical implementation issues and our solutions for them obtained in developing the cache-conscious index manager of the Tachyon. The main issues touched are (1) consideration of the cache behavior, (2) compact representation of the index entry and the index node, (3) support of variable-length keys, (4) support of multiple-attribute keys, (5) support of duplicated keys, (6) definition of the system catalog for indexes, (7) definition of external APIs, (8) concurrency control, and (9) backup and recovery. We also show the effectiveness of our approach through extensive experiments.

An Effective Method to Treat The Boundary Pixels for Image Compression with DWT (DWT를 이용한 영상압축을 위한 경계화소의 효과적인 처리방법)

  • 서영호;김종현;김대경;유지상;김동욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6A
    • /
    • pp.618-627
    • /
    • 2002
  • In processing images using 2 dimensional Discrete Wavelet Transform(2D-DWT), the method to process the pixels around the image boundary may affect the quality of image and the cost to implement in hardware and software. This paper proposed an effective method to treat the boundary pixels, which is apt to implement in hardware and software without losing the quality of the image costly. This method processes the 2-D image as 1-D array so that 2-D DWT is performed by considering the image with the serial-sequential data structure (Serial-Sequential Processing). To show the performance and easiness in implementation of the proposed method, an image compression codec which compresses image and reconstructs it has been implemented and experimented. It included log-scale fried quantizer, but the entropy coder was not implemented. From the experimental results, the proposed method showed the SNR of almost the same SNR(Signal to Noise Ratio) to the Periodic Expansion(PE) method when the compression ratio(excluding entropy coding) of 2:1, 15.3% higher than Symmetric Expansion(SE) method, and 9.3% higher than 0-pixel Padding Expansion(ZPE) method. Also PE method needed 12.99% more memory space than the proposed method. By considering only the compression process, SE and ZPE methods needed additional operations than the proposed one. In hardware implementation, the proposed method in this paper had 5.92% of overall circuit as the control circuit, while SE, PE, and ZPE method has 22%, 21,2%, and 11.9% as the control circuit, respectively. Consequently, the proposed method can be thought more effective in implementing software and hardware without losing any image quality in the usual image processing applications.

Low Power Implementation of Integrated Cryptographic Engine for Smart Cards (스마트카드 적용을 위한 저전력 통합 암호화 엔진의 설계)

  • Kim, Yong-Hee;Jeong, Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.6
    • /
    • pp.80-88
    • /
    • 2008
  • In this paper, the block cipher algorithms, 3-DES(Triple Data Encryption Standard), AES(Advanced Encryption Standard), SEED, HASH(SHA-1), which are domestic and international standards, have been implemented as an integrated cryptographic engine for smart card applications. For small area and low power design which are essential requirements for portable devices, arithmetic resources are shared for iteration steps in each algorithm, and a two-level clock gating technique was used to reduce the dynamic power consumption. The integrated cryptographic engine was verified with ALTERA Excalbur EPXA10F1020C device, requiring 7,729 LEs(Logic Elements) and 512 Bytes ROM, and its maximum clock speed was 24.83 MHz. When designed by using Samsung 0.18 um STD130 standard cell library, the engine consisted of 44,452 gates and had up to 50 MHz operation clock speed. It was estimated to consume 2.96 mW, 3.03 mW, 2.63 mW, 7.06 mW power at 3-DES, AES, SEED, SHA-1 modes respectively when operating at 25 MHz clock. We found that it has better area-power optimized structure than other existing designs for smart cards and various embedded security systems.