Please use this identifier to cite or link to this item:
|Title:||Optimum symbol-by-symbol detection of uncoded digital data over the Gaussian channel with unknown carrier phase|
|Authors:||Kam, Pooi Yuen |
Ng, Seng Siew
Ng, Tok Soon
|Citation:||Kam, Pooi Yuen,Ng, Seng Siew,Ng, Tok Soon (1994-08). Optimum symbol-by-symbol detection of uncoded digital data over the Gaussian channel with unknown carrier phase. IEEE Transactions on Communications 42 (8) : 2543-2552. ScholarBank@NUS Repository. https://doi.org/10.1109/26.310614|
|Abstract:||A theory of optimum receiver design for symbol-by-symbol detection of an uncoded digital data sequence received over the Gaussian channel with unknown carrier phase is presented. Linear suppressed-carrier modulation is assumed. The work here aims at laying a conceptual foundation for optimum symbol-by-symbol detection, and rectifies existing approaches to the problem. The optimum receiver structure is obtained explicitly for an arbitrary carrier phase model, but its computational requirements are too heavy in general for any practical implementation. In one important special case, namely, the case in which the carrier phase can be treated as a constant over some K+1 symbol intervals, the optimum receiver can be approximated by a readily implementable decision-feedback structure at high SNR. Simulated error performance results are presented for this latter receiver for PSK modulations with various carrier phase models. Since a decision-feedback receiver can encounter a `runaway,' a variation of this receiver is developed which uses feedforward of tentative decisions concerning future symbols. This modified receiver does not have any `runaway' problem, and has been shown to yield good error performance via simulations.|
|Source Title:||IEEE Transactions on Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 12, 2019
checked on Sep 28, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.