• DocumentCode
    929358
  • Title

    Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problems

  • Author

    Chandrasekaran, B. ; Lakshmanan, K.B.

  • Volume
    24
  • Issue
    6
  • fYear
    1978
  • fDate
    11/1/1978 12:00:00 AM
  • Firstpage
    755
  • Lastpage
    759
  • Abstract
    The design of optimal, time-invariant, randomized, finite-state automata for K -hypothesis testing is an open problem for K > 2 . A lower bound is constructed on the smallest probability of error achievable by m -state automata solving a three-hypothesis Bernoulli problem. A class of close-to-optimal automata is exhibited that requires at most one extra bit of memory to match the performnnce of an optimal automaton.
  • Keywords
    Decision procedures; Finite-memory methods; Stochastic automata; Automata; Automatic testing; Computer science; History; Memory management; Military computing; Random variables; Size measurement; State-space methods; Stochastic processes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1978.1055968
  • Filename
    1055968
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=929358