Prove that in 4 B / 5 B mapped data with the NRZI encoding, a signal transition will occur at

Prove that in 4 B / 5 B mapped data with the NRZI...

Key Concepts

4B/5B Encoding

4B/5B encoding is a block coding technique that maps groups of 4 bits to 5-bit symbols. This mapping is designed to eliminate long sequences of zeros, ensuring that the encoded data contains enough transitions to facilitate proper clock recovery. By carefully selecting 5-bit codes that have a minimum number of ones, the 4B/5B method inherently limits the maximum run lengths of consecutive zeros, which is essential in high-speed data communication to maintain synchronization between the transmitter and receiver.

NRZI Encoding

NRZI (Non-Return-to-Zero Inverted) encoding is a line coding method where the presence or absence of a signal transition indicates the data bit. Typically, a '1' is represented by a transition, while a '0' is represented by maintaining the current signal level, though the convention can be reversed. The use of NRZI makes it crucial to design the bit stream such that periodic transitions occur, ensuring that long runs of identical bits do not lead to clock drift. When combined with techniques like 4B/5B encoding, NRZI benefits from the guaranteed signal transitions, thus maintaining reliable timing synchronization.

Signal Transitions and Clock Recovery

Signal transitions are changes in the electrical level of a communication channel that are used to derive timing information at the receiver end. In digital communication systems, frequent transitions are important because they allow the receiver to synchronize its clock with that of the transmitter. If transitions occur too infrequently, it can lead to synchronization errors or loss of data integrity. Therefore, in encoding schemes that mandate a transition at least every few bit times, the design ensures that the absence of transitions does not impair the recovery of the clock signal, which is critical for accurately interpreting the received data.

Transcript

00:01 We're asked to show that b of 2, where b is the function from the busy beaver problem, which is the maximum number of ones at a turing machine with two states with the alphabet 1b may print in a tape that is initially blank.

00:22 We're asked to show that this is at least 4 by finding with the turing machine with at least two states, or with two states in an alphabet 1b that halts with four consecutive ones on the tape.

00:35 So, we have some turning machine t, set of states, s, set of inputs, i, transition function f, and the initial state s0, and we know because we're looking for b of 2 that the set of states is going to include s0 and one other states, s1.

00:58 And because this is the busy beaver problem, i has to be 1 or b.

01:05 We have.

01:06 Now we want to make it so if we start with a blank.

01:09 Tape we can end up with four ones before the machine halts.

01:16 So starting out, of course we're going to be starting in state s0 with a blank.

01:28 So we want to have an input for this.

01:31 So if we're at s zero more blank, well, we can't stay in state s zero because if we do, then whatever happens in this step is going to have for every step after this.

01:49 And so we'll end up with either an infinite string if we make, if we change this b to a 1 and stay in state s0, or we'll end up with a string with no ones on it if we decide to keep the blank a blank.

02:08 So we're going to change to a new state s1.

02:12 And at this point, because we're trying to maximize the number of ones we want to put on this tape, i would suggest that here we want to change this black to a 1, and then move left.

02:28 And we'll see why we move left in just a second.

02:30 So once we move left, now we're going to be in state s1, and we're going to read a blank.

02:37 So we should have some five tuple for this.

02:40 So if we're in state s1 to read a blank, it seems to make sense that we would want to change this blank to a 1.

02:49 The question becomes, what state should be entered after this, and which direction should be moved? well, we see that if we enter a state, it has to be s0 or s1.

03:04 Now if we are to enter, say, s0, suppose we enter s0 and we move to the right.

03:14 Then we're going to have to make a five -touple with the input s0 -1.

03:26 And it's not entirely clear what's going to happen if we do that.

03:32 However, suppose we stay in the state s -1.

03:38 We don't want to move left because then we're going to encounter another blank in the state s1, and we'll just keep making blanks so that we have an infinite number of ones to the left, and the machine will never halt.

03:50 But if we move to the right, then suddenly we have the input s11, and we have not encountered a 5 -2 yet for this.

04:02 So for s -1, we have a rule for s -0 blank, so it seems to make sense that we'd want to move from this 1, onto a blank.

04:14 So we're going to keep this one of one, and it seems like we want to stay in state s1, or shift to state s0, as we move right to encounter another blank...

Please give Ace some feedback