000149802 001__ 149802
000149802 005__ 20250130203340.0
000149802 0247_ $$2doi$$a10.1109/VETECF.2010.5594467
000149802 0248_ $$2sideral$$a142207
000149802 037__ $$aART-2010-142207
000149802 041__ $$aeng
000149802 100__ $$0(orcid)0000-0001-9052-9554$$aOrtin, Jorge$$uUniversidad de Zaragoza
000149802 245__ $$aEvaluation of a Reduced Complexity ML Decoding Algorithm for Tailbiting Codes on Wireless Systems
000149802 260__ $$c2010
000149802 5060_ $$aAccess copy available to the general public$$fUnrestricted
000149802 5203_ $$aTailbiting 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.
000149802 536__ $$9info:eu-repo/grantAgreement/ES/DGA/PI003-08$$9info:eu-repo/grantAgreement/ES/MICINN-FEDER/TEC2008-06684-C03-02/TEC
000149802 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/
000149802 655_4 $$ainfo:eu-repo/semantics/conferenceObject$$vinfo:eu-repo/semantics/acceptedVersion
000149802 700__ $$0(orcid)0000-0002-7452-446X$$aGarcia, Paloma$$uUniversidad de Zaragoza
000149802 700__ $$0(orcid)0000-0001-5293-6132$$aGutierrez, Fernando$$uUniversidad de Zaragoza
000149802 700__ $$0(orcid)0000-0003-2664-6339$$aValdovinos, Antonio$$uUniversidad de Zaragoza
000149802 7102_ $$15008$$2800$$aUniversidad de Zaragoza$$bDpto. Ingeniería Electrón.Com.$$cÁrea Teoría Señal y Comunicac.
000149802 7102_ $$15008$$2560$$aUniversidad de Zaragoza$$bDpto. Ingeniería Electrón.Com.$$cÁrea Ingeniería Telemática
000149802 773__ $$g72 (2010), [5 pp.]$$pIEEE Vehic. Technol. Conf. (1993)$$tIEEE Vehicular Technology Conference (1993)$$x1090-3038
000149802 8564_ $$s160536$$uhttps://zaguan.unizar.es/record/149802/files/texto_completo.pdf$$yVersión publicada
000149802 8564_ $$s3443817$$uhttps://zaguan.unizar.es/record/149802/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada
000149802 909CO $$ooai:zaguan.unizar.es:149802$$particulos$$pdriver
000149802 951__ $$a2025-01-30-20:33:11
000149802 980__ $$aARTICLE