• Title/Summary/Keyword: Encoding Speed

Search Result 174, Processing Time 0.027 seconds

Development of an Elastic Wave Sensor Including Rotary-encoding Capability (회전속도 측정 기능을 포함한 비접촉 탄성파 센서의 개발)

  • Lee, Ho-Cheol;Kim, Myong-Ho;Park, Jung-Yang
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.143-146
    • /
    • 2006
  • In this paper, a hybrid sensor is proposed that has two capabilities: The first is to sense longitudinal of flexural elastic waves selectively which are transmitted along the targe shaft, the second to measure the rotating speed of the shaft. All measurement are made in a noncontact manner since this sensor uses magnetostriction as its measuring principles. Furthermore, the switching between these two sensing capabilities are accomplished by a very simple mechanical operation. To verify the capabilities of the Proposed sensor, an Prototype sensor are fabricated and the experiments are made. The result shows this sensor can embody two sensing capabilities in one sensor configuration.

  • PDF

Effect on Preprocessing in SAT with Sudoku Puzzle (수도쿠 퍼즐을 통해서 살펴본 SAT에서 전처리 효과)

  • Kwon, Gi-Hwon
    • Journal of Information Technology Services
    • /
    • v.7 no.2
    • /
    • pp.127-135
    • /
    • 2008
  • The concept of preprocessing is widely used in various computer science area such as compiler and software engineering for the purpose of macro processing and optimization. In addition, preprocessing is also used in SAT solvers in order to eliminate redundant literals and clauses to speed up its solving time before searching the state space. However, there is an unexpected run-time error such as stack-overflow during this step, in case the size of a given set of clauses is huge which impedes SAT solvers. In this case, the preprocessing should be applied at the encoding time to optimize its size. In this paper this idea is applied to several Sudoku problems. As a result, significant improvements are obtained with respect to the number of variables and clauses as well as the solving time compared to the previous works.

A Design of Multi-Channel Biotelemetry for ECG Encoding and Transmission Over the Public Telephone Line (공중 전화회선용 다중 채널 ECG데이터 원격 측정시스템 설계)

  • Gye, Sin-Ung;Jang, Won-Seok;Hong, Seung-Hong
    • Journal of Biomedical Engineering Research
    • /
    • v.7 no.1
    • /
    • pp.21-34
    • /
    • 1986
  • In this paper, we described the ECG telemetry system via the Public Telephone Line. The system consist of a signal acquisition and measurement section, a signal processing section, and a signal transmission section. It used 8 bits microprocessor. The transmission section is composed of 3 ch. analog modulators and 1 ct. digital modem. Especially, using the digital modem, signal is transmitted with about 50n data reduction ratio by the TP (Turning Point) algorithm. The acoustic coupler or inductive coil for linking the public telephone line are used. The speed of the digital modem is 300 baud rate. The MCBS (Multi Channel Biotelemetry System) is tested and evaluated through the experiment.

  • PDF

An Integrated Planning of Production and Distribution in Supply Chain Management using a Multi-Level Symbiotic Evolutionary Algorithm (다계층 공생 진화알고리듬을 이용한 공급사슬경영의 생산과 분배의 통합계획)

  • 김여근;민유종
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.1-15
    • /
    • 2003
  • This paper presents a new evolutionary algorithm to solve complex multi-level integration problems, which is called multi-level symbiotic evolutionary algorithm (MEA). The MEA uses an efficient feedback mechanism to flow evolution information between and within levels, to enhance parallel search capability, and to improve convergence speed and population diversity. To show the MEA's applicability, It is applied to the integrated planning of production and distribution in supply chain management. The encoding and decoding methods are devised for the integrated problem. A set of experiments has been carried out, and the results are reported. The superiority of the algorithm's performance is demonstrated through experiments.

Fast Multiple Reference Frame Selection for H.264 Encoding (H.264 부호화를 위한 고속 다중 참조 화면 결정 기법)

  • Jeong, Jin-Woo;Cheo, Yoon-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.419-420
    • /
    • 2006
  • In the new video coding standard H.264/AVC, motion estimation (ME) is allowed to search multiple reference frames for improve the rate-distortion performance. The complexity of multi-frame motion estimation increases linearly with the number of used reference frame. However, the distortion gain given by each reference frame varies with the video sequence, and it is not efficient to search through all the candidate frames. In this paper, we propose a fast mult-frame selection method using all zero coefficient block (AZCB) prediction and sum of difference (SAD) of neighbor block. Simulation results show that the speed of the proposed algorithm is up to two times faster than exhaustive search of multiple reference frames with similar quality and bit-rate.

  • PDF

A Study of Efficient Search Location Model for East Search Algorithm

  • Kim, Jean-Youn;Hyeok Han;Park, Nho-Kyung;Yun, Eui-Jung;Jin, Hyun-Joon
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.43-45
    • /
    • 2000
  • For motion estimation, the block matching algorithm is widely used to improve the compression ratio of low bit-rate motion video. As a newly developed fast search algorithm, the nearest-neighbors search technique has a drawback of degrading video quality while providing fisher speed in search process. In this paper, a modified nearest-neighbors search algorithm is proposed in which a double rectangular shaped search-candidate area is used to improve video quality in encoding process with a small increasing of search time. To evaluate the proposed algorithm. other methods based on the nearest-neighbors search algorithm are investigated.

  • PDF

Analysis and Comparison of Error Detection and Correction Codes for the Memory of STSAT-3 OBC and Mass Data Storage Unit (과학기술위성 3호 탑재 컴퓨터와 대용량 메모리에 적용될 오류 복구 코드의 비교 및 분석)

  • Kim, Byung-Jun;Seo, In-Ho;Kwak, Seong-Woo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.2
    • /
    • pp.417-422
    • /
    • 2010
  • When memory devices are exposed to space environments, they suffer various effects such as SEU(Single Event Upset). Memory systems for space applications are generally equipped with error detection and correction(EDAC) logics against SEUs. In this paper, several error detection and correction codes - RS(10,8) code, (7,4) Hamming code and (16,8) code - are analyzed and compared with each other. Each code is implemented using VHDL and its performances(encoding/decoding speed, required memory size) are compared. Also the failure probability equation of each EDAC code is derived, and the probability value is analyzed for various occurrence rates of SEUs which the STSAT-3 possibly suffers. Finally, the EDAC algorithm for STSAT-3 is determined based on the comparison results.

Design Methodology of LDPC Codes based on Partial Parallel Algorithm (부분병렬 알고리즘 기반의 LDPC 부호 구현 방안)

  • Jung, Ji-Won
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.4
    • /
    • pp.278-285
    • /
    • 2011
  • This paper makes an analysis of the encoding structure and the decoding algorithm proposed by the DVB-S2 specification. The methods of implementing the LDPC decoder are fully serial decoder, the partially parallel decoder and the fully parallel decoder. The partial parallel scheme is the efficient selection to achieve appropriate trade-offs between hardware complexity and decoding speed. Therefore, this paper proposed an efficient memory structure for check node update block, bit node update block, and LLR memory.

An Enhancement of the Encoding Speed and a Compensation of Decoded Video Quality for H.263 Codec (H.263 압축 속도 향상과 영상 복원용 화질 보상 연구)

  • Yun, Seong-Gyu;Gang, Ui-Seon;Yu, Hwan-Jong;Im, Yeong-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.5
    • /
    • pp.402-411
    • /
    • 2001
  • H.263 압축 방식은 실현하는데 여러 가지 문제가 있지만 그 중에서 그 대표적인 것은 인코딩 과정에서의 압축 시간이 오래 걸린다는 것이고 다른 한 가지는 과도한 압축률에 의한 복원된 이미지 화질 저하이다. 이 논문에서는 H.263에서의 압축 속도 향상과 복원 이미지의 화질 이미지의 화질 보상에 대한 두 가지 새로운 방법을 제안하였다. 압축 속도를 향상시키기 위해서 움직임 벡터를 찾는 알고리즘을 개선하여 새로운 4단계 탐색 알고리즘을 제안하였다. 또한 화질을 보상하기 위해 디코더에서 블록 아티팩을 제거하고 복원 이미지를 선명하게 하는 알고리즘을 제안하였다. 여기서 화질 보상은 원본 이미지와 동일하게 만드는 것이 아니라 인간이 더 좋은 영상으로 인식하도록 하는 걸 목적으로 한다. 우리가 제한한 알고리즘에 의해서 압축 속도는 초당 2.5에서 17 프레임으로 증가하였고 블록 아티팩을 제거하고 명암 대비를 높임으로써 보기 좋은 영상을 제공하였다.

  • PDF

Optical Look-ahead Carry Full-adder Using Dual-rail Coding

  • Gil Sang Keun
    • Journal of the Optical Society of Korea
    • /
    • v.9 no.3
    • /
    • pp.111-118
    • /
    • 2005
  • In this paper, a new optical parallel binary arithmetic processor (OPBAP) capable of computing arbitrary n-bit look-ahead carry full-addition is proposed and implemented. The conventional Boolean algebra is considered to implement OPBAP by using two schemes of optical logic processor. One is space-variant optical logic gate processor (SVOLGP), the other is shadow-casting optical logic array processor (SCOLAP). SVOLGP can process logical AND and OR operations different in space simultaneously by using free-space interconnection logic filters, while SCOLAP can perform any possible 16 Boolean logic function by using spatial instruction-control filter. A dual-rail encoding method is adopted because the complement of an input is needed in arithmetic process. Experiment on OPBAP for an 8-bit look-ahead carry full addition is performed. The experimental results have shown that the proposed OPBAP has a capability of optical look-ahead carry full-addition with high computing speed regardless of the data length.