• Title/Summary/Keyword: DECODER

Search Result 1,660, Processing Time 0.022 seconds

Hardware Design of In-loop Filter for High Performance HEVC Encoder (고성능 HEVC 부호기를 위한 루프 내 필터 하드웨어 설계)

  • Park, Seungyong;Im, Junseong;Ryoo, Kwangki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.335-342
    • /
    • 2016
  • This paper proposes efficient hardware structure of in-loop filter for a high-performance HEVC (High Efficiency Video Coding) encoder. HEVC uses in-loop filter consisting of deblocking filter and SAO (Sample Adaptive Offset) to improve the picture quality in a reconstructed image due to a quantization error. However, in-loop filter causes an increase in complexity due to the additional encoder and decoder operations. A proposed in-loop filter is implemented as a three-stage pipeline to perform the deblocking filtering and SAO operation with a reduced number of cycles. The proposed deblocking filter is also implemented as a six-stage pipeline to improve efficiency and performs a new filtering order for efficient memory architecture. The proposed SAO processes six pixels parallelly at a time to reduce execution cycles. The proposed in-loop filter encoder architecture is designed by Verilog HDL, and implemented by 131K logic gates in TSMC $0.13{\mu}m$ process. At 164MHz, the proposed in-loop filter encoder can support 4K Ultra HD video encoding at 60fps in real time.

A new spect of offset and step size on BER perfermance in soft quantization Viterbi receiver (연성판정 비터비 복호기의 최적 BER 성능을 위한 오프셋 크기와 양자화 간격에 관한 성능 분석)

  • Choi, Eun-Young;Jeong, In-Tak;Song, Sang-Seb
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1A
    • /
    • pp.26-34
    • /
    • 2002
  • Mobile telecommunication systems such as IS-95 and IMT-2000 employ frame based communication using frames up to 20 msec in length and the receiving end has to store the whole frome before it is being processed. The size of the frame buffer ofter dominates those of the processing unit such as soft decision Viterbi decoder. The frame buffer for IMT-2000, for example, has to be increased 80 times as large as that of IS-95. One of the parameters deciding the number of bits in a frame will be obviously the number of bits in soft quantization. Start after striking space key 2 times. This paper has studied a new aspect of offset and quantization step size on BER performance and proposes a new 3-bit soft quantization algorithm which shows similar performance as that of 4-bit soft decision Viterbi receiver. The optimal offset values and step sizes for the other practical quantization levels ---16, 8, 4, 2--- have also been found. In addition, a new optimal symbol metric table has been devised which takes the accumulation value of various repeated signals and produces a rescaled 3-bit valu.tart after striking space key 2 times.

An Image Management System of Frame Unit on a Hand-held Device Environments (휴대장치 환경을 위한 프레임 단위의 영상 데이터 관리 시스템)

  • Choi, Jun-Hyeog;Yoon, Kyung-Bae;Han, Seung-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.7
    • /
    • pp.29-36
    • /
    • 2008
  • This paper proposes algorithm for the system that can search for an image of a frame unit, and we implement it. A system already inserts in images after generating the cord that mechanical decoding and identification are possible. We are independent of an external noise in a frame unit, and a system to propose at these papers can search for an image recorded by search condition to include recording date, recording time, a recording place or filming course etc. This system is composed by image insertion wealth to insert data to an image to data image code generation wealth, a frame generating data image code you apply a code generation rule to be fixed in order to express to a price to have continued like data entry wealth, GPS locator values and direction price receiving an image signal, image decoding signals and an image search signal to include search condition, and to have continuity from users each of an image. Also, image decoding we decipher about the noise that was already added from the outsides in a telerecording process, a copy process or storage processes inserted in images by real time, and searching image information by search condition. Consequently we implement decoder, and provide the early system that you use, and we easily insert data code among images. and we can search. and maximization can get precision regarding an image search and use satisfaction as we use algorithm to propose at these papers.

  • PDF

