It is trivial to see that for a frame of length bits and CRC polynomial degree, non-SRVF-based protocols require XOR operations and Left Shift operations.
As a first step to analytically model retransmissions of a Simple-ACK protocol, we compute the probability of receiving an error-free frame of length bits on a single-hop th-order Markov model.
Eight consecutive subframes are stored into one frame of the bit stream.
With frames of M bits, BER is the bit error rate and γ denotes the received signal-to-noise ratio (SNR).
The transmitted data frame is formed by four successive data frames of 8 bits that started and ended by a start bit ('0') and a stop bit ('1'), respectively.
In this contribution, a cooperative two-way relaying scheme is analyzed consisting of two terminals exchanging information, denoted T0 and T1, and one assisting relay, denoted R. At both T0 and T1, the information to be transmitted is divided into frames of K-coded bits, which are obtained by encoding the information bits by means of a channel encoder.
For a given frame, the number of bits that would have been used at the reference quantization level, denoted by bits (MQ _ref), can be estimated by the actual bits used to encode this frame, denoted by bits(MQ _input), and the two quantization matrices as shown in Equation 11.
For this simulation, 10,000 frames of 800 bits each were transmitted.
All nodes are saturated and transmit fixed length frames of L bits.
In the DF, CMRC, and DSTC schemes the required amount of memory are two frames of 96 bits each.
