The optimum decoding of component codes in block coded modulation (BCM) sch
emes requires the use of the log-likelihood ratio (LLR) as the signal metri
c. An approximation to the LLR for the least reliable bit (LRB) in an 8-PSK
modulation based on planar equations with fixed-point arithmetic is develo
ped that is both accurate and easily realisable for practical BCM schemes.
Through an error power analysis and an example simulation it is shown that
the approximation results in less than 0.06dB in degradation over the exact
expression at an E-s/N-o of 10dB. It is also shown that the approximation
can be realised in combinatorial logic using roughly 7300 transistors. This
compares favourably to a look-up table approach in typical systems.