A signal space representation of fixed delay tree search for use with d=0 codes

Author

Brickner, Barrett ; Moon, Jaekyun

Author_Institution

Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA

Volume

1

fYear

1995

Firstpage

577

Abstract

This paper addresses the optimality of the fixed-delay tree search with decision feedback (FDTS/DF) detector for data without a minimum run length constraint. The evaluation is performed by comparing the minimum distance for FDTS/DF with the minimum distance associated with a maximum likelihood sequence detector (MLSD). Using this distance information, potential improvements through coding are addressed. An alternative realization to the direct implementation of FDTS/DF is considered by examining the detection process in the context of a signal space

Keywords

FIR filters; circuit optimisation; decision feedback equalisers; digital filters; maximum likelihood detection; runlength codes; signal representation; tree searching; FDTS/DF detector; coding; d=0 codes; detection process; distance information; fixed delay tree search; fixed-delay tree search with decision feedback detector; maximum likelihood sequence detector; minimum distance; optimality; signal space representation; AWGN; Band pass filters; Decision feedback equalizers; Delay; Detectors; Gaussian noise; Intersymbol interference; Least squares approximation; Low pass filters; Magnetic noise; Magnetic recording; Maximum likelihood detection; Maximum likelihood estimation; Sampling methods; Signal detection; Space technology; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE

Print_ISBN

0-7803-2509-5

Type

conf

DOI

10.1109/GLOCOM.1995.501994

Filename

501994