Area-efficient decoders for rate-k/n convolutional codes and oth

Details Area-efficient decoders for rate-k/n convolutional codes and oth Area-efficient decoders for rate-k/n convolutional codes and oth

1994-03-09

1996-06-25

Baker, Stephen M.

Excavating

H03M 1312

Patent

active

055307078

ABSTRACT:
The present invention provides a method and apparatus for decoding data which has been encoded using high rate trellis codes, such as rate-k
convolutional codes. The method of the present invention includes assigning code states to each of a plurality of decoder processing elements; scheduling computation of a plurality of new path metrics within the processing elements using previously-computed path metrics and branch metrics which vary with the encoded data; scheduling access for each of the processing elements to an appropriate set of the previously-computed metrics, such that each of the previously-computed metrics in the appropriate set is accessed in series by a given processing element in order to compute the new path metrics; and using a survivor sequence of path metrics computed in accordance with the scheduling steps to estimate the uncoded data. The path metrics may be efficiently reordered as they are computed to facilitate access thereto for subsequent path metric computation.

REFERENCES:
patent: 4730322 (1988-03-01), Pollara-Bozzola
patent: 5068859 (1991-11-01), Collins et al.
Meier, S., "A Yiterbi Decoder Architecture Based on Parallel Processing Elements", Globecom '90, 1990, pp. 1323-1327.
Summerfield, S., "VLSI Design of Rate 2/3 Viterbi Decoder", IEE Collog. No. 206, 1992, pp. 8/1-8/4.
Feygin, G. et al., "A Multiprocessor Architecture for Viterbi Decoders with Lineas Speedup", IEEE Trans. on Signal Processing, vol. 41, No. 9, Sep. 1993, pp. 2907-2917.
Biver, M., et al., "In-Place Updating of Path Metrics in Viterbi Decoders", IEEE Jnl. of Solid-State Circuits, vol. 24, No. 4, pp. 1158-1160, Aug. 1989.
Black, P. J. and Meng, T. H.--Y., "A 140Mb/s 32-State Radix-4 Viterbi Decoder", 1992 International Solid-State Circuits Conference, pp. 70-71, 247, Feb. 1992.
Blahut, R. E., "Theory and Practice of Error Control Codes", pp. 382-388, Addison-Wesley, Reading, Mass., 1983.
Calderbank, A. R., and Sloane, N. J. A., "New Trellis Codes Based on Lattices and Cosets", IEEE Transactions on Information Theory, vol. IT-33, pp. 177-195, No. 2, Mar. 1987.
Collins, O. and Pollara, F., "Memory Management in Traceback Viterbi Decoders", TDA Progress Report 42-99, Jet Propulson Laboratory, pp. 98-104, Nov. 15, 1989.
Cypher, R. and Shung, C. B., "Generalized Trace Back Techniques for Survivor Memory Management in the Viterbi Algorithm", Proceedings of GlobeCom 1990, pp. 1318-1322, IEEE Press, Dec. 1990.
Divsalar, D. and Simon, M. K., "Trellis Coded Modulation for 4800-9600 bits/s Transmission Over a fading Mobile Satellite Channel", IEEE Jnl. on Selected Areas in Communication, vol. SAC-5, No. 2, pp. 162-175, Feb. 1987.
Fishburn, J. P. and Finkel, R. A., "Quotient Networks", IEEE Transactions on Computers, vol. C-31, No. 4, pp. 288-295, Apr. 1982.
Forney, G. D., Jr., "The Viterbi Algorithm", Proceedings of the IEEE, vol. 61, No. 3, pp. 268-278, Mar. 1973.
Gulak P. G. and Shwedyk, E., "VLSI Structures for Viterbi Receivers: Part I--General Theory and Applications", IEEE Jnl. on Selected Areas in Communications, vol. SAC-4, No. 1, pp. 142-154, Jan. 1986.
Gulak, P. G. and Shwedyk, E., "VLSI Structures for Viterbi Receivers: Part II--Encoded MSK Modulation", IEEE Jnl. on Selected Areas in Communications, vol. SAC-4, No. 1, pp. 155-159, Jan. 1986.
Gulak, P. G. and Kailath, T., "Locally Connected VLSI Architectures for the Viterbi Algorithm", IEEE Jnl. on Selected Areas in Communications, vol. 6, No. 3, pp. 527-537, Apr. 1988.
Lin, H-D., et al., "Folded Viterbi Decoders for Convolutional Codes", IEEE VLSI Signal Processing, vol. IV, pp. 381-391, IEEE Press, 1990.
Lin, H-D. and Shung, C. B. , "General In-Place Scheduling for the Viterbi Algorithm", Proceedings ICASSP-91, Toronto, Canada, May 14-17, 1991.
Parhi, K. K., "Systematic Synthesis of DSP Data Format Converters Using Life-Time Analysis and Forward-Backward Register Allocation", IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, vol. 39, No. 7, pp. 423-440, Jul. 1992.
Parhi, K. K., "Video Data Format Converters Using Minimum Number of Registers", IEEE Transactions on Circuits and Systems for Video Technology, vol. 2, No. 2, pp. 255-267, Jun. 1992.
Rader, C. M.,"Memory Management in a Viterbi Decoder", IEEE Transactions on Communications, vol. Com-29, No. 9, pp. 1399-1401, Sep. 1981.
Rahman, A. and Elhakeem, A. K., "Concatenated Combined Modulation and Coding of Frequency Hopping Multiaccess Systems", IEEE Jnl. on Selected Areas in Communications, vol. 8, No. 4, pp. 650-662, May 1990.
Shung, C. B., et al., "Area-Efficient Architectures for the Viterbi Algorithm-Part I: Theory", IEEE Transactions on Communications, vol. 41, No. 4, pp. 636-644, Apr. 1993.
Shung, C. B., et al., "Area-Efficient Architectures for the Viterbi Algorithm", Proceedings of GlobeCom 1990, pp. 1787-1793, IEEE Press 1990.
Sparso, J., et al., "An Area-Efficient Topology for VLSI Implementation of Viterbi Decoders and Other Shuffle-Exchange Type Structurs", IEEE Jnl. of Solid-State Circuits, vol. 26, No. 2, pp. 90-97, Feb. 1991.
Ungerboeck, G., "Channel Coding with Multilevel/Phase Signals", IEEE Transactions on Information Theory, vol. IT-28, No. 1, pp. 55-67, Jan. 1982.

Affiliated with

Also associated with

Rating

Area-efficient decoders for rate-k/n convolutional codes and oth does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Area-efficient decoders for rate-k/n convolutional codes and oth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Area-efficient decoders for rate-k/n convolutional codes and oth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2195373