Pasar al contenido principal

TECNICAS DE PREDISTORSION DIGITAL Y SINTESIS DE IMPEDANCIAS PARA TRANSMISORES DE SISTEMAS INALAMBRICOS DE BANDA ANCHA

TEC2008-06684-C03-02

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2008
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD DE ZARAGOZA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 1
Encontrada(s) 1 página(s)

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Contribución de congreso (ConferenceOutput)

Evaluation of a Reduced Complexity ML Decoding Algorithm for Tailbiting Codes on Wireless Systems

  • Ortin, Jorge
  • Garcia, Paloma
  • Gutierrez, Fernando
  • Valdovinos, Antonio
Tailbiting convolutional codes will be used for several applications in new cellular mobile radio systems. This encoding method does not reset the encoder memory at the end of each data block, avoiding the overhead of the zero tail and improving the efficiency. Nevertheless, the absence of a known tail highly increases the complexity of the decoding process. Recently, the use of the A* algorithm has highly decreased the computational complexity of Maximum Likelihood (ML) decoding of tailbiting convolutional codes. The decoding process in this case requires two steps. In the first step, a typical Viterbi decoding is employed to collect information regarding the trellis. The A* algorithm is then applied in the second step, using the information obtained in the first step to calculate the heuristic function. The improvements proposed in this work decrease the computational complexity of the A* algorithm using further information from the first step of the algorithm. This information is used for finding early terminating conditions for the A* algorithm. Simulation results show that the proposed modification decreases the complexity of ML decoding with the A* algorithm in terms of the performed number of operations.