000149749 001__ 149749 000149749 005__ 20250129140941.0 000149749 0247_ $$2doi$$a10.1109/LCOMM.2010.072310.100295 000149749 0248_ $$2sideral$$a71955 000149749 037__ $$aART-2010-71955 000149749 041__ $$aeng 000149749 100__ $$0(orcid)0000-0001-9052-9554$$aOrtín, J.$$uUniversidad de Zaragoza 000149749 245__ $$aA* based algorithm for reduced complexity ML decoding of tailbiting codes 000149749 260__ $$c2010 000149749 5060_ $$aAccess copy available to the general public$$fUnrestricted 000149749 5203_ $$aThe A* algorithm is a graph search algorithm which has shown good results in terms of computational complexity for Maximum Likelihood (ML) decoding of tailbiting convolutional codes. The decoding of ailbiting codes with this algorithm is performed in two phases. In the first phase, a typical Viterbi decoding is employed to collect information regarding the trellis. The A* algorithm is then applied in the second phase, using the information obtained in the first one 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 phase of the algorithm. This information is used for obtaining a more accurate heuristic function and finding early terminating conditions for the A* algorithm. Simulation results show that the proposed modifications decrease the complexity of ML decoding with the A* algorithm in terms of the performed number of operations. 000149749 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/ 000149749 590__ $$a1.06$$b2010 000149749 591__ $$aTELECOMMUNICATIONS$$b29 / 79 = 0.367$$c2010$$dQ2$$eT2 000149749 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/acceptedVersion 000149749 700__ $$0(orcid)0000-0002-7452-446X$$aGarcía, P.$$uUniversidad de Zaragoza 000149749 700__ $$0(orcid)0000-0001-5293-6132$$aGutierrez, F.$$uUniversidad de Zaragoza 000149749 700__ $$0(orcid)0000-0003-2664-6339$$aValdovinos, A.$$uUniversidad de Zaragoza 000149749 7102_ $$15008$$2800$$aUniversidad de Zaragoza$$bDpto. Ingeniería Electrón.Com.$$cÁrea Teoría Señal y Comunicac. 000149749 7102_ $$15008$$2560$$aUniversidad de Zaragoza$$bDpto. Ingeniería Electrón.Com.$$cÁrea Ingeniería Telemática 000149749 773__ $$g14, 9 (2010), 854-856$$pIEEE commun. lett.$$tIEEE COMMUNICATIONS LETTERS$$x1089-7798 000149749 8564_ $$s193726$$uhttps://zaguan.unizar.es/record/149749/files/texto_completo.pdf$$yVersión publicada 000149749 8564_ $$s3318879$$uhttps://zaguan.unizar.es/record/149749/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada 000149749 909CO $$ooai:zaguan.unizar.es:149749$$particulos$$pdriver 000149749 951__ $$a2025-01-29-14:09:08 000149749 980__ $$aARTICLE