Implementation of Stopping Criterion Algorithm using Sign Change Ratio for Extrinsic Information Values in Turbo Code (터보부호에서 외부정보에 대한 부호변화율을 이용한 반복중단 알고리즘 구현)

  • Jeong Dae-Ho;Shim Byong-Sup;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.143-149
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using sign changed ratio of extrinsic information values in turbo decoder, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation. As a result of simulations, the average number of iterations is reduced by about $12.48%{\sim}22.22%$ compared to CE algorithm and about $20.43%{\sim}54.02%$ compared to SDR algorithm.

BS-PLC(Both Side-Packet Loss Concealment) for CELP Coder (CELP 부호화기를 위한 양방향 패킷 손실 은닉 알고리즘)

  • Lee In-Sung;Hwang Jeong-Joon;Jeong Gyu-Hyeok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.127-134
    • /
    • 2005
  • Lost packet robustness is an most important quality measure for voice over IP networks(VoIP). Recovery of the lost packet from the received information is crucial to realize this robustness. So, this paper proposes the lost packet recovery method from the received information for real-time communication for CELP coder. The proposed BS-PLC (Both Side Packet Loss Concealment) based WSOLA(Waveform Shift OverLab Add) allow the lost packet to be recovered from both the 'previous' and 'next' good packet as the LP parameter and the excitation signal are respectively recovered. The burst of packet loss is modeled by Gilbert model. The proposed scheme is applied to G.729 most used in VoIP and is evaluated through the SNR(signal to noise) and the MOS(Mean Opinion Score) test. As a simulation result, The proposed scheme provide 0.3 higher in Mean Opinion Score and 2 dB higher in terms of SNR than an error concealment procedure in the decoder of G.729 at $20\%$ average packet loss rate.

Semi-supervised domain adaptation using unlabeled data for end-to-end speech recognition (라벨이 없는 데이터를 사용한 종단간 음성인식기의 준교사 방식 도메인 적응)

  • Jeong, Hyeonjae;Goo, Jahyun;Kim, Hoirin
    • Phonetics and Speech Sciences
    • /
    • v.12 no.2
    • /
    • pp.29-37
    • /
    • 2020
  • Recently, the neural network-based deep learning algorithm has dramatically improved performance compared to the classical Gaussian mixture model based hidden Markov model (GMM-HMM) automatic speech recognition (ASR) system. In addition, researches on end-to-end (E2E) speech recognition systems integrating language modeling and decoding processes have been actively conducted to better utilize the advantages of deep learning techniques. In general, E2E ASR systems consist of multiple layers of encoder-decoder structure with attention. Therefore, E2E ASR systems require data with a large amount of speech-text paired data in order to achieve good performance. Obtaining speech-text paired data requires a lot of human labor and time, and is a high barrier to building E2E ASR system. Therefore, there are previous studies that improve the performance of E2E ASR system using relatively small amount of speech-text paired data, but most studies have been conducted by using only speech-only data or text-only data. In this study, we proposed a semi-supervised training method that enables E2E ASR system to perform well in corpus in different domains by using both speech or text only data. The proposed method works effectively by adapting to different domains, showing good performance in the target domain and not degrading much in the source domain.

Optimized Cell ID Codes for SSDT Power Control in W-CDMA System (W-CDMA 시스템의 최적의 SSDT 전력 제어용 셀 식별 부호)

  • Young-Joon Song;Bong-Hoe Kim;Hae Chung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.8
    • /
    • pp.804-810
    • /
    • 2002
  • The code division multiple access(CDMA) system capacity is limited by the amount of interference of the system. To reduce the unnecessary interference, this paper proposes optimized cell identification codes for site selection diversity transmission(SSDT) power control in wideband code division multiple access system of third generation partnership project(3GPP). The main objective of SSDT power control is to transmit on the downlink from the primary cell, and thus reducing the interference caused by the multiple transmission. In order to select a primary cell, each cell is assigned a temporary identification(ID) and user equipment(UE) periodically informs a primary cell ID to the connecting cells during soft handover. The non-primary cells selected by UE do not transmit the dedicated physical data channel(DPDCH) to reduce the interference. A major issue with the SSDT technology is the impact of uplink symbol errors on its performance. These errors can corrupt the primary ID code and this may lead to wrong decoding in the base station receivers. The proposed SSDT cell ID codes are designed to minimize the problem and to be easily decoded using simple fast Hadamard transformation(FHT) decoder.

