BR112018075094A2 - códigos convolucionais sem cauda - Google Patents

códigos convolucionais sem cauda

Info

Publication number
BR112018075094A2
BR112018075094A2 BR112018075094A BR112018075094A BR112018075094A2 BR 112018075094 A2 BR112018075094 A2 BR 112018075094A2 BR 112018075094 A BR112018075094 A BR 112018075094A BR 112018075094 A BR112018075094 A BR 112018075094A BR 112018075094 A2 BR112018075094 A2 BR 112018075094A2
Authority
BR
Brazil
Prior art keywords
tlcc
initial state
known initial
candidate
decoding
Prior art date
Application number
BR112018075094A
Other languages
English (en)
Inventor
Menjay Lin Jamie
Binamira Soriaga Joseph
Yang Yang
Original Assignee
Qualcomm Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Inc filed Critical Qualcomm Inc
Publication of BR112018075094A2 publication Critical patent/BR112018075094A2/pt

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes
    • H03M13/235—Encoding of convolutional codes, e.g. methods or arrangements for parallel or block-wise encoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
    • H03M13/2927—Decoding strategies
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3738—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with judging correct decoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H03M13/4115—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors list output Viterbi decoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H03M13/4161—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management
    • H03M13/4169—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management using traceback
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0059—Convolutional codes
    • H04L1/006—Trellis-coded modulation

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Quality & Reliability (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

certos aspectos da presente descrição referem-se a técnicas e aparelhos para aumentar o desempenho de decodificação e/ou reduzir a complexidade de decodificação. um método exemplar inclui geralmente receber, através de um meio sem fio, uma palavra-código codificada utilizando um código convolucional sem cauda (tlcc) com um estado inicial conhecido, avaliar um conjunto de percursos candidatos de descodificação através de um decodificador de treliça que se origina no estado inicial conhecido do tlcc, realizar, para cada um dentre uma pluralidade dos percursos candidatos de decodificação, um retro rastreamento a partir de um respectivo estado final para o estado inicial conhecido, e selecionar um dentre os percursos candidatos de decodificação com base, pelo menos em parte, nas métricas de percursos geradas enquanto realiza o retro rastreamento. um tlcc é caracterizado por ser codificado sem cauda de treliça/uma sequência de caudas resultando em um estado final desconhecido.
BR112018075094A 2016-06-13 2017-06-03 códigos convolucionais sem cauda BR112018075094A2 (pt)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US201662349521P 2016-06-13 2016-06-13
US15/612,820 US10425108B2 (en) 2016-06-13 2017-06-02 Tailless convolutional codes
PCT/US2017/035858 WO2017218221A1 (en) 2016-06-13 2017-06-03 Tailless convolutional codes

Publications (1)

Publication Number Publication Date
BR112018075094A2 true BR112018075094A2 (pt) 2019-03-26

Family

ID=60573291

Family Applications (1)

Application Number Title Priority Date Filing Date
BR112018075094A BR112018075094A2 (pt) 2016-06-13 2017-06-03 códigos convolucionais sem cauda

Country Status (6)

Country Link
US (1) US10425108B2 (pt)
EP (1) EP3469715A1 (pt)
CN (1) CN109314529A (pt)
AU (1) AU2017286153A1 (pt)
BR (1) BR112018075094A2 (pt)
WO (1) WO2017218221A1 (pt)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10862646B2 (en) * 2017-07-11 2020-12-08 Nokia Technologies Oy Polar coded broadcast channel
US10123322B1 (en) 2017-09-18 2018-11-06 Qualcomm Incorporated Transmission of beam switch commands through control channel signaling
WO2020247508A1 (en) * 2019-06-03 2020-12-10 The Regents Of The University Of California Convolutional precoding and decoding of polar codes
WO2022031325A1 (en) * 2020-08-05 2022-02-10 Zeku, Inc. Error checking techniques for wireless communications

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5881073A (en) 1996-09-20 1999-03-09 Ericsson Inc. Convolutional decoding with the ending state decided by CRC bits placed inside multiple coding bursts
US6097772A (en) * 1997-11-24 2000-08-01 Ericsson Inc. System and method for detecting speech transmissions in the presence of control signaling
US6141388A (en) 1998-03-11 2000-10-31 Ericsson Inc. Received signal quality determination method and systems for convolutionally encoded communication channels
US6108386A (en) 1998-04-03 2000-08-22 Lucent Technologies Inc. List Viterbi algorithms for continuous data transmission
TW377427B (en) 1998-05-26 1999-12-21 Koninklijke Philips Electronics Nv Transmission system having a simplified channel decoder applicable to mobile phone systems for better reliability in serial transmission
GB2383506A (en) * 2001-12-21 2003-06-25 Ubinetics Ltd Trellis decoding in parallel where extra trellis sections are appended
EP1339188A1 (en) 2002-02-20 2003-08-27 Siemens Aktiengesellschaft Channel coding method
US7640478B2 (en) * 2005-04-26 2009-12-29 Cisco Technology, Inc. Method for decoding tail-biting convolutional codes
CN101047472B (zh) * 2006-03-31 2013-02-06 世意法（北京）半导体研发有限责任公司 使用搜索深度维特比算法对咬尾卷积码的解码方法
CN101933236A (zh) 2008-01-31 2010-12-29 松下电器产业株式会社 无线通信装置和纠错编码方法
US8543895B2 (en) * 2010-02-10 2013-09-24 Qualcomm Incorporated List Viterbi decoding of tail biting convolutional codes
CN105356893A (zh) * 2015-11-24 2016-02-24 中国科学院计算技术研究所 一种尾码可配置的Viterbi解码方法及解码器

Also Published As

Publication number Publication date
WO2017218221A1 (en) 2017-12-21
AU2017286153A1 (en) 2018-11-22
CN109314529A (zh) 2019-02-05
US20170359089A1 (en) 2017-12-14
US10425108B2 (en) 2019-09-24
EP3469715A1 (en) 2019-04-17

Similar Documents

Publication Publication Date Title
BR112018075094A2 (pt) códigos convolucionais sem cauda
CO2019006091A2 (es) Bits de crc para decodificación conjunta y verificación de información de control mediante códigos polares
BR112018074588A2 (pt) construção de código polar generalizado
BR112018074554A2 (pt) construções de código polar aumentadas por colocação estratégica de bits de crc
BR112019008767A2 (pt) piggyback de informação de controle de downlink em canal compartilhado de downlink físico
MX2020004149A (es) Variantes de desoxirribonucleasa (dnasa).
BR112018073114A2 (pt) puncionamento e estrutura de código de verificação de paridade de baixa densidade (ldpc) aperfeiçoados
BR112018014387A2 (pt) segmentação de blocos de códigos para codificação adaptativa de carga útil usando códigos turbo e códigos ldpc
BR112018074414A2 (pt) codificação e decodificação de sinalização de controle com verificação de redundância seccional
CL2018002664A1 (es) Codificación de datos de video utilizando infraestructura de árbol de múltiples tipos de dos niveles
BR112019004649A2 (pt) método para reservar um número finito de recursos usados para realizar comunicação de v2x em um sistema de comunicação sem fio e terminal que utiliza o mesmo
EP4280494A3 (en) Encoding and decoding of polar codes with distributed check bits
BR112019003263A2 (pt) seleção de sequência de sinal de referência de desmodulação em comunicação de dispositivo a dispositivo
BR112015006451A2 (pt) parâmetros de decodificador de referência hipotético em codificação de vídeo
BR112018073194A2 (pt) métodos e aparelhos para a geração eficiente de códigos de verificação de paridade de baixa densidade elevada (ldpc)
BR112016029787A2 (pt) faixas de valor para elementos de sintaxe em criptografia de vídeo
AR095323A1 (es) Pronóstico de válvula para componentes poliméricos en función de técnicas de envejecimiento acelerado
BR112019002500A2 (pt) método e primeiro nó de correspondência de taxa para códigos ldpc
BR112018068578A2 (pt) técnicas para comunicação em uma partição de tempo piloto de uplink expandida
BR112018076250A2 (pt) sistemas e métodos para correspondência de taxa definida em trechos ao usar códigos polar
BR112017015516A2 (pt) configuração de diversidade espacial e de frequência para comunicações tipo máquina(mtc)
BR112017024449A2 (pt) definição de banda estreita para comunicação fortalecida do tipo máquina
AR108030A1 (es) Mecanismo de realimentación de reconocimiento predictivo
BR112015032888A2 (pt) sistemas e métodos para criar e implementar um agente ou sistema de inteligência artificial
WO2018128679A3 (en) Efficient list decoding of ldpc codes

Legal Events

Date Code Title Description
B350 Update of information on the portal [chapter 15.35 patent gazette]
B08F Application dismissed because of non-payment of annual fees [chapter 8.6 patent gazette]

Free format text: REFERENTE A 5A ANUIDADE.

B08K Patent lapsed as no evidence of payment of the annual fee has been furnished to inpi [chapter 8.11 patent gazette]

Free format text: EM VIRTUDE DO ARQUIVAMENTO PUBLICADO NA RPI 2673 DE 29-03-2022 E CONSIDERANDO AUSENCIA DE MANIFESTACAO DENTRO DOS PRAZOS LEGAIS, INFORMO QUE CABE SER MANTIDO O ARQUIVAMENTO DO PEDIDO DE PATENTE, CONFORME O DISPOSTO NO ARTIGO 12, DA RESOLUCAO 113/2013.