Patent ID: 6859465

Claim:
A method for providing rate adaptation between a first node and a second node in a data communication environment employing bit stuffing, the data communication environment having a link budget of B bits per second the method comprising the steps of: randomizing one or more N-sized frames of user data at the first node according to a predetermined random sequence to produce one or more randomized N-sized frames of user data, comprising the step of combining the one or more N-sized frames of user data with one or more random sequences; detecting one or more occurrences of a flag sequence related event in the one or more N-sized frames of user data after the step of randomizing; inserting up to n bits in the one or more N-sized frames of user data according to a bit stuffing protocol for each of the one or more occurrences detected such that by performing the step of randomizing before the step of inserting n and N are selected such that n+N does not exceed B, wherein the step of inserting up to n bits further includes determining a distribution of stuffing bits n according to a probability distribution function h(n,N), the distribution associated with the one or more randomized N-sized frames such that n and N are selected so that n+N does not exceed B; and de-randomizing the one or more randomized N-sized frames of user data at the second node according to the predetermined random sequence, comprising the step of uncombining the one or more N-sized frames of user data with the one or more random sequences; wherein N is the size of the one or more N-sized frames in bits.