fig1 shows how sequence number space is used in an embodiment of the invention . new data 100 to be transmitted is placed into full - rate rlp frame 140 . within rlp frame 140 are a sequence number 150 and the data 100 . new data 102 to be transmitted is placed into full - rate rlp frame 142 . within rlp frame 142 are a sequence number 152 and the data 102 . if new data 104 has fewer bytes than the maximum for a full - rate rlp frame , it is placed into non - full - rate rlp frame 144 . within rlp frame 144 are not only a sequence number 154 and the data 104 , but also a data length 164 . as with rlp2 , this embodiment of the invention allows the use of lower - rate frames within a given channel capacity , for example half - rate frames in a 9600 bps channel , to carry smaller rlp frames . in an exemplary embodiment of the invention , each sequence number corresponds to the first byte of the data in the rlp frame . the sequence number carried within an rlp frame is called the rlp sequence number . the data 100 , 102 , and 104 transmitted in the three rlp frames 140 , 142 , and 144 , reside within sequence number space 110 . in an exemplary embodiment of the invention , the sequence numbers are byte sequence numbers , proceeding sequentially from low values on the left to high values on the right . in the current embodiment , as sequence numbers are either used or skipped , they increase monotonically . when a predetermined sequence maximum sequence number value is reached , the sequence numbers begin again at zero . as the data bytes 102 placed into rlp frame 142 , they are each assigned sequential byte numbers from a block of sequence numbers 126 . in an exemplary embodiment , the first byte of block 126 is a predetermined numeric distance 134 a from the first byte of the block 122 used to transmit the previous rlp frame . this predetermined distance is called a page size , and sequence numbers within the predetermined distance are collectively called a page . the sequence number block used to send data always starts at the beginning of a page . for example , sequence number block 122 starts at the beginning of page 134 a , sequence number block 126 starts at the beginning of page 134 b , sequence number block 130 starts at the beginning of page 134 c . one side - effect of always starting a new frame at the beginning of a page is that a block of sequence numbers at the end of a page , for example 124 , 128 , and 132 , may not be assigned to transmitted data bytes . in an exemplary embodiment of the invention , a shortened rlp sequence number is used , which is equal to the byte sequence number of the first data byte in the rlp frame divided by the page size . the number of bits required to represent a shortened rlp sequence number is fewer than the bits required to represent the actual byte sequence number . in another embodiment of the invention , the most - significant bits are also omitted from the byte sequence number when such omission causes no ambiguity about which data is contained in the data portion of the rlp frame . for example , if a byte sequence number of 20 bits is used , but fewer than 2 16 bytes are outstanding ( have not been explicitly or implicitly acknowledged ), the most significant 4 bits of the byte sequence number need not be sent in the rlp sequence number . these 4 most significant bits can be safely omitted from the rlp sequence number without causing ambiguity in the sequence numbers of the bytes contained in the frame . though the shortening of the sequence number is portrayed herein as omitting a number of most significant bits from the sequence number , one skilled in the art will appreciate that the same result may be obtained by performing a modulo function on the sequence number without departing from the current invention . if , however , more than 2 16 bytes are outstanding , it may be that more than one of the outstanding data bytes have the same shortened rlp sequence number . in an exemplary embodiment of the invention , retransmit frames carrying such data bytes will include the entire 20 - bit sequence number . when an rlp frame is negatively acknowledged ( nak &# 39 ; d ) and must be retransmitted , the data is inserted into rlp retransmit frames and retransmitted . if the channel capacity during retransmission is sufficient , then the retransmit frame is the same size as the original , lost rlp frame . in the case where the retransmit frame and the original rlp frame are the same size , the retransmit frame may use the same shortened rlp sequence number as the original , as long as doing so causes no sequence number ambiguity . if an original transmit frame carries more data than will fit into a single retransmit frame , as is possible when channel capacity decreases , then the data from the original transmit frame is divided among several smaller retransmit frames . each retransmit frame contains its own rlp sequence number , which may or may not be shortened in one of the ways previously discussed . if a retransmit frame is lost during transmission , that individual retransmit frame may be nak &# 39 ; d , and subsequently retransmitted . in the rare event that channel capacity decreases before a retransmit frame is nak &# 39 ; d , the data in that retransmit frame may be further divided among even smaller , independent retransmit frames before their second retransmission . this procedure differs from rlp2 , in which retransmit segments corresponding to a single lost frame all carry the same rlp sequence number . in order to recover the data in a single , lost retransmit segment , all retransmit segments carrying the sequence number of the lost frame must again be retransmitted . fig2 . shows the use of byte sequence number space and rlp sequence numbers when the data in a lost rlp frame must be retransmitted in several smaller rlp retransmit frames , and in accordance with an exemplary embodiment of the invention . the division of retransmit bytes may be necessary when channel capacity is reduced between the time of transmission of the original rlp frame and the retransmission of its data . in the example shown , the sequence number space 228 used to represent the bytes in the original , lost rlp frame is divided among several rlp retransmit frames 230 . sequence number space 228 is divided into smaller portions 220 , each having a size less than or equal to the capacity of full - rate frames on the current transmit channel . the data 200 corresponding to each of the smaller sequence number space portions 220 is placed into an rlp retransmit frame 230 . each rlp retransmit segment has an rlp sequence number 240 corresponding to the first byte of its respective sequence number space 220 . for example , sequence number 240 a has a value representative of the first value in sequence number space 220 a . the rlp sequence number 240 in each retransmit frame 230 may optionally be shortened in the same ways as discussed for rlp sequence numbers as long as doing so causes no sequence number ambiguity . each rlp retransmit frame may optionally have a data length 250 . the data length 250 carried by each rlp retransmit frame indicates the number of data bytes 200 within the frame . for example , data length 250 a is equal to the number of data bytes 200 a in retransmit frame 230 a . if the length of data is indicated in other parts of the retransmit frame 230 , for example in a type field not shown in the figure , the data length field 250 may be omitted . formation of rlp retransmit frames continues until the last portion of data 200 n is placed into an rlp retransmit frame 230 n . the last in a series of rlp retransmit frames often contains fewer than the maximum number of data bytes 200 n , and so typically contains a data length 250 n . in the preferred embodiment of the invention , rlp sequence numbers for the most common transmit frames are shortened by omitting least significant bits and most significant bits . in an exemplary embodiment of the invention , the byte sequence number has 20 bits , a page size of 64 bytes is used , and the number of outstanding rlp transmit frames rarely exceeds 256 . table 1 shows the fields of rlp frame headers used in accordance with the preferred embodiment of the invention . the contents of the frame headers may be placed at the beginning , the end , or dispersed deterministically throughout the rlp frame . in the preferred embodiment of the invention , the rlp frame header appears at the beginning of each rlp frame . dispersion of the contents of the header throughout the frame may be desirable if a non - uniform probability of bit error exists throughout the rlp frame when received by the receiver . a varying number of type bits are used to denote rlp frame type . collectively , these type bits form a variable - bit - length type field , which indicates the type of rlp frame being transmitted , as well as the format of the rest of the rlp header . in table 1 , the “ frame type descriptions ” column contains a description of the frame type corresponding to each type field value . the frame type descriptions in the “ frame type descriptions ” column are identified with frame type numbers for purposes of discussion . all columns except the “ frame type descriptions ” column show fields actually contained in the rlp header . the type field is followed by the rlp sequence number . when possible without causing sequence number ambiguity , shortened rlp sequence numbers of 8 bits are used . at other times , shortened rlp sequence numbers of 14 bits or full 20 - bit rlp sequence numbers are contained by the rlp header . shortened rlp sequence numbers of 8 bits are generated from the 20 - bit byte sequence number corresponding to the first data byte in the frame . a 20 - bit byte sequence number is converted to an 8 - bit shortened rlp sequence number by omitting the least significant 6 bits and the most significant 6 bits of the byte sequence number . the use of an 8 - bit rlp sequence number is particularly advantageous , as 8 - bit numbers are more easily manipulated by most modern microprocessors and in modern software . in the preferred embodiment of the invention , the enhanced rlp protocol is designed to maximize the number of rlp frames transmitted with 8 - bit rlp sequence numbers . a 20 - bit byte sequence number is converted to an 14 - bit shortened rlp sequence number by omitting the least significant 6 bits of the byte sequence number . when a 20 - bit rlp sequence number is to be sent in an rlp frame , the 20 - bit byte sequence number is simply copied into the rlp sequence number . in the preferred embodiment of the invention , most frames carrying data to be transmitted for the first time use an 8 - bit rlp sequence number . these frame types are identified in the “ frame type descriptions ” column as types 1 and 3 . in addition , rlp retransmit frames may also use 8 - bit rlp sequence numbers , as indicated by type 2 . frame types 4 , 5 , and 6 contain 14 - bit rlp sequence numbers . these frames may optionally be used to avoid sequence number ambiguity in the event that an outstanding frame has the same 8 - bit rlp sequence number as would otherwise be used by the next frame to be transmitted . these frames may also be optionally used in retransmitting data from negatively - acknowledged ( nak &# 39 ; d ) frames . frame types 7 and 8 contain full 20 - bit rlp sequence numbers . these frames are used when channel capacity decreases before nak &# 39 ; d data can be retransmitted in fewer retransmit frames . here is an example of the use of retransmit frame types when channel capacity is reduced before retransmission . 750 bytes of data , bearing byte sequence numbers 1000 to 1749 , are lost during transmission of a single rlp transmit frame on a 307 kbps channel . by the time the receiver sends a nak frame back to the transmitter , the channel capacity has been reduced to 9 . 6 kbps . the 750 bytes of lost data must now be retransmitted over a 9 . 6 kbps channel . in using fig2 to represent this scenario , sequence number space 228 is the range of sequence numbers from 1000 to 1749 . in a simple extension of rlp2 , each retransmit frame using a frame type 8 header on a 9 . 6 kbps channel carries 15 bytes of data . using this as an example , the 750 bytes of retransmit data would be distributed among 50 rlp retransmit frames . in fig2 , rlp retransmit frame 230 , would have a frame type 8 header with a 20 - bit sequence number of 1000 and a length of 15 . with n = 50 , frame 230 n − 1 would have a frame type 8 header with a 20 - bit sequence number of 1720 and a length of 15 . the use of frame type 8 indicates to the receiver that there are more data bytes assigned to the sequence number space between the retransmit frame and the next page boundary . frame 230 n would have a frame type 7 header with a 20 - bit sequence number of 1735 and a length of 15 . the use of frame type 7 in the last retransmit frame indicates to the receiver that there is no data assigned to the sequence number space between the last byte in the frame and the next page boundary . any frames of type 7 or 8 may be individually nak &# 39 ; d and again retransmitted . in a simple improvement of the previous example , a variation of frame type 8 has a header with no length byte , allowing the frame to carry 16 bytes of data . frame type 9 carries the control / sequence frames used for synchronization in an rlp protocol . the use of control / sequence frames is described in detail in aforementioned rlp2 . in frame headers having no length field , the data length is interpreted to be the maximum number of bytes which can fit into the remainder of the transmitted frame . in this way , the enhanced rlp protocol described herein is easily extensible for use in channels having greater capacity than specified in aforementioned rlp2 or cdma2000 . in many anticipated extensions , no modification of the enhanced rlp protocol would be necessary to accommodate new channel capacities . the receiver , upon receiving rlp frames in the formats described herein , use shortened sequence numbers to reproduce the original byte sequence numbers to be applied to the bytes contained in each rlp frame . when a frame is received whose rlp sequence number indicates the loss of one or more preceding frames , the receiver sends a nak to the transmitter . the nak frame may optionally specify the number of bits to be used in the rlp sequence number of the corresponding rlp retransmit frame . though the preferred embodiment of the invention specifies the use of 20 - bit byte sequence numbers and 8 -, 14 -, and 20 - bit rlp sequence numbers , many other choices of sequence number sizes may be made without departing from the current invention . the use of rlp sequence numbers which enable unambiguous omission of most significant or least significant portions of the byte sequence number space are objects of various embodiments of the current invention , as are the selection of page sizes which are powers of 2 and the use of 8 - bit shortened rlp sequence numbers . fig3 is a flow chart of the steps used to transmit a data frame in accordance with an embodiment of the invention . in the start of frame transmission processing 302 , the transmitter evaluates 304 whether the transmitter must transmit a new rlp transmit frame or an rlp retransmit frame . this decision is based on whether nak frames specifying lost transmitted data have been received previously . before forming a transmit frame , a transmit data buffer or queue is inspected to determine 306 whether the transmitter has new data to send . if there is no data which needs to be sent , an idle frame is formed 308 and transmitted 326 . the use of sync , ack , and idle frames is detailed in aforementioned rlp2 . in one embodiment of the invention , idle frames are placed in smaller , lower - data - rate over - the - air frames to minimize the air link capacity impact of the idle frame transmission . in alternative embodiments of the invention , idle frames may not be transmitted at all , or are sent less frequently than every frame period . if it is determined 306 that the transmitter has new data to send , the transmitter then evaluates 308 whether the data may be in a frame having an 8 - bit rlp sequence number without causing sequence number ambiguity . if an 8 - but sequence number causes no ambiguity , then an rlp transmit frame having an 8 - bit rlp sequence number is formed 314 and transmitted 326 . if the number of data bytes to be sent is less than the maximum for a full - rate frame , the frame formed 314 will have a length field . if the number of data bytes to be sent is greater than or equal to the maximum for a full - rate frame , then that maximum number of data bytes is inserted into a full - rate frame 314 , and that frame is transmitted 326 . the rlp sequence number inserted into new transmit frames at steps 312 or 314 is generated from the byte sequence number beginning the next unused page . if the transmitter determines 304 that the transmitter must transmit an rlp retransmit frame , then the next step is to determine 322 whether a full 20 - bit rlp sequence number is required in the next rlp retransmit frame . a full 20 - bit rlp sequence number is required if the data to be retransmitted must be retransmitted in more rlp frames than were used to originally transmit the data , as is possible when channel capacity is decreased in - between transmission and retransmission . if the next frame must be sent with a 20 - bit rlp sequence number , then an rlp retransmit frame is formed and filled with data 324 , and transmitted 326 with an rlp sequence number corresponding to the first byte of data in the rlp retransmit frame . if the transmitter determines 322 that a 20 - bit rlp sequence number is not necessary , then the transmitter must then choose 318 between the use of an 8 - bit or a 14 - bit rlp sequence number for the next retransmitted rlp frame . once the determination of required sequence number bit - size is complete 318 , the transmitter forms an rlp transmit frame with an 8 - bit rlp sequence number 320 , or forms an rlp transmit frame with a 14 - bit rlp sequence number 316 and transmits the frame 326 . in either case 316 or 320 , the rlp sequence number inserted into the frame will be generated from the byte sequence number corresponding to the first byte of the data contained in the frame . that byte sequence number will be the first byte sequence number of a sequence number page . if necessary to avoid ambiguity about data size , the rlp header of the retransmitted rlp frame will contain a length field . fig4 is a flow chart of the steps used to extract data from a received data frame in accordance with an embodiment of the invention . upon receiving an rlp data frame or an idle frame containing an rlp sequence number 402 , the receiver expands the received rlp sequence number from the rlp frame as necessary to form a byte sequence number , and extracts any data bytes from the frame 404 . the receiver then determines 406 , from that byte sequence number whether rlp frames carrying data have been lost . in an exemplary embodiment of the invention , the determination of lost data is made by comparing the byte sequence number indicated by the most recently received rlp data frame to the byte sequence number corresponding to the byte sequence number of the latest previous data byte successfully received . for example , the last byte of a received rlp data frame which is not a retransmission is considered the latest previous data byte successfully received . if the byte sequence number expanded from a received rlp data frame which is not a retransmission , or of a received rlp idle frame , is different by greater than a page from the sequence number of the latest previous data byte successfully received , then the loss of one or more lost rlp data frames has occurred . the aforementioned rlp2 protocol describes the use of timers and frame counters in determining the loss of retransmitted rlp frames . these techniques are also used in embodiments of the current invention . upon determining that data has been lost 406 , the receiver forms and sends a nak frame 408 to request retransmission of the lost data . in an alternate embodiment of the invention , the receiver may specify , within the nak frame , a reduced number of bits to be used in the rlp sequence numbers within retransmitted rlp frames , based on the receiver &# 39 ; s knowledge of byte sequence number space of bytes successfully received . upon determining that data has not been lost 406 , the receiver forms and sends rlp idle or rlp data frames as appropriate . in alternative embodiments of the invention , idle frames may not be transmitted at all , or are sent less frequently than every frame period . fig5 is a diagram of a data communications system configured in accordance with an embodiment of the invention . as shown , transmitter 502 communicates with receiver 504 over a wireless communication channel 506 . rlp data frames and control frames are sent from transmitter 502 to receiver 504 along channel 506 a , and rlp acknowledgments or nak &# 39 ; s are sent from receiver 504 to transmitter 502 along channel 506 b . during transmission , the capacity of transmission channel 506 may change , sometimes requiring retransmission of data over a channel of lesser capacity than used in the original transmission . for example , a large , full - rate rlp data frame may be sent by transmitter 502 over channel 506 a , but not received successfully by receiver 504 . then , the capacity of channel 506 is reduced either shortly before or shortly after receiver 504 sends a nak frame for the lost data on channel 506 b . transmitter 502 must now distribute the data bytes from the original lost full - rate rlp data frame among several smaller rlp frames for retransmission over reduced - capacity channel 506 b . if receiver 504 determines that one or more retransmitted rlp frames have been lost upon retransmission over reduced - capacity channel 506 a , receiver 504 may individually nak those individual lost retransmit frames over channel 506 b . in an exemplary embodiment of the invention , transmitter 502 includes a processor connected to a memory and an apparatus for wirelessly transmitting and receiving bytes processed by the processor . the processor is provided with a byte stream to be transmitted over the transmit apparatus and forms transmissions in accordance with the enhanced radio link protocol ( rlp ) described hereinbefore . in an exemplary embodiment of the invention , receiver 504 includes a processor connected to a memory and an apparatus for wirelessly transmitting and receiving bytes processed by the processor . the processor is provided with received data received from the receive apparatus and forms response frames for transmission in accordance with the enhanced radio link protocol ( rlp ) described hereinbefore . various embodiments of the present invention used to prevent sequence number ambiguity are discussed in relation to fig6 through fig9 . some of the described embodiments use different numbers of bits to represent full and shortened rlp sequence numbers . to avoid confusion when discussing sequence number variables introduced in rlp2 , such as l_v ( r ), l_v ( n ), l_v ( s ) and their shortened versions v ( r ), v ( n ), v ( s ), this application simply refers to them as v ( r ), v ( n ) and v ( s ), and supplements them where necessary with the words “ full ” and “ shortened ”. also , because sequence numbers are represented by a fixed number of bits , their values can “ wrap around ,” causing a subsequent sequence number to sometimes have an arithmetically lesser value than an earlier one . in comparing two sequence numbers , it is said that a first sequence number is “ less than ” a second sequence number when it is used to carry data which precedes that of a frame having the second sequence number . the second sequence number regardless of arithmetic relationships , is said to be “ greater than ” the first sequence number . fig6 is a flow chart of the steps used by a data receiver in an rlp link in sending negative acknowledgment ( nak ) frames to the sender in accordance with an embodiment of the invention . the flow chart begins at the stage 602 with the determination that the data receiver must send a nak frame to the data sender . this determination is usually based on the receipt of a new - data frame having a full sequence number greater than v ( r ), which indicates that one or more frames sent by the data sender were not received by the data receiver . during evaluation step 604 , the data receiver determines which of several types of retransmission frames to request . the difference between the several types of rlp retransmission frames is the number of bits used by the rlp sequence number field ‘ seq ’. at first , the size of ‘ seq ’ might seem unimportant , because it represents such a small portion of most rlp data frames . in the case of rlp2 , the ‘ seq ’ field is 8 bits . the difference of a few sequence number bits in a retransmit frame is significant , however , because these few extra bits can often necessitate segmentation of a retransmit frame into multiple frames . this is undesirable , because every additional retransmit frame incurs the cost of frame overhead , thus consuming extra bandwidth . the majority of new - data frames sent over an rlp link are typically full - rate data frames . in the enhanced protocol described above , a requested retransmit frame will often have been originally sent in a frame format that utilized a shortened sequence number to allow squeezing the maximum number of data bytes into the frame . the frame formats used with full - rate frames in rlp are designed to use every possible bit in the frame for carrying the data payload . if ‘ seq ’ suddenly grows by even a single bit , it can cause the frame to be too small to carry the original data . as a result , the data must be segmented and divided among two rlp retransmit frames . for this reason , it is much more efficient to retransmit full - rate rlp frames using the same shortened sequence number as the original whenever possible . in accordance with the present invention , sequence numbers may be converted to shortened sequence numbers in a variety of ways . using the methods described in the aforementioned rlp2 , 12 - bit sequence numbers are shortened to 8 bits by performing a modulo 256 function on the full 12 - bit frame sequence number . in an exemplary embodiment using byte sequence numbers , a 20 - bit sequence number may be shortened to either 8 or 14 bits as described above for use with a dynamic capacity channel . in an exemplary embodiment of the present invention , the nak frame format includes a ‘ rexmitseqsize ’ field specifying the size of the ‘ seq ’ field to be used in the requested retransmit frames . as in rlp2 , nak frame optionally contain ‘ first ’ and ‘ last ’ fields , indicating a range of consecutive frames to be retransmitted , or bit maps identifying the sequence number values of non - consecutive data frames to be retransmitted . in an exemplary embodiment , the ‘ first ’ and ‘ last ’ fields in a nak frame are always represented by full - sized sequence numbers . in an exemplary embodiment where both sides of the link maintain 12 - bit v ( n ), v ( r ) and v ( s ) frame sequence numbers , the ‘ first ’ and ‘ last ’ fields in the nak packet will also be 12 bits . in another exemplary embodiment where both sides of the link maintain 20 - bit v ( n ), v ( r ) and v ( s ) byte sequence numbers , the ‘ first ’ and ‘ last ’ fields in the nak packet will both be 20 bits . in an exemplary embodiment that utilizes two sizes of sequence numbers in retransmit frames , the ‘ rexmitseqsize ’ field is represented by a single bit in the nak frame . in an exemplary embodiment , a ‘ 1 ’ value in the ‘ rexmitseqsize ’ field is used to request a retransmit frame with a 12 - bit sequence number , and a ‘ 0 ’ is used to request a retransmit frame with a shortened 8 - bit sequence number . in another exemplary embodiment that utilizes three sizes of sequence numbers in retransmit frames , the ‘ rexmitseqsize ’ field is represented by two bits in the nak frame . one skilled in the art will appreciate that the number of sequence number sizes used and the specific values chosen may be varied without departing from the present invention . by specifying a number of bits to be used in retransmit frames , the data receiver controls the type of retransmission frames sent in response to the nak frames . the frame size decision in step 604 is based on a desire to ask for the smallest sequence number size which will avoid sequence number ambiguity in retransmit frames . the ‘ rexmitseqsize ’ field is specified such that the entire full rlp sequence number can be unambiguously reconstructed from the sequence number bits in the subsequent received retransmit frame . in an exemplary embodiment , using 12 - bit frame sequence numbers step 604 chooses a sequence number size of either 12 or 8 bits . in this embodiment , v ( n ) and v ( r ) are compared to each other according to equation ( 1 ). using this equation , the size of the sequence number space between v ( n ) and v ( r ) is compared to the size of the sliding window covered by a sequence number of n bits ( in this example , n is equal to 8 ). if the sequence number space is larger than 2 n , then a nak is sent requesting that the full 12 - bit sequence number (‘ seq ’ field ) be used in corresponding retransmit frames 608 . otherwise , a nak is sent requesting that the shortened sequence number (‘ seq ’ field ) be used in corresponding retransmit frames 606 . using equation ( 1 ) to determine the size of ‘ seq ’ is advantageous , because common microprocessors can perform the comparison quickly and efficiently . in another embodiment , the data receiver compiles a “ hole list ” of all the sequence numbers between v ( n ) and v ( r ) which were not received . the sequence numbers in this hole list represent those which must be negatively acknowledged ( nak &# 39 ; d ). retransmit sequence number ambiguity can only exist if one shortened sequence number can be used to represent more than one full - length sequence number in the hole list . a set of more than one full - length sequence number corresponding to the same shortened sequence number is called a “ match .” in an exemplary embodiment using a hole list , the size of sequence number requested is based , not on equation ( 1 ), but on the contents of the hole list . if a match is found among sequence numbers in the hole list , the use of shortened sequence numbers in associated retransmit frames can potentially cause ambiguity for the data receiver . in an exemplary embodiment of the invention , the data receiver solves this problem by requesting that all retransmit frames having sequence numbers in a match be transmitted with full sequence numbers . in another embodiment , the data receiver chooses one sequence number of the match for retransmission with a shortened sequence number , and specifies that the rest be retransmitted with full sequence numbers . when the retransmission arrives with a shortened sequence number , the data receiver can identifies its full sequence number according to which nak frames were sent requesting shortened sequence numbers . in the preferred embodiment of the invention , the earliest sequence number of a match is chosen for retransmission using a shortened sequence number . in another embodiment using a hole list , the data receiver only sends a nak for the earlier sequence number of a match . the nak for the latter sequence number of a match is not sent until a retransmit frame for the earlier sequence number is successfully received . in an exemplary embodiment , there is no need to request full sequence numbers in retransmit frames , because the data receiver uses the round - trip - delay of the link to identify the nak corresponding to each received retransmit frame . depending on the implementation , searching through the hole list may require more computational power than using the equation ( 1 ), but it minimizes unnecessary requests for long sequence numbers . using equation ( 1 ) can sometimes lead to requesting a long sequence number when no ambiguity would result from using a shortened sequence number . after either sending a nak requesting a shortened ‘ seq ’ 606 or sending a nak requesting a full ‘ seq ’ 608 , the method of fig6 continues on to process other received frames 610 . fig7 is a flow chart of the steps used by a data sender in an rlp link in responding to received nak frames and sending rlp retransmit frames in accordance with an embodiment of the invention . upon receiving a nak frame 702 , as described in conjunction with fig6 , the ‘ rexmitseqsize ’ field is inspected 704 to determine the size of sequence number requested in retransmission . if the nak frame allows the use of a shortened sequence number in the retransmit frame , then the corresponding retransmit frame or frames are sent 706 using shortened sequence numbers . if the nak frame contains a request for full - sized sequence numbers , then the corresponding retransmit frame or frames are sent 708 using full - sized or “ full ” sequence numbers . as mentioned above , the use of full sequence numbers may , by itself , necessitate segmentation in retransmitting a full - rate frame . after sending the requested retransmit frames , the method of fig7 then continues to process other frames 710 . fig8 is a flow chart of the steps used by a data sender in a radio link protocol ( rlp ) link in choosing the number of bits in the sequence number of new - data frames in accordance with an embodiment of the invention . the exemplary embodiment of an rlp protocol shown in fig8 is unusual in that the data sender keeps track of the value of v ( r ) r belonging to the data receiver . this is a departure from previous forms of rlp , in which the data sender tracks only its own variables , v ( n ) s , v ( r ) s and v ( s ) s . in this discussion , the references to the normal rlp variables v ( n ), v ( r ) and v ( s ) include subscripts “ r ” to denote rlp variables belonging to the data receiver , and “ s ” to denote rlp variables belonging to the data sender . the flow chart begins with the determination 802 that the data sender has new data to send in a new - data frame . an analysis is performed 804 to determine the size of the sequence number to use in the new - data frame . in the exemplary embodiment , the data sender uses the value of v ( r ) r to decide whether to send a full sequence number or a shortened sequence number in the new - data frame to be sent . as discussed above , full sequence numbers may be converted to shortened sequence numbers in a variety of ways . regardless of which conversion method is used , it is essential , that a new frame not be sent with a shortened sequence number if the corresponding full sequence number cannot be unambiguously identified by the data receiver . in rlp2 , for example , both sides maintain 12 - bit variables for v ( n ), v ( r ) and v ( s ), but the sequence numbers are shortened to 8 bits using a modulo 256 function . the shortened 8 - bit sequence numbers can be used to unambiguously identify sequence numbers from v ( r ) to v ( r )+ 255 . beyond this sequence number range , the use of an 8 - bit sequence number is no longer effective . as discussed previously , high - data - rate channels make the exhaustion of this 8 - bit sequence number range far more likely . in the embodiment shown in fig8 , the choice between an 8 - bit or a 12 - bit sequence number size is based on a comparison of v ( r ) r and v ( s ) s , as shown in equation ( 2 ). in accordance with this equation , the size of the sequence number chosen for the new - data frame in step 804 will be 12 bits if v ( s ) s is greater than or equal to v ( r ) r + 256 , and 8 bits otherwise . in a system using a different method of shortening sequence numbers , the conditional comparison of equation ( 2 ) is adjusted as necessary to avoid new - data frame sequence number ambiguity . in an exemplary embodiment , in a system utilizing 8 - and 14 - bit shortened byte sequence numbers as described above , equation ( 2 ) would be unchanged , because the 8 - bit sequence number is equivalent to a frame sequence number . following the determination of appropriate sequence number size 804 , either a new - data frame with a shortened ‘ seq ’ is sent 806 , or a new - data frame with a full - sized ‘ seq ’ is sent 808 . following the transmission of the appropriate new - data frame , the method of fig8 continues on to process the next frame 810 . fig9 is a flow chart of the steps used by a data receiver in an rlp link in sending status or ack control ( hereafter referred to as ack ) frames to the sender in accordance with an embodiment of the invention . the flow chart begins with the determination 902 that it is time for the data receiver to send a frame to the data sender . at step 904 , the data receiver determines whether there is a need to send an acknowledgment ( ack ) frame . since the radio link protocol ( rlp ) is generally a nak - based protocol , the sending of an ack frame over an rlp link is a departure from previous designs . in the embodiments of the present invention described below , the ack frame contains the data receiver &# 39 ; s current sequence number value of v ( r ) r . in addition , the ack frame optionally contains v ( n ) r to enable the data sender free up memory used by a send queue . also , the ack frame optionally contains v ( s ) r to enable the data sender to determine the need to send a nack to the data receiver for data flowing in the opposite direction . in exemplary embodiments , the decision 904 to send an ack frame is based on several possible criteria . in a first embodiment , the receipt by the data receiver of a new - data frame having a full sequence number triggers the data receiver to send one or more ack frames to update the data sender &# 39 ; s copy of v ( r ) r . in a second embodiment , the data receiver sends an ack frame whenever the sequence numbers in received new - data frames exceeds the last transmitted v ( r ) r value sent by a predetermined value . for example , if the v ( r ) r value sent in the last ack frame was x , a new ack frame is sent whenever the 8 - bit shortened sequence number of a new - data frame is received which exceeds x + 128 . in a third embodiment , ack frames are sent periodically , or every time a predetermined number of frame periods has lapsed . in a fourth embodiment , a combination of the first three methods is used to determine when to send the next ack frame . for example , the receipt of a new - data frame having a full sequence number triggers the data receiver to send an ack . in addition , the receipt of new - data frames having full sequence numbers is generally avoided by sending an ack whenever the received shortened sequence number crosses some threshold beyond the previously - sent v ( r ) r value . regardless of frames received , an ack is additionally sent if no ack has been sent for a predetermined number of previous consecutive frames ( for example 200 frames ). if the decision is made 904 not to send an ack frame , then a data or idle frame is sent from the data receiver to the data sender 912 . one familiar with the art will appreciate that an rlp implementation may send no frame at all at step 912 without departing from the present invention . if the decision is made 904 to send an ack frame , then the availability of new data to send is evaluated at step 906 . if there is new data to send , then a frame containing new data and the ack information is sent 908 . otherwise , a plain ack frame is sent 910 . after an appropriate frame is sent ( or not sent as discussed in conjunction with step 912 ), the method continues 914 , eventually returning to step 902 . in an exemplary embodiment of the invention , the set of sequence number bit sizes and the use of frame sequence numbers or byte sequence numbers is negotiated by the data sender and the data receiver when a data call is first established . the characteristics of rlp protocol used between the data sender and the data receiver are chosen from several possible configurations . this negotiation lends even greater flexibility to the rlp enhancements of the present invention . the embodiments of the present invention described form a family of complete solutions to efficiency problems posed by extending existing versions of rlp to high - data - rate and dynamic capacity channels . the embodiments described exhibit a variety of possible combinations resulting from analysis of the tradeoffs associated with each . the previous description of the preferred embodiments is provided to enable any person skilled in the art to make or use the present invention . the various modifications to these embodiments will be readily apparent to those skilled in the art , and the generic principles defined herein may be applied to other embodiments without the use of the inventive faculty . thus , the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein .