kw.\*:("VITERBI CODE")
Results 1 to 25 of 370
Selection :
A SHORTENED VITERBI DECODING ALGORITHM FOR TERMINATED RATE-1/N CONVOLUTIONAL CODES WITH HARD DECISIONSGUPTA DV; WOLF JK.1979; IEEE TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 2; PP. 243-246; BIBL. 4 REF.Article
TRELLIS CODING FOR DEGRADED BROADCAST CHANNELLEIGHTON WJ III; TAN HH.1978; INFORM. AND CONTROL.; USA; DA. 1978; VOL. 39; NO 2; PP. 119-134; BIBL. 9 REF.Article
ERROR PROBABILITIES FOR VITERBI DECODERS WITH CORRELATED NOISEPOTTS JK.1979; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1979; VOL. 126; NO 5; PP. 365-367; BIBL. 6 REF.Article
PREDICTED PERFORMANCE OF THE VITERBI DECODING ALGORITHM FOR CHANNELS WITH BURST AND RANDOM ERRORSCHUNG DAU MO; INGELS FM.1978; SOUTHEASTCON'78. INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS. REGION 3. CONFERENCE/1978-04-10/ATLANTA GA; USA; NEW YORK: IEEE; DA. 1978; 63-66; BIBL. 2 REF.Conference Paper
EXPLICIT EVALUATION OF VITERBI'S UNION BOUNDS ON CONVOLUTIONAL CODE PERFORMANCE FOR THE BINARY SYMMETRIC CHANNEL.POST KA.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 3; PP. 403-404; BIBL. 2 REF.Article
TRUNCATION ERROR PROBABILITY IN VITERBI DECODING.FARHAD HEMMATI; COSTELLO DJ JR.1977; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1977; VOL. 25; NO 5; PP. 530-532; BIBL. 4 REF.Article
New syndrome decoding techniques for the (n, k) convolutional codesREED, I. S; TRUONG, T. K.IEE proceedings. Part F. Communications, radar and signal processing. 1984, Vol 131, Num 4, pp 412-416, issn 0143-7070Article
A class of reduced-complexity Viterbi detectors for partial response continuous phase modulationSVENSSON, A; SUNDBERG, C.-E; AULIN, T et al.IEEE transactions on communications. 1984, Vol 32, Num 10, pp 1079-1087, issn 0090-6778Article
PERFORMANCE OF DPSK WITH CONVOLUTIONAL ENCODING ON TIME-VARYING FADING CHANNELS.SHOU Y MUI; MODESTINO JW.1977; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1977; VOL. 25; NO 10; PP. 1075-1083; BIBL. 19 REF.Article
Correction to Orthogonal convolutional coding for the PPM optical channelATKIN, G. E; CORRALES, H. P.Journal of lightwave technology. 1990, Vol 8, Num 6, pp 1007-1008, issn 0733-8724, 2 p.Article
Papílio cryptography algorithmSTENIO DE ARAUJO, Frederiko; NEMPOMUCENO RAMOS, Karla Darlene; CALLEJAS BEDREGAL, Benjamin René et al.Lecture notes in computer science. 2004, pp 928-933, issn 0302-9743, isbn 3-540-24127-2, 6 p.Conference Paper
New rate-compatible punctured convolutional codes for Viterbi decodingLEE, L. H. C.IEEE transactions on communications. 1994, Vol 42, Num 12, pp 3073-3079, issn 0090-6778Article
The minimum distance for digital magnetic recording partial responsesVANNUCCI, G; FOSCHINI, G. J.IEEE transactions on information theory. 1991, Vol 37, Num 3, pp 955-960, issn 0018-9448, 1Article
Survivor memory reduction in the Viterbi algorithmABBASFAR, Aliazam; YAO, Kung.IEEE communications letters. 2005, Vol 9, Num 4, pp 352-354, issn 1089-7798, 3 p.Article
Robust speech recognition based on viterbi Bayesian predictive classificationJIANG, H; HIROSE, K; HUO, Q et al.International conference on acoustics, speech, and signal processing. 1997, pp 1551-1554, isbn 0-8186-7919-0Conference Paper
Advanced methods for satellite and deep space communications. International seminarHAGENAUER, Joachim.Lecture notes in control and information sciences. 1992, Vol 182, issn 0170-8643, 101 p.Conference Proceedings
Comments on Orthogonal convolutional coding for the PPM optical channelRYAN, W. E.Journal of lightwave technology. 1990, Vol 8, Num 6, issn 0733-8724, p. 1007Article
DSP implementation of trellis decoding algorithm for block codesGIL-GARCIA, J. M; PENG, X.-H; FARRELL, P. G et al.Communication systems & digital signal processing. International symposium. 1998, pp 68-71, 2VolConference Paper
Pseudo-syndrome method for supervising Viterbi decoders at any coding rateBERROU, C; DOUILLARD, C.Electronics Letters. 1994, Vol 30, Num 13, pp 1036-1037, issn 0013-5194Article
MAXIMUM-LIKELIHOOD DECODING OF BINARY CONVOLUTIONAL CODES ON BAND-LIMITED SATELLITE CHANNELSACAMPORA AS.1978; I.E.E.E. TRANS. COMMUNIC.; USA; DA. 1978; VOL. 26; NO 6; PP. 766-776; BIBL. 13 REF.Article
CONVOLUTIONAL CODE PERFORMANCE IN THE RICIAN FADING CHANNEL. = CARACTERISTIQUES D'UN CODE DE CONVOLUTION SUR UNE VOIE D'ATTENUATION DE RICIANMODESTINO JW; MUI SY.1976; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1976; VOL. 24; NO 6; PP. 592-606; BIBL. 18 REF.Article
CONSTRUCTION OF OPTIMAL LOW-RATE CONVOLUTIONAL CODESWHALE G.1980; ELECTRON. LETT.; ISSN 0013-5194; GBR; DA. 1980; VOL. 16; NO 20; PP. 767-768; BIBL. 5 REF.Article
A BANDWIDTH-EFFICIENT CLASS OF SIGNAL-SPACE CODESANDERSON JB; TAYLOR DP.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 6; PP. 703-712; BIBL. 16 REF.Article
SIMULTANEOUS PHASE TRACKING AND DETECTION IN DATA TRANSMISSION OVER NOISY DISPERSIVE CHANNELS.MAGEE FR JR.1977; I.E.E.E. TRANS. COMMUNIC.; U.S.A.; DA. 1977; VOL. 25; NO 7; PP. 712-715; BIBL. 14 REF.Article
Rate 16/17 maximum transition run (3;11) code on an EEPRML channel with an error-correcting postprocessorNISHIYA, T; TSUKANO, K; HIRAI, T et al.IEEE transactions on magnetics. 1999, Vol 35, Num 5, pp 4378-4386, issn 0018-9464, 3Article