Risultati della ricerca - (endededededededededededededecoding OR (coding OR Decoding)) algorithm

Raffina i risultati
  1. 1

    Feature-based fast coding unit partition algorithm for high efficiency video coding Autoría: Lin, Yih Chuan, Lai, Jian Cheng

    Pubblicazione 2015
    Fuente: Universidad Nacional Autónoma de México
    Tipo de material: Artículo de Investigación
    Descripción: Resumen: High Efficiency Video Coding (HEVC), which is the newest video coding standard, has been developed for the efficient compression of ultra high definition videos. One of the important features in HEVC is the adoption of a quad-tree based video coding structure, in which each incoming frame is represented as a set of non-overlapped coding tree blocks (CTB) by variable-block sized prediction and coding process. To do this, each CTB needs to be recursively partitioned into coding unit (CU), predict unit (PU) and transform unit (TU) during the coding process, leading to a huge computational load in the coding of each video frame. This paper proposes to extract visual features in a CTB and uses them to simplify the coding procedure by reducing the depth of quad-tree partition for each CTB in HEVC intra coding mode. A measure for the edge strength in a CTB, which is defined with simple Sobel edge detection, is used to constrain the possible maximum depth of quad-tree partition of the CTB. With the constrained partition depth, the proposed method can reduce a lot of encoding time. Experimental results by HM10.1 show that the average time-savings is about 13.4% under the increase of encoded BD-Rate by only 0.02%, which is a less performance degradation in comparison to other similar methods. All Rights Reserved © 2015 Universidad Nacional Autónoma de México, Centro de Ciencias Aplicadas y Desarrollo Tecnológico. This is an open access item distributed under the Creative Commons CC License BY-NC-ND 4.0.
    Acceso al recurso
  2. 2
  3. 3
  4. 4

    A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code Autoría: TARIQ SHAH

    Pubblicazione 2013
    Fuente: Redalyc
    Tipo de material: Artículo científico
    Acceso al recurso
  5. 5

    High-Speed Decoding of the Binary Golay Code Autoría: Lee, H. P., Chang, C. H., Chu, S. I.

    Pubblicazione 2013
    Fuente: Universidad Nacional Autónoma de México
    Tipo de material: Artículo de Investigación
    Descripción: Resumen: Recently, some table-lookup decoding algorithms (TLDAs) have been used to correct the binary Golay code. Thispaper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm (MSDA) by using themessage syndrome to correct the binary systematic Golay code. The proposed MSDA is based on the novelmessage-syndrome lookup table (MSLT). The MSLT merely consists of 12 candidate syndromes and its memory sizeis significantly smaller than other existing lookup tables. Computer software simulation results show that the decodingspeed of the proposed MSDA is superior to other proposed TLDAs.
    Acceso al recurso
  6. 6

    Probabilistic verification algorithm for linear codes Autoría: Li, Mingchao, Li, Jiyou

    Pubblicazione 2026
    Fuente: arXiv
    Tipo de material: Preprint
    Acceso al recurso
  7. 7

    A Cryptosystem Based Upon Sums of Key Functions Autoría: Vyacheslav V. Kalashnikov

    Pubblicazione 2017
    Fuente: Redalyc
    Tipo de material: Artículo científico
    Acceso al recurso
  8. 8

    Decoding rank metric Reed-Muller codes Autoría: Couvreur, Alain, Pratihar, Rakhi

    Pubblicazione 2025
    Fuente: arXiv
    Tipo de material: Preprint
    Acceso al recurso
  9. 9

    Decoding Algebraic Geometry codes by a key equation Autoría: Farran, J. I.

    Pubblicazione 1999
    Fuente: arXiv
    Tipo de material: Preprint
    Acceso al recurso
  10. 10

    Feature-based fast coding unit partition algorithm for high efciency video coding Autoría: Yih-Chuan Lin

    Pubblicazione 2015
    Fuente: Redalyc
    Tipo de material: Artículo científico
    Acceso al recurso
  11. 11

    Decoding the algorithmic operations of Australia's National Disability Insurance Scheme Autoría: Georgia van Toorn, Terry Carney

    Pubblicazione 2024
    Fuente: Wiley Open Access
    Tipo de material: Artículo Open Access
    Acceso al recurso
  12. 12

    Decoding up to Hartmann-Tzeng and Roos bounds for rank codes Autoría: Muñoz, José Manuel

    Pubblicazione 2024
    Fuente: arXiv
    Tipo de material: Preprint
    Acceso al recurso
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20