Convolution Encoding and Decoding MCQ

Test your knowledge with important Convolution Encoding and Decoding MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Convolution Encoding and Decoding MCQs at Bissoy

• Branch word synchronization is the process of determining the
  ক

  Beginning of received sequence

  খ

  Beginning of transmitted sequence

  গ

  End of received sequence

  ঘ

  End of transmitted sequence
• Gaussian channel is a hard decision channel.
  ক

  True

  খ

  False
• Binary symmetric channel is hard decision channel.
  ক

  True

  খ

  False
• A binary symmetric channel is a
  ক

  Discrete memoryless channel

  খ

  Continuous memoryless channel

  গ

  Discrete memory channel

  ঘ

  Continuous memory channel
• Soft decision decoding requires
  ক

  Less memory

  খ

  More memory

  গ

  More speed

  ঘ

  None of the mentioned
• If the quantization level of a demodulator output is ________ then it is called as soft decision decoding.
  ক

  Equal to 2

  খ

  More than 2

  গ

  Less than 2

  ঘ

  None of the mentioned
• For a binary code, the maximum number of possible sequence made up of L branch words is
  ক

  L2

  খ

  2L

  গ

  2L

  ঘ

  L/2
• In maximum likelihood detector the error probability is
  ক

  Maximum

  খ

  Minimum

  গ

  Zero

  ঘ

  None of the mentioned
• In maximum likelihood decoding technique, the likelihood function compares the
  ক

  Joint probabilities

  খ

  Individual probabilities

  গ

  Conditional probabilities

  ঘ

  None of the mentioned
• Example for convolution encoder state diagram is
  ক

  Tree diagram

  খ

  Trellis diagram

  গ

  Tree & Trellis diagram

  ঘ

  None of the mentioned
• In trellis diagram, the number of nodes ______ at successive branching.
  ক

  Increases by 1

  খ

  Doubles

  গ

  Triples

  ঘ

  None of the mentioned
• How many number of transitions can be made at each bit time?
  ক

  One

  খ

  Two

  গ

  Three

  ঘ

  Half
• Finite state machines have
  ক

  Past memories also

  খ

  Only present and future memories

  গ

  Only future memories

  ঘ

  Only present memories
• Periodic truncation is done by
  ক

  Appending zero to end of the input data sequence

  খ

  Appending zero to the beginning of the input data sequence

  গ

  Appending one’s to end of the data sequence

  ঘ

  Appending one’s to beginning of the data sequence
• The method used for representing convolution encoder are
  ক

  Connection pictorial

  খ

  State diagram

  গ

  Tree diagram

  ঘ

  All of the mentioned
• The number of k bit shift over which a single information bit influences the encoder output is given by
  ক

  Code rate

  খ

  Constraint length

  গ

  Code length

  ঘ

  Code weight
• The measure of the amount of redundancy is given by
  ক

  Code size

  খ

  Code weight

  গ

  Code rate

  ঘ

  Minimum distance