Efficient Local Decoding Using Bit Stream Map for High Resolution Video (비트 스트림 지도를 이용한 고해상도 영상의 효율적인 지역복호화)

  • Park Sungwon;Won Jongwoo;Lee Sunyoung;Kim Wookjoong;Kim Kyuheon;Jang Euee S
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.391-401
    • /
    • 2004
  • In this paper, we introduce a novel coding method to efficiently enable spatial random access for high resolution video. In terms of resolution and display size, standard display devices (such as cathode-ray tubes. monitors. PDAs, and LCDs) do not sufficiently support high resolution video such as digital cinema and panoramic video. Currently, users have no choice but to view video at lower resolution as a result of down-sampling, or only a partial region of the video due to display size limitations. Our proposed method. which we call the B-map, represents the set of starting locations of the coded segments in a picture frame. This information, or B-map, is first sent to the decoder prior to the coded data stream of the frame and is then used for fast local decoding. To test our method, we compare our B-map with JPEG tiling and the JPEG Resynchronization marker. Experimental results show that the proposed coding method requires less overhead than existing methods during the same decoding time. The results show promise for future panoramic or digital cinema applications.

Design of Multiple-symbol Lookup Table for Fast Thumbnail Generation in Compressed Domain (압축영역에서 빠른 축소 영상 추출을 위한 다중부호 룩업테이블 설계)

  • Yoon, Ja-Cheon;Sull, Sanghoon
    • Journal of Broadcast Engineering
    • /
    • v.10 no.3
    • /
    • pp.413-421
    • /
    • 2005
  • As the population of HDTV is growing, among many useful features of modern set top boxes (STBs) or digital video recorders (DVRs), video browsing, visual bookmark, and picture-in-picture capabilities are very frequently required. These features typically employ reduced-size versions of video frames, or thumbnail images. Most thumbnail generation approaches generate DC images directly from a compressed video stream. A discrete cosine transform (DCT) coefficient for which the frequency is zero in both dimensions in a compressed block is called a DC coefficient and is simply used to construct a DC image. If a block has been encoded with field DCT, a few AC coefficients are needed to generate the DC image in addition to a DC coefficient. However, the bit length of a codeword coded with variable length coding (VLC) cannot be determined until the previous VLC codeword has been decoded, thus it is required that all codewords should be fully decoded regardless of their necessary for DC image generation. In this paper, we propose a method especially for fast DC image generation from an I-frame using multiple-symbol lookup table (mLUT). The experimental results show that the method using the mLUT improves the performance greatly by reducing LUT count by 50$\%$.

A PDWZ Encoder Using Code Conversion and Bit Interleaver (코드변환과 비트 인터리버를 이용한 화소영역 Wyner-Ziv 부호화 기법)

  • Kim, Jin-Soo;Kim, Jae-Gon;Seo, Kwang-Deok
    • Journal of Broadcast Engineering
    • /
    • v.15 no.1
    • /
    • pp.52-62
    • /
    • 2010
  • Recently, DVC (Distributed Video Coding) is attracting a lot of research works since this enables us to implement a light-weight video encoder by distributing the high complex tasks such as motion estimation into the decoder side. In order to improve the coding efficiency of the DVC, the existing works have been focused on the efficient generation of side information (SI) or the virtual channel modeling which can describe the statistical channel noise well. But, in order to improve the overall performance, this paper proposes a new scheme that can be implemented with simple bit operations without introducing complex operation. That is, the performance of the proposed scheme is enhanced by using the fact that the Wyner-Ziv (WZ) frame and side information are highly correlated, and by reducing the effect of virtual channel noise which tends to be clustered in some regions. For this aim, this paper proposes an efficient pixel-domain WZ (PDWZ) CODEC which effectively exploits the statistical redundancy by using the code conversion and Gray code, and then reduces the channel noise by using the bit interleaver. Through computer simulations, it is shown that the proposed scheme can improve the performance up to 0.5 dB in objective visual quality.