Reduced Complexity Symbol Detectors with Parallel Structures for ISI Channels

IEEE Transactions on Communications

Volumn 42, Issue 234, 1994, Pages 1661-1671

  Erfanian, Javan ^a   Pasupathy, Subbarayan ^a   Gulak, Glenn ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; DECODING; MODULATION; SIGNAL INTERFERENCE; SIGNAL PROCESSING;

INTERSYMBOL INTERFERENCE; SEQUENCE ESTIMATION; VITERBI DETECTOR;

SIGNAL DETECTION;

EID: 0028372012     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.1994.582868     Document Type: Article

References (27)

1. S.U.Qureshi, “Adaptive Equalization,” Proc.IEEE vol.73, pp.1349-1387 1387 (Sep.1985).
2. R.W.Chang and J.C.Hancock, “On Receiver Structures for Channels Having Memory,” IEEE Trans. Inform. Theory IT-12, pp.463-468 (Oct. 1966).
3. K.Abend and B.D.Fritchman, “Statistical Detection for Communica­ - tion Channels with Inter-symbol Interference,” Proc. IEEE vol.-58, pp.779-785 (May 1970).
4. K.Abend, T.J.Harley, Jr., B.D.Fritchman, and C.Gumacos, “On Optimum Receivers for Channels Having Memory,” IEEE Trans. Inform. Theory IT-14, pp.819-820 (Nov. 1968).
5. J.F.Hayes, T.M.Cover, and J.B.Riera, “Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms,” IEEE Trans. Commun. COM-30, pp.152-157 (Jan. 1982).
6. G.Ungerboeck, “Nonlinear Equalization of Binary Signals in Gaussian Noise,” IEEE Trans. Common. Technol. COM-19, pp.1128-1137 (Dec. 1971).
7. J.G.Proakis, Digital Communications, McGraw-Hill (N.Y., 1983).
8. G.D.Fomey, Jr., “Maximum-Likelihood Sequence Estimation of Digital Sequence in the Presence of Intersymbol Interference,” IEEE Trans. Inform. Theory 1T-18, pp.363-378 (May 1972).
9. P.L.McAdam, MAP-Bit Decoding of Convolutional Codes, Ph.D. dissertation, Univ. of Southern California (Calif., 1974).
10. A.J.Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Trans. Inform. Theory 1T-13, pp.260-269 (Apr. 1967).
11. J.K.Omura, -Optimal Receiver Design for Convolutional Codes and Channels with Memory via Control Theoretical Concepts,” Inform. Sci. vol.3, pp.243-266 (July 1971).
12. H.Kobayashi, “Correlative Level Coding and Maximum-Likelihood Decoding,” IEEE Trans. Inform. Theory 1T-17, pp.586-594 (Sept. 1971).
13. M.V.Eyuboglu and S.U.H.Qureshi, “Reduced-State Sequence Estimation with Set Partitioning and Decision Feedback,” IEEE Trans. Comm um. COM-36, pp.13-20 (Jan. 1988).
14. P.G.Gulak and T.Kailath, “Locally Connected VLSI Architectures for the Viterbi Algorithm,” IEEE J. Selected Areas Commun. SAC-6, pp.527-537 (Apr. 1988).
15. H.K.Thaper and J.M.Cioffi, “A Block Processing Method for Designing High-Speed Viterbi Detectors,” Proceeding ICC, Boston (June 1989).
16. H.Lin and D.G.Messerschmitt, “Algorithms and Architectures for Concurrent Viler-hi Decoding,” Proceeding ICC, Boston (June 1989).
17. G.Fettweis and H_Meyr, “Parallel Viterbi Algorithm Implementation: Breaking the ACS Bottleneck,” IEEE Trans. Commun. COM-37, pp.785-790 (Aug. 1989).
18. S.J.Simmons, · “Breadth-First Trellis Decoding with Adaptive Effort,” IEEE Trans. Commun. COM-38, pp.3-12 (Jan. 1990).
19. S.Y.Kung, VLSI Array Processors, Prentice Hall (N.J., 1988).
20. J.A.Erfanian, S.Pasupathy, and G.Gulak, “Reduced Complexity Symbol Detectors with Parallel Structures for ISI Channels,” Proc. GLO-BECOM 90, San Diego (December 1990).
21. J.A.Erfanian and S.Pasupathy, “Low-Complexity Parallel Structure Symbol-By-Symbol Detection for ISI Channels,” IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing, Victona, B.C., Canada (June 1989).
22. J.A.Erfaman and S.Pasupathy, “Design of a Simplified Parallel Symbol Detector for ISI Channels,” Canadian Conference on Electrical & Computer Engineering, Montreal, Quebec, Canada (Sep. 1989).
23. J.A.Erfanian, “Low-Complexity Parallel Structures for Symbol-By-Symbol Symbol Detection,” M.A.Sc. Thesis, Department of Electrical Engineering, University of Toronto, Toronto, Ontario, Canada (Jan. 1989).
24. S.K.Rao and T.Kailath, “Regular Iterative Algorithms and their Implementation on Processor Arrays,” Proc. IEEE vol.76, pp.259-269 (Mar. 1988).
25. R.Lidl and H.Niederreiter, Finite Fields, Addison Wesley (1983).
26. G.D.Fomey, Jr., “The Viterbi Algorithm,” Proc. IEEE vol.61, pp.268-278 278 (Mar 1973).
27. J.F.Hayes, “The Viterbi Algorithm Applied to Digital Data Transmission,” IEEE Commun. Magazine vol-13, pp.15-20 (March 1975).