×

Encoding arrangement and method for encoding(N-1)-bit information words into N-bit channel words and decoding arrangement and method for decoding the channel words into information words

  • US 5,774,077 A
  • Filed: 02/02/1996
  • Issued: 06/30/1998
  • Est. Priority Date: 02/08/1995
  • Status: Expired due to Fees
First Claim
Patent Images

1. Encoding arrangement for encoding (n-1)-bit information words into n-bit channel words so as to obtain a channel signal of concatenated channel words, the channel signal being a bit sequence having the virtue that at most k `zeros` between `ones` occur, the encoding arrangement comprising:

  • input means for receiving the (n-1)-bit information words;

    converting means for converting the (n-1)-bit information words into n-bit channel words; and

    output means for supplying the channel signal of concatenated n-bit channel words, wherein the converting means comprises;

    inserting means for inserting one bit of a first or a second binary value in between a specified first and a second neighbouring bit position in each (n-1)-bit information word to form an n-bit channel word, a `zero` bit being inserted in between said specified first and second neighbouring position of any particular (n-1)-bit information word if the number of leading `zeros` at the leading end of said any particular information word exceeds a specified first integer number, or the number of trailing `zeros` at the trailing end of said any particular information word exceeds a specified second integer number; and

    setting means for setting a logical value in a specified third bit position into a `one` value if the number of leading `zeros` exceeds said specified first number, and for setting a logical value in a specified fourth bit position into a `one` value if the number of trailing `zeros` exceeds said specified second number, the specified third bit position being one of a specified third number of leading bit positions of said any particular information word, the specified fourth bit position being one of a specified fourth number of trailing bit positions of said any particular information word, the specified third number being equal to the specified first number plus one, the specified fourth number being equal to the specified second number plus one, n and k being integer values and the specified first and second numbers having a relationship with k,the inserting means inserting a `zero` bit in between said specified first and second neighbouring position if a group of more than k consecutive bit positions in the any particular information word comprise all `zeros`, said group of more than k consecutive bit positions not comprising both the specified first and second bit positions.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×