• Title/Summary/Keyword: 다중블록

Search Result 481, Processing Time 0.026 seconds

Block Error Performance of Orthogonal Multicarrier 16 QAM Signal in a Frequency Selective Rician Fading Environment (주파수 선택성 라이시안 페이딩 환경에서 직교 다중반송파 16 QAM 신호의 블록 오류율 성능)

  • Kim Young-Chul;Kang Duk-Keun
    • Journal of Digital Contents Society
    • /
    • v.5 no.1
    • /
    • pp.28-34
    • /
    • 2004
  • In this paper, we have analyzed the block error probability of orthogonal multicarrier 16 QAM signal in a frequency selective Rician fading environment. The block error probability is evaluated with several parameters such as normalized propagation delay $(\gamma/T_S),$, bit energy to noise power ratio $(E_b/N_0),$ and desired signal to undesired signal power ratio (DUR) in fast fading and slow fading channels. In the fast fading channel, The result shows that the block error probability rather in the fast fading channel achieves better performance than in the slow fading channel, when the error correction capability is one or two.

  • PDF

Blockchain-based multi-IoT verification model for overlay cloud environments (오버레이 클라우드 환경을 위한 블록체인 기반의 다중 IoT 검증 모델)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol
    • Journal of Digital Convergence
    • /
    • v.19 no.4
    • /
    • pp.151-157
    • /
    • 2021
  • Recently, IoT technology has been applied to various cloud environments, requiring accurate verification of various information generated by IoT devices. However, due to the convergence of IoT technologies and 5G technologies, accurate analysis is required as IoT information processing is rapidly processed. This paper proposes a blockchain-based multi-IoT verification model for overlay cloud environments. The proposed model multi-processes IoT information by further classifying IoT information two layers (layer and layer) into bits' blockchain to minimize the bottleneck of overlay networks while ensuring the integrity of information sent and received from embedded IoT devices within local IoT groups. Furthermore, the proposed model allows the layer to contain the weight information, allowing IoT information to be easily processed by the server. In particular, transmission and reception information between IoT devices facilitates server access by distributing IoT information from bits into blockchain to minimize bottlenecks in overlay networks and then weighting IoT information.

Sound Synthesis using Block & Moving Ball (블록과 움직이는 공을 이용한 사운드 신디시스)

  • Chang, Kyu-Sik;Jang, Dong-Hun;Kim, Tae-Yong
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02b
    • /
    • pp.292-297
    • /
    • 2007
  • 터치스크린을 통한 유저의 입력은 미디신호로 변환되며 생성된 블록은 하나의 음표 또는 다수의 음표로 남게 되며 유저가 설정한 타임라인의 빠르기에 따라 입력된 블록 위치의 음계 값을 토대로 소프트웨어 신디사이저의 오실 레이터에서 생성된 소리를 스피커로 출력해 낸다. 블록은 서로 다른 색깔의 8개의 미디채널로 존재하여 각 채널을 레이어 시켜 다른 블록을 생성하여 사인파, 톱니파, 삼각파, 사각파등을 엔벨로프 변형을 통해 만든 10가지 다른 소리로 지정하여 넣을 수 있다. 미디의 멀티채널방식을 이용해 다중 레이어의 입력방식을 취했으며, 관객은 작곡 모드에서는 일정한 패턴을 가진 단음이나 화성을, 게임모드에서는 생성된 공이 블록을 부딪치며 예측하기 어렵게 생성된 단음이나 화성음을 만들 수 있다. 생성한 음이 재생될 때에는 생성된 음정의 주파수 값과 음량에 따라서 RGB LED 조명이 반응을 하며 유저가 생성시킨 독특한 음악 진행에 따라 조명의 밝기와 색깔이 바뀌게 된다.

  • PDF

An improved error concealment method for H.264 using the MME and the OBMA (MME와 OBMA를 이용한 H.264를 위한 개선된 에러은닉 방법)

  • Cho, Sang-Hyup;Myung, Sung-Hyun;Kim, Dong-Hyung;Jeong, Je-Chang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2005.11a
    • /
    • pp.43-46
    • /
    • 2005
  • H.264/AVC 동영상 부호화 표준에서는 새로운 부호화 도구들이 추가되었으며 이를 통해 이전의 동영상 표준과 비교하여 높은 압축 효율을 가진다. 특히, VBS(Variable Blok Size)와 다중 참조 프레임의 사용으로 H.264내의 매크로블록은 이전의 부호화 표준들에 비하여 보다 많은 정보들을 포함한다. H.264 부호화 표준에서는 하나의 매크로블록이 최대 16개까지의 서로 다른 움직임 벡터를 가질 수 있으며 최대 4개의 서로 다른 참조프레임을 가질 수 있다. 또한 다양한 블록크기로의 움직임 추정을 하며 이는 매크로블록 모드로서 정의된다. 따라서 H.264내의 매크로블록은 기존의 동영상 부호화 표준보다 많은 움직임 벡터를 가질 뿐만 아니라 기존에는 없던 참조프레임과 매크로블록 모드의 정보를 새로이 포함하고 있다. 본 논문은 H.264 부호화 표준의 특성을 고려하여 매크로블록이 포함하고 있는 다양한 크기의 움직임 벡터 및 참조 프레임뿐 아니라 주변 매크로블록들의 모드를 이용하여 손실된 매크로블록에 대해 에러를 은닉함으로써 매크로블록이 포함하고 있는 정보를 최대한 활용하는 효율적인 에러은닉 알고리즘을 제안한다.

  • PDF

A RSA Multisignature Scheme using Message Partition (메시지 분할을 이용한 RSA 다중서명 방식)

  • Jang, Jong-Sung;Chung, Kwang-Sik;Shon, Jin-Gon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.1099-1102
    • /
    • 2005
  • 다중서명에서는 보안적 요소뿐만 아니라 다중서명의 길이, 다중서명의 생성 및 검증 시간, 복호화 시간, 통신량 등도 중요한 요소이다. 기존의 RSA를 그대로 이용한 RSA 원형 다중서명 방식과 RSA를 변형하여 적용한 RSA 변형 다중서명 방식은 다중서명의 생성 및 검증 시간이 각각의 개인서명을 생성하고 검증하는 시간의 합과 비례하여 증가한다는 문제점이 있다. 본 논문은 서명자의 수만큼 분할된 각각의 부분메시지에 대해 RSA 방식을 이용하여 제각기 서명하는 다중서명 방식을 제안한다. 제안된 메시지 분할을 이용한 RSA 다중서명 방식은 블록의 수가 증가하지 않는 경우 기존 방식에 비해 다중서명의 길이가 증가하지 않으면서, 다중서명의 생성 및 검증 시간이 각각 $\frac{1}{L}$로 감소하고, 복호화 시간과 통신량은 각각 약 $\frac{1}{2}{\sim}\frac{1}{L}$로 감소한다.

  • PDF

Fault-Tolerant Adaptive Routing : Improved RIFP by using SCP in Mesh Multicomputers (적응적 오류 허용 라우팅 : SCP를 이용한 메쉬 구조에서의 RIFP 기법 개선)

  • 정성우;김성천
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.11
    • /
    • pp.603-609
    • /
    • 2003
  • Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.

A Simple Multi-rate Parallel Interference Canceller for the IMT-2000 3GPP System (IMT-2000 3GPP 시스템을 위한 간단한 다중 전송률 병렬형 간섭제거기)

  • Kim, Jin-Kyeom;Oh, Seong-Keun;Sunwoo, Myung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.12
    • /
    • pp.10-19
    • /
    • 2001
  • In this paper, we propose an effective but simple multi-rate parallel interference canceller(PIC) for the international mobile telecommunications-2000(IMT-2000) 3rd generation partnership project (3GPP) system. For effective multi-rate processing, we define the basic block as one symbol period of the dedicated physical control channel(DPCCH) having the lowest data rate and common to all users. Then, decision and interference cancellation are performed at every basic block. For an asynchronous channel, we propose an advance removal scheme that removes in advance multiple access interference(MAI) due to the next blockof other users with shorter delay. Introducing a pipeline structure at a sample base, we can implement efficiently the PIC using the advance removal scheme with a minimum hardware and no extra computations. Through computer simulations, we analyze the bit error rate(BER) performance of the proposed PIC with respect to signal-to-noise ratio(SNR) and the number of users.

  • PDF

Fast Reference Frame Selection Algorithm Based on Motion Vector Reference Map (움직임 벡터 참조 지도 기반의 고속 참조 영상 선택 방법)

  • Lee, Kyung-Hee;Ko, Man-Geun;Seo, Bo-Seok;Suh, Jae-Won
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.4
    • /
    • pp.28-35
    • /
    • 2010
  • The variable block size motion estimation (ME) and compensation (MC) using multiple reference frames is adopted in H.264/AVC to improve coding efficiency. However, the computational complexity for ME/MC increases proportional to the number of reference frames and variable blocks. In this paper, we propose a new efficient reference frame selection algorithm to reduce the complexity while keeping the visual quality. First, a motion vector reference map is constructed by SAD of $4{\times}4$ block unit for multi reference frames. Next, the variable block size motion estimation and motion compensation is performed according to the motion vector reference map. The computer simulation results show that the average loss of BDPSNR is -0.01dB, the increment of BDBR is 0.27%, and the encoding time is reduced by 38% compared with the original method for H.264/AVC.

Piecewise Image Denoising with Multi-scale Block Region Detector based on Quadtree Structure (쿼드트리 기반의 다중 스케일 블록 영역 검출기를 통한 구간적 영상 잡음 제거 기법)

  • Lee, Jeehyun;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.20 no.4
    • /
    • pp.521-532
    • /
    • 2015
  • This paper presents a piecewise image denoising with multi-scale block region detector based on quadtree structure for effective image restoration. Proposed piecewise image denoising method suggests multi-scale block region detector (MBRD) by dividing whole pixels of a noisy image into three parts, with regional characteristics: strong variation region, weak variation region, and flat region. These regions are classified according to total pixels variation between multi-scale blocks and are applied principal component analysis with local pixel grouping, bilateral filtering, and structure-preserving image decomposition operator called relative total variation. The performance of proposed method is evaluated by Experimental results. we can observe that region detection results generated by the detector seems to be well classified along the characteristics of regions. In addition, the piecewise image denoising provides the positive gain with regard to PSNR performance. In the visual evaluation, details and edges are preserved efficiently over the each region; therefore, the proposed method effectively reduces the noise and it proves that it improves the performance of denoising by the restoration process according to the region characteristics.

Performance Analysis of HDR-WPAN System Using Multiple Antenna Scheme (다중 안테나 방식을 적용한 HDR-WPAN 시스템의 성능분석)

  • Kang, Chul-Gyu;Oh, Chang-Heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.1037-1040
    • /
    • 2005
  • In this paper, we analyze the performance of high data rate wireless personal area network (HDR-WPAN) system using multiple antenna scheme, space-time block code in fading channel. Multiple antenna technique is used to improve the error performance by combining the receive signal through multiple receive antenna. Space-time block code is a space-time diversity scheme which can obtain the maximum space diversity gain and easily implements a ML receiver via a simple process. HDR-WPAN system using space-time block code obtain about 14dB diversity gaint at BER 10$^{-5}$ in multipath fading channel. From the simulation result, We confirm that HDR-WPAN system adopting space-time block code has reliable communication even low power.

  • PDF