• Title/Summary/Keyword: 결합 부호화

Search Result 187, Processing Time 0.024 seconds

Layered Receivers for System Combined Layered Space-Time Processing and Space-Time Trellis Codes (계층화 시공간 구조와 시공간 트렐리스 부호를 결합한 시스템에 적합한 계층화 수신기)

  • 임은정;김동구
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.3
    • /
    • pp.9-14
    • /
    • 2004
  • The system combined layered space-time processing and space-time trellis codes (STTC) provide high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, two layered receiver structures are proposed. One is the LSTT-MMSE in which received bit streams are decoupled by interference nulling and then decoded by separate STTC decoders. The decoded outputs are cancelled from the received signal before advancing to the next layer detection. The other is LSTT-Whitening employing whitening rather than nulling. The receiver employing whitening process shows several advantages on diversity gain and the required number of receive antennas compare to the convolutional coded space-time processing. The proposed receivers use different decoding order scheme according to each interference suwression. The (4, 3) LSTT-Whitening receiver still achieves 1㏈ gain over the (4, 4) LSTT-MMSE and the (4, 4) coded layered space-time processing.

희소 부호화 기법과 토픽 모델링을 통한 이미지 분류 모델

  • Jeon, Jin;Kim, Munchurl
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.07a
    • /
    • pp.49-50
    • /
    • 2015
  • 본 논문에서는 이미지를 시각적 단어로 표현하여 분석하는 기법인 bag-of-visual words (BoW) 모델을 기반으로 latent dirichlet allocation (LDA) 모델을 결합하여 시각적 단어의 구조를 파악하여 이미지를 분류할 수 있는 모델을 제안한다. 우선 이미지를 시각적 단어로 기존의 방법보다 정확하게 표현하기 위해서 희소 부호화(sparse coding) 기법을 적용한다. 기존의 BoW 모델은 하나의 이미지 패치를 하나의 단어로 표현하였지만, 희소 부호화 기법을 통해 하나의 이미지 패치를 여러 개의 단어로 표현할 수 있다. 제안하는 모델을 이용하여 이미지를 분류하기 위해서 분류 성능 측정에 많이 쓰이는 multi-class SVM 기법을 이용한다. UIUC 스포츠 데이터를 이용한 성능 측정을 통해 제안한 기법의 클래스 분류 성능을 검증하였다.

  • PDF

Efficient Motion Prediction Architecture and Design of DPB for Scalable Multi-view Video Coding (스케일러블 다시점 비디오 부호화를 위한 효율적인 움직임 예측구조와 DPB 설계)

  • Kim, Ji-Hoon;Jung, Tae-Jun;Lee, Hong-Rae;Seo, Kwang-Deok;Kim, Jin-Soo;Lee, Hahyun;Kang, Jung Won
    • Journal of Broadcast Engineering
    • /
    • v.17 no.6
    • /
    • pp.976-989
    • /
    • 2012
  • In this paper, we propose an efficient motion prediction architecture and DPB design mechanism for scalable multi-view video coding which is implemented by integrating SVC and MVC coding algorithms. In the proposed motion prediction architecture, we employ pictures associated with other views as a candidate for reference picture for improved motion prediction performance. By the proposed prediction architecture, we could enormously reduce the size of compressed video data. When performing scalable multi-view video coding, an integrated DPB design mechanism is also proposed. It is shown by various simulations that the proposed motion prediction architecture for scalable multi-view video coding can result in reduced data size in the compressed bitstream.

Retransmission Scheme with Equal Combined Power Allocation Using Decoding Method with Improved Convergence Speed in LDPC Coded OFDM Systems (LDPC로 부호화된 OFDM 시스템에서 수렴 속도를 개선시킨 복호 방법을 적용한 균등 결합 전력 할당 재전송 기법)

  • Jang, Min-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.9
    • /
    • pp.750-758
    • /
    • 2013
  • In this paper, we introduce the low-density parity-check (LDPC) coded orthogonal frequency division multiplexing (OFDM) subframe reordering scheme for achieving equal combined power allocation in type I hybrid automatic repeat request (H-ARQ) systems and analyze the performance improvement by using the channel capacity. Also, it is confirmed that the layered decoding for subframe reordering scheme in H-ARQ systems gives faster convergence speed. It is verified from numerical analysis that a subframe reordering pattern having larger channel capacity shows better bit error rate (BER) performance. Therefore the subframe reordering pattern achieving equal combined power allocation for each subframe maximizes the channel capacity and outperforms other subframe reordering patterns. Also, it is shown that the subframe reordering scheme for achieving equal combined power allocation gives better performance than the conventional Chase combining scheme without increasing the decoding complexity.

Fast VQ Encoding Algorithm (백터 양자화의 고속 부호화 알고리즘)

  • 채종길;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.4
    • /
    • pp.685-690
    • /
    • 1994
  • A problem associated with vector quantization(VQ) is the computational complexity incurred in searching for a codevector with the closet to a given input vector, where the complexity increases exponentionally with proportion to codebook size and then limits practical application. In this paper, a simple and fast, but efficient, VQ encoding algorithm is presented using a reference codevector as start codevector of premature exit condition, which eliminates distance claculation of unlikely codevectors. The algorithm is to find reference codevector having the possibility to be the nearest vector to input vector first and then to incorporate premature exit condition. The proposed algorithm needs only 10~15% of mathematical operations compared with the conventional full search VQ. Algorithm the number of additions and comparsions of the proposed algorithm is not reduced greatly, the number of multiplication is reduced up to 70~80% compared with other fast VQ encoding methods.

  • PDF

A New Coding Method for Improving the Performance of MPEG-4 Part 10 Video Coding Standard (MPEG-4 Part 10 동영상 압축 표준 성능 개선을 위한 새로운 부호화 방식)

  • Moon, Yong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11C
    • /
    • pp.1058-1065
    • /
    • 2006
  • In this paper, we propose a new motion vector coding algorithm suitable for MPEG-4 Part 10 video coding standard. In the proposed algorithm, the amount of the motion for a given video sequence is Predicted by using a characteristic of the motion vector distribution for the neighboring blocks as well as the MB_type, which is the syntax element in the standard. And one of the independent coding and the combined coding methods is adaptively employed to compress the motion vector difference. Simulation results show that the proposed algorithm outperforms the conventional methods without additional memory and calculations.

Performances of wireless ATM cell transmission with partial concatenated coding (무선 ATM셀 전송을 위한 부분 연쇄 부호화 기법의 성능분석)

  • 이진호;김태중;이동도;안재영;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.2014-2026
    • /
    • 1997
  • In this paper, the performances of wireless asynchronous transfer mode (ATM) cell transmission in mobile work are analyzed. We adopt 16Star QAM as amodulation technique in wireless channel and considered Reed-Solomon, convolutional, and concatenated coding to improve the error rate performances, and also proposed the Partial Concatenated Coding (PCC) technique as UEP(unequal error protection) code for efficient transmission of ATM cell in the air interface. We consider Doppler's effect, Rician fading, and diversity technique of maximal-ratio combining (MRC) for mobile channel model. For performance measure, we analyze bit error rate, ATM cell loss probability, ATM cell error probability, and network performances of ATM cell transmission delay and throughput. The numerical results show that the adoption of PCC is a prospective way for the evolution of future wireless ATM network on mobile environment.

  • PDF

Performance Analysis of the Optimal Turbo Coded V-BLAST technique in Adaptive Modulation System (적응 변조 시스템에서 최적의 터보 부호화된 V-BLAST 기법의 성능 분석)

  • Lee, Kyung-Hwan;Choi, Kwang-Wook;Ryoo, Sang-Jin;Kang, Min-Goo;Hong, Dae-Ki;You, Cheol-Woo;Hwang, In-Tae;Kim, Cheol-Sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.2
    • /
    • pp.385-391
    • /
    • 2007
  • In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP (Maximum A Posteriori) Decoder with Iterative Decoding to use as a priori probability in two decoding procedures of V-BLAST: ordering and slicing. Also, comparing with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance has been improved. As a result of simulation, in the Adaptive Modulation systems with several Turbo Coded V-BLAST techniques, the optimal Turbo Coded V-BLAST technique has higher throughput gain than the conventional Turbo Coded V-BLAST technique. Especially, the results show that the proposed scheme achieves the gain of 1.5 dB SNR compared to the conventional system at 2.5 Mbps throughput.

Analysis of MPEG-4 Encoder for Object-based Video (실시간 객체기반 비디오 서비스를 위한 MPEG-4 Encoder 분석)

  • Kim Min Hoon;Jang Euee Seon;Lee Sun young;Moon Seok ju
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.1
    • /
    • pp.13-20
    • /
    • 2004
  • In this paper, we have analyzed the current MPEG-4 video encoding tools and proposed efcient coding techniques that reduce the complexity of the encoder. Until recently, encoder optimization without shape coding has been a major concern in video for wire/wireless low bit rate coding services. Recently, we found out that the computational complexity of MPEG-4 shape coding plays a very important role in the object-based coding through experiments. We have made an experiment whether we could get optimized object-based coding method through successfully combining latest optimized texture coding techniques with our proposed optimized shape coding techniques. In texture coding, we applied the MVFAST method for motion estimation. We chose not to use IVOPF(Intelligent VOP Formation) but to use TRB(Tightest Rectangular Boundary) for positioning VOP and, finally, to eliminate the spiral search of shape motion estimation to reduce the complexity in shape coding. As a result of experiment, our proposed scheme achieved improved time complexity over the existing reference software by $57.3\%$ and over the optimized method on which only shape coding was applied by $48.7\%$, respectively.

Image Segmentation Using A Combined Segmentation Measure for Region-Based Coding (영역 기반 부호화를 위한 결합 분할 척도를 이용한 영상 분할)

  • Song, Kun-Woen;Kim, Kyeong-Man;Min, Gak;Lee, Chae-Soo;Nam, Jae-Yeal;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.518-528
    • /
    • 2001
  • In this paper, we firstly define a new combined segmentation measure and propose a segmentation algorithm using this measure. The combined segmentation measure is a weighted sum of intensity, motion, and a change segmentation measure that is extracted from the resulting image of the proposed change detector. The change segmentation measure is defined as an absolute change value difference between an pixel and its neighboring region from the eroded image, which results from morphological erosion filtering to eliminate many inaccurate components included in the resulting image of a conventional change detector. The change segmentation measure can be used as an efficient segmentation measure for the accurate segmentation of neighboring moving objects and static background regions. Therefore, the proposed combined segmentation measure can determine exact boundaries in the segmentation process of region-based coding even though the estimated motion vectors around the boundaries of moving objects and static background regions are inaccurate and the intensities around the boundaries are similar.

  • PDF