A block of data bits is encoded with a rate RSC code of constraint length and generator polynomials.
Each block of coded bits is then interleaved and rate-matched with a target rate, depending on the received channel quality indicator (CQI) user feedback.
If decoding fails, the node where decoding occurs (i.e., either the serving BS or the RNC) stores the information received by cooperating BSs and at the next slot a block of redundancy bits is transmitted by the MT. The process is stopped at slot τ n, either when the maximum number of retransmissions τmax is exceeded, i.e., when τ n = t n ( 0 ) + τ max − 1, (34).
A simple bit error correcting block code with block length bits is used by all nodes.
Syndromes (blocks of syndrome bits) are requested one by one through the feedback channel, and the requests are stopped when a sufficiently reliable decoded result is reached, see Figure 1.
To disguise the intruder completely, secret key based randomization of coefficients, blocks, and watermark bits is incorporated.
According to [26], if the block length of the input bits is k, then the degree distribution ρ(d) can be specified by an ideal Soliton distribution (ISD), i.e., rho(d=i) = left{ begin{array}{cccc} 1/k & textrm i=1, 1/i i-1) & textrm 2 leq ileq k end{array} right.
Each block of m information bits are combined to generate a symbol of GF q).
In case of error after the first source transmission, the CPR method and the Pre-HARQ scheme operate exactly as described in Section 2. In our simulations, for each E b /N0 value, 1000 blocks of 288 information bits are sent.
Also, PTS needs M times IDFT operations for each data block, and the number of required side information bits is log2 KM-1) to send to the receiver.
