CN1703887A - A data partition method to maximize bluetooth baseband throughput - Google Patents

A data partition method to maximize bluetooth baseband throughput Download PDF

Info

Publication number
CN1703887A
CN1703887A CNA2003801012576A CN200380101257A CN1703887A CN 1703887 A CN1703887 A CN 1703887A CN A2003801012576 A CNA2003801012576 A CN A2003801012576A CN 200380101257 A CN200380101257 A CN 200380101257A CN 1703887 A CN1703887 A CN 1703887A
Authority
CN
China
Prior art keywords
packet type
elected
clock
xuanwei
shi
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2003801012576A
Other languages
Chinese (zh)
Other versions
CN100352238C (en
Inventor
T·B·马达普希
A·杉多纳利斯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Inc filed Critical Qualcomm Inc
Publication of CN1703887A publication Critical patent/CN1703887A/en
Application granted granted Critical
Publication of CN100352238C publication Critical patent/CN100352238C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

A method is provided for partitioning data into packets, where each packet has a type k selected from a set of packet types, and a length Lk, in bytes, of payload data. The method includes steps of: determining an expected successful transmit time Ek, for packets of type k, for each of the set of packet types; choosing an optimum packet type for which the value Ek/Lk is a minimum; and partitioning the payload data into packets of the optimum packet type. The method is enhanced by computing a bit error rate (BER) from the retransmission rate for single packet type and using the BER to compute retransmission rates for packets of the remaining types. The method is further enhanced by computing transition tables in advance and using the transition tables to select an optimum packet type.

Description

The data partition method of maximize bluetooth baseband throughput
Background of invention
The present invention relates generally to Wireless Telecom Equipment, relate in particular to and be used for the short range radio links of communicating by letter between portable electric appts being.
Bluetooth TMWireless technology is used to realize link between mobile computer, mobile phone, portable handheld device and to the wireless connections of the Internet.This standard is researched and developed, announces and promoted to TCA bluetooth special interest group (SIG) (bluetooth that is otherwise known as SIG Co., Ltd).For example from the website Www.bluetooth.orgCore is arranged, and Version 1.1, and " the Specification of the BluetoothSystem " in February 22 calendar year 2001 is available, and is incorporated herein by reference.Bluetooth TMWireless specification has defined the technology of the low expense of a low-power, and it (is that the emission maximum power output is limited in 100 milliwatts (mW)-be equivalent to, 20 decibels of each milliwatts (dBm)-as in bluetooth that this technology provides the short range criterion platform of radio link TMRegulation in the wireless specification), be used to remove the cable between mobile device and make things convenient for connection between product.The prediction bluetooth TMTechnology can be used for for example removing the wired connection needs between electronic product and annex; With bluetooth TMThe user organizes swap file, business card and schedule; File between transmission and synchronizer; Be connected to the localized content service of public domain; And as Long-distance Control, key, ticket and electronic cash leather wallet.
Bluetooth TMWireless specification comprises link layer and application layer definition.Meet bluetooth TMThe radio adaptation of wireless specification is in unlicensed 2.4GHz radio-frequency spectrum, to guarantee the communication compatibility in the whole world.As shown in Figure 1.Bluetooth TMWireless Telecom Equipment 100 can comprise radio unit 102, link controller 104 and link manager 106.Equipment 100 could interface to main frame 108, and this main frame may be the electronic equipment such as cell phone or luggable computer, expects that it can have the use bluetooth TMShort scope Radio Communications Link.Equipment 100 main frame 108 that is associated with it can also be called as bluetooth TM unit.Link controller 104 carries baseband protocol and other low layer routines, promptly as by bluetooth TMThe process or the algorithm of baseband specification regulation, and can also realize other algorithms of dividing such as data.Link manager 106 can be carried out link manager protocol (LMP), the logic link control that is called as L2CAP and adaptation layer protocol, and can comprise host controller interface (HCI), as bluetooth TMThe baseband specification regulation.
In point-to-point connects, promptly only relate to and support two bluetooths TMThe unit, bluetooth TMStandard also support point connects to multiple spot, allows to set up and keep the connection of seven whiles by single radio.For example, Fig. 2 a illustrates first bluetooth TMThe unit 202 and second bluetooth TMPoint-to-point between the unit 204 connects 201.Bluetooth TMUnit 202,204 can each comprise bluetooth TMWireless communication system-such as comprise one of each system be associated the system 100 of main frame 108, such as cell phone or personal computer.In putting multiple spot connection 203, as illustrating in Fig. 2 b, channel is in several bluetooths TMBe shared between the unit, described unit is such as the bluetooth in Fig. 2 b TMUnit 206,208,210 and 212.Unit formation-the piconet (kilomega network) of two or more shared same channels is as piconet1 and the piconet2 shown in Fig. 2 a and Fig. 2 b.In kilomega network (piconet), a bluetooth TMThe unit plays the main control unit effect of piconet, and another (a bit) plays from the unit effect.For example, bluetooth unit 202 is as the master of kilomega network 214, bluetooth TMThe unit as kilomega network 214 from (slave), bluetooth TMUnit 206 is as the master (m204aster) of kilomega network 216, bluetooth TMUnit 208,210 and 212 as kilomega network 216 from.Each kilomega network can only have single master.In kilomega network, can there be nearly seven from being movable.For from, channel inserts by master control, and from being synchronized to the master.Fig. 2 c explanation scatternet (scatternet) 218, wherein three kilomega networks interconnect.
Bluetooth TMCan be understood that on the communication concept between the unit on several different layers, to carry out with setting out.As illustrating in Fig. 3, may occur in first bluetooth TMThe unit 302 and second bluetooth TMThe communication 301 that the unit is 304.For example, first bluetooth TMThat unit 302 can be used as is main-such as the bluetooth in kilomega network TMUnit 202, and second bluetooth TMUnit 304 can be used as from-such as the bluetooth in the kilomega network 214 TMUnit 204.Communication 301 may occur in several different layers, for example high-rise 306, network layer 308, link layer 310 and the physical layer that is called as baseband layer 312.Information can be exchanged at interlayer, illustrates as arrow 314 and 316.LMP Link Manager Protocol-LMP318,320 and logic link control and adaptation layer protocol-L2CAP 322,324 can be included in the link layer 310.
In physical layer-baseband layer 312-bluetooth TMInterior radio communication is based on time division duplex (TDD) channel that divides time slot between the principal and subordinate, and described master is such as first bluetooth TMUnit 302, described from for example second bluetooth TMUnit 304.For example, can stipulate that the master sends in the even number time slot, and from the odd number time slot, sending.Bluetooth TMEach time slot nominal length of wireless system is 625 microseconds.
Therefore, the data that are sent out were divided into the base band grouping in the air before being sent out.Fig. 4 illustrates according to bluetooth TMThe standard packet form of the base band grouping 400 of baseband specification.Base band grouping 400 can be formatted into different piece, and its length and content may depend on the type of grouping and change.For example, base band grouping 400 can comprise the access code 402 that comprises 72 Bit datas, and this may be relevant with for example various LMP Link Manager Protocols.Base band grouping 400 may comprise the head 404 that comprises 54 Bit datas, and some of them are used to describe effective load data 406.Effective load data 406 can comprise the data from the grouping of high level data more.The length L of effective load data 406 kThe change scope may be from 0 to 2745 bit for example, or depend on grouping type can with or can encode without forward error correction (FEC).In bluetooth TMIn, six types grouping is arranged, be used in particular for transfer of data, this is general introduction briefly in following form 1.
??K Packet type ??L kLength (user octet) ??(TX) k(timeslot number)
??1 ??DM1 ??17 ??1
??2 ??DH1 ??27 ??1
??3 ??DM3 ??121 ??3
??4 ??DH3 ??183 ??3
??5 ??DH5 ??224 ??5
??6 ??DH5 ??339 ??5
Form 1
" DM " and " DH " is that the memory of corresponding expression " data-moderate rate " and " data-two-forty " is specified.Several k of from 1 to 6 make any specific cluster can be called as type k grouping as index.For example, the DM1 packet type can be called as the Class1 grouping.The load 406 of moderate rate packet type is to use (having " M " in the name) Hamming code of (10,15) to encode through FEC.The pay(useful) load 406 of high-rate packets type (having " H " in the name) is not encoded through FEC.The length that depends on grouping, the time (TX) that transmitted in packets needs kMay be 1,3 or 5 time slot, as illustrating in the form 1.Therefore, the grouping (1,3 and 5 slot length) of three kinds of different lengths is arranged, and every kind of length has and grouping un-encoded encoded.Though the grouping of un-encoded (" H ") more encoded than the equal length (" M ") grouping has higher data rate, their easier makeing mistakes (because un-encoded) and have higher retransmission rate, pay(useful) load 406 amount of user data that said speed sends with time per unit simply.Similarly, longer grouping has higher data rate, but has higher retransmission rate.In communication period, bluetooth TMUpper strata-give the base band 312 more high-rise packets that will send, i.e. load 406 data such as link layer 310-comprise L2CAP 322,324-generally.Generally, more high-rise data packet length has the order of magnitude that several base band are divided into groups.Baseband layer 312 is required the grouping of high level data more is divided into base band grouping 400 and sends base band grouping 400 through aerial.
Bluetooth TMBaseband layer 312 is realized automatic repeat request schemes, wherein each type k grouping that sends by transmitter unit-and such as first bluetooth TMUnit 302-must explicitly by receiving equipment confirm-such as second bluetooth TMUnit 304.Positive acknowledgement (ACK) reception that means success, and Negative Acknowledgement (NAK) means and receives the grouping failure.The equipment of transmission grouping-such as first bluetooth TMUnit 302-meeting retransmits it up to receiving ACK or overtime.Because the base band grouping of dissimilar and length is arranged, expect that every kind dissimilarly has different retransmission rates with the grouping of length.In addition, existence or the non-existent change channel condition such as radio interference also may influence each dissimilar and retransmission rate length.Be desirably in the packet partitioning algorithm of realizing in the baseband layer 312 and should be divided into the grouping that can obtain the high-throughput type, the high efficiency that the data volume that high-throughput promptly sends with time per unit is represented sending data.
This shows, need a kind of method: when providing mass data by the upper strata, mass data is divided into all kinds grouping, makes that the total time that successfully sends these data volume needs is minimum for the type that allows, thus the data throughout of maximization on radio channel.
The present invention's general introduction
In one aspect of the invention, provide a kind of data are divided into the method for grouping, data type k selects from packet type set.This method may further comprise the steps: be the type k grouping transmitting time E that determines to hope to succeed kSelect its E k/ L kBe the optimum packet type (L of minimum value kBe the byte length of type k grouping); Described effective load data is divided into described optimum packet type.
In another aspect of this invention, provide a kind of and be used for data are divided into that each grouping of selecting from multiple packet type has type k and data length is L kThe method of the grouping of byte said method comprising the steps of: the retransmission rate of determining single type packet; For described single type packet is calculated bit error rate (BER) (BER) from described retransmission rate; Using described BER is each grouping calculating retransmission rate R of a plurality of packet types kUse described retransmission rate R kFor each of a plurality of packet types is type k grouping calculation expectation success transmitting time E kSelect E k/ L kIt is the optimum packet type of minimum value; Described data are divided into described optimum packet type.
In another aspect of this invention, provide a kind of method that is used for data are divided into grouping in wireless communication system, each grouping of described grouping has type k, and described grouping is to select from allow the packet type set and data byte length is L kSaid method comprising the steps of: 1) calculate a plurality of transfer forms from a plurality of given expectation time of reception values, each of wherein said a plurality of transfer forms shifts the correspondence between form embodiment retransmission rate value and optimum packet type, and wherein said correspondence depends in the given expectation time of reception value; 2) determine actual expectation time of reception E[(RX)]; 3) select a selected form that shifts from described a plurality of transfer forms, described selected transfer form depends on the most approaching described actual expectation time of reception E[(RX)] and the described set of the corresponding packet type that allows of described a plurality of given expectation time of reception value; 4) determine the current group retransmission rate for the packet type that sends; 5) the described current retransmission rate of described transmission packet type is compared with the branch value in the described selected transfer form; 6) select optimum packet type according to described selected transfer form; And 7) described data are divided into the grouping of described optimum packet type.
In another aspect of this invention, provide a kind of method that is used for data are divided into grouping in wireless communication system, each grouping of described grouping has type k, and described grouping is to select from allow the packet type set and data byte length is L k, described packet type is selected any one of DM1, DM3, DM5, DH1, DH3 and six kinds of packet types of DH5.Said method comprising the steps of: 1) described type k transmission packets sum is counted; 2) the successful transmission counting number that described type k is divided into groups; 3) by described transmission is total divided by the described retransmission rate R that successfully transmits number compute type k grouping k4) determine expectation time of reception E[(RX with the average of time slot)]; 5) pass through T k=(TX) k+ E[(RX)] calculate and always expect to confirm transmitting time T k6) with T kMultiply by R kThe transmitting time E that always hopes to succeed of compute type k grouping k7) from the packet type set of described permission, select its E according to branching algorithm k/ L kIt is the optimum packet type of minimum value; And 8) described data are divided into described optimum packet type data.
By the detailed description with the accompanying drawing that proposes below, it is more obvious that feature of the present invention, character and advantage will become.
Brief description of the drawings
Fig. 1 is a prior art wireless communication system block diagram;
Fig. 2 a, 2b and 2c are the short scope radio circuit of prior art figure;
Fig. 3 is the protocol layer diagram of prior art wireless communication system;
Fig. 4 is the prior art bluetooth TMThe standard base band packet format figure of wireless communication system;
Fig. 5 is the sequential chart that grouping sent and received an example according to the embodiments of the invention base band;
Fig. 6 is a method example flow diagram of using the partitioning algorithm of wireless communication system according to one embodiment of the invention;
Fig. 7 is method one example flow diagram of using the partitioning algorithm of wireless communication system according to another embodiment of the present invention;
Fig. 8 is method one example flow diagram of using the partitioning algorithm of wireless communication system according to another embodiment of the present invention;
Fig. 9 A, 9B, 9C and 9D are the transfer form regulations of partitioning algorithm according to an embodiment of the invention; And
Figure 10 is the state transition diagram according to the first transfer form regulation that illustrates in the embodiment of the invention partitioning algorithm corresponding diagram 9A.
Detailed description of the present invention
Below describe in detail is the current optimal mode of carrying out the present invention's imagination.This description is not just for General Principle purpose of the present invention is described, because scope of the present invention is by the best definition of appending claims for restriction.
In a broad sense, embodiments of the invention provide the partitioning algorithm of data throughout on the maximization radio channel.Say that more specifically one embodiment of the invention provide the baseband layer process that is used for high level data more is divided into the base band grouping.This process has been considered current channel condition for the data throughout on the maximum channel.In other words, process response variable channel condition, described channel condition may for example influence the retransmission rate (being equivalent to packet error rate) of dissimilar base band groupings and receive block length.Compare with ignoring the prior art process that receives block length, it is error rate that one embodiment of the invention are measured retransmission rate that consider and more than, but also considers to receive when more high level data is divided into the base band grouping average length of grouping.Therefore, one embodiment of the invention also provide the partitioning algorithm that data is divided into grouping according to changing channel with the data throughout on the maximization radio channel.In another embodiment, the best packet type of every kind of possibility of calculated in advance retransmission rate scope is to strengthen the response to channel condition.Compared with prior art, leading calculating has also considered to receive the difference possibility length of grouping.One embodiment of the invention are for bluetooth TMWireless system is particularly useful, does not have the regulation that prestores to the base band data partitioning algorithm in this system.
With reference to figure 5, sequential chart 500 sends and receives example according to the base band grouping of one embodiment of the invention explanation individual unit.Transmission between the unit and receiving in the time slot to occur in such as time slot 502.Time slot 502 can also be numbered.For example, in Fig. 5, time slot 502 from 0 to 7 is numbered.As mentioned above, can start from the even number time slot such as the transmission of unit 202 or unit 204, and the reception of unit can start from the odd number time slot.Therefore, the example of Fig. 5 illustrates 1 slot transmission 504,506 and 508 that correspondingly starts from even number time slot 0,4,6.Therefore, be denoted as TX launch time 509, is time slots for transmission 504.If transmitting the grouping that sends in 504 is type k, then can be denoted as (TX) launch time 509 kTherefore, for the time slot grouping that sends such as transmission 504, packet type can be DM1 or DH1, and this is corresponding to the index k that has value 1 or 2.Therefore, suppose the grouping of DH1 type, be denoted as launch time 509 (TX) also of equal valuely DH1Or (TX) 2The example of Fig. 5 illustrates the corresponding reception 510,512 and 514 that starts from odd number time slot 1,5 and 7.Receiving 510 is that 3 time slots receive, so time of reception 516 also is marked as RX, also is 3 time slots.Depend on the packet type that receives, time of reception 516 can be 1,3 or 5 time slot.For example, time of reception 518 and time of reception 520 are each 1 time slots.Therefore, the expectation time of reception is E[(RX for the example shown that illustrates in Fig. 5)], this can determine by average or average of calculating time of reception 516,518 and 520, i.e. E[(RX)]=5/3 be 1.667 time slots.For example, can on average be used to measure E[(RX by value of following the tracks of communication period RX and the operation that keeps RX such as the processor of the unit of unit 202)], may know E[(RX in communication period)] value.
Confirm that such as the positive or negative of transmission 504,506 and 508 transmission (ACK/NAK) can be placed on the beginning of reception-such as receiving 510,512 and 514.The grouping of transmission types k and receive total scheduled time of returning ACK/NAK and be also referred to as total expectation and confirm transmitting time T k, this may depend on that the average received time promptly expects time of reception E[(RX)].T launch time is confirmed in total expectation kTherefore can be calculated as T k=(TX) k+ E[(RX)].For the example that illustrates in Fig. 5, wherein k=2 or of equal value ground k=DH1, (TX) kBe 1 time slot, and E[(RX)]=1.667 time slots, so T kBe 2.667 time slots.Can be used to calculate the T of communication period such as the Cell processor of unit 202 kValue, this can be by for example following the tracks of the transmitting time (TK) such as transmitting time 509 kAnd add the average E[(RX of operation)] realize, make T kValue can be known in communication period.
Still, can be used to the retransmission rate R of the grouping of each possible k value compute type k such as the Cell processor of unit 202 with reference to figure 5 k, this be by may k for each value to following two quantity counting separately: i.e. the successful transmission number of the grouping of the sum of the transmitted in packets of type k and type k, promptly receive ACK such as those transmission of transmitting 504.The retransmission rate R of the grouping of type k kThen can be for example by the grouping of type k always being transmitted number as calculated divided by the successful transmission number of the grouping of type k.In the example shown in Fig. 5, suppose the grouping (being k=2) of each transmission 504,506 and 508 transmission types DH1 and transmit 504 and 506 to get nowhere, but transmit 508 successes, promptly receive the ACK that returns, then the transmission packets of type 2 adds up to 3, and the grouping of type 2 successfully to transmit number be 1.Therefore, the retransmission rate of the grouping of type 2 is 3 divided by 1 in this example, i.e. retransmission rate R 2=3.May notice retransmission rate R on the mathematics kAlways more than or equal to 1.
Still get back to Fig. 5, can be used to the grouping calculation expectation success transmitting time E of each type k such as the Cell processor of unit 202 kThe transmitting time E that hopes to succeed of the grouping of type k kCan be calculated as the average or the average time of the type k grouping that successfully sends, so this type k packet retransmission rate that depends on the grouping of transmission types k and receive total expected time of the ACK that returns and require successfully to be sent grouping.Therefore, for each type k, the transmitting time E that hopes to succeed of the grouping of type k kCan use T kMultiply by R kAnd calculate.Continue the above-mentioned example that in Fig. 5, illustrates, wherein T 2=2.667 time slots and R 2=3, the transmitting time E that hopes to succeed of the grouping of type 2 then kBe that to multiply by 2 be E to 2.667 time slots 2=8 time slots.Similarly, along with the grouping of each type k is sent out, successful transmitting time E that can calculation expectation kDepend on that each packet type k can be calculated as E the average time of the payload bytes of each data k/ L k, L wherein kBe the interior data payload byte number of grouping of type k, for example illustrate in the secondary series of possibility as form 1.
Continue the above-mentioned example that in Fig. 5, illustrates, wherein for type 2 groupings, E k=8 time slots, and use is from the value L of form 1 2=27, the average time of each load byte, the grouping for type 2 can be calculated as E k/ L k=8/27 time slot.The promptly high capacity data throughout of the fastest transfer of data may be send that the payload bytes of each data needs average time minimum type k grouping.Therefore, may expect to minimize E in the type k by selecting effective load data is divided into and effective load data being sent k/ L k, its E of wherein said the type k k/ L kValue is minimum in the packet type of all transmissions.The mathematical principle of following example one this selection of explanation, described selection promptly refers to select effective load data is divided into its E k/ L kThe grouping of the type k that value is minimum.
With reference to figure 6, the example embodiment of flowchart text method 600, described method are used for data are divided into several dissimilar any groupings as mentioned above, and wherein each grouping can have type k and length L k, length depends on type k, as mentioned above.Method 600 can for example be written into Wireless Telecom Equipment (such as bluetooth TMWireless Telecom Equipment 100) software in the memory is realized.Method 600 can also be for example realizes in the hardware such as the DSP module that is included in link controller 104 for example or link manager 106.
Exemplary method 600 can comprise step 602,604,606,608 and 610, and the part of their conceptual description methods 600 with according to embodiment illustration method 600 easily, but is not for method for limiting 600.In other words, method 600 can realize with the different step of the different order that is different from Fig. 6, and still can for Wireless Telecom Equipment data be divided into dissimilar groupings according to the present invention.Exemplary method 600 is with reference to above-mentioned example description and by Fig. 5 explanation.
Method 600 starts from step 602, wherein can be by keeping two countings that separate to measure the retransmission rate R of the grouping of each type k for each k k, one of them counting that separates is the sum of the transmitted in packets of type k, another separately counting for each k is the type k successfully sum of transmission that divide into groups, and the sum that the sum of the transmitted in packets of type k is divided into groups successfully to transmit divided by type k is with calculating retransmission rate R k
Method 600 can continue in step 604, wherein expect time of reception E[(RX)] can be average and measured by for example in the microprocessor of time of reception RX (time of reception 516 that illustrates in such as Fig. 5), keep following the tracks of and calculate as mentioned above operation, Wireless Telecom Equipment is such as bluetooth simultaneously TMWireless Telecom Equipment 100 is being communicated by letter.
Method 600 can proceed to step 606, when wherein using Wireless Telecom Equipment such as equipment 100 to communicate, for each the type k that is being sent out grouping, can will always expect to confirm transmitting time T as mentioned above kBe calculated as T k=(TX) k+ E[(RX)].
Method 600 can proceed to step 608, when wherein using Wireless Telecom Equipment such as equipment 100 to communicate, and as mentioned above for each the type k that is being sent out grouping, can be with the transmitting time E that hopes to succeed kBe calculated as T kMultiply by R k
Method 600 can proceed to step 610, when wherein using Wireless Telecom Equipment such as equipment 100 to communicate, can select optimum packet type as mentioned above, and the type k is the value of making E in the packet type of all transmissions k/ L kMinimum type.Method 600 can also continue to be performed behind completing steps 610, makes that step 602,604,606,608 and 610 continues using Wireless Telecom Equipment 100 communication period to be implemented.Therefore, retransmission rate can be updated at step 602 place continuously; The expectation time of reception can be updated at step 604 place continuously; The calculating at step 606,608 and 610 places can be updated continuously; And can reselect optimum packet type along with the communication period condition changing that uses Wireless Telecom Equipment 100 in step 610.
With reference to figure 7, flowchart text is used for method 700 another example embodiment with the grouping of packet several different types, and as mentioned above, wherein each grouping has type k and the length L that depends on type k kAmong the embodiment that in Fig. 7, illustrates,, then can calculate the packet retransmission rate of other types, rather than directly determine retransmission rate, as what may realize by the embodiment that illustrates in Fig. 6 for other types in case be that the packet retransmission rate has been determined in the grouping of a type.In the example embodiment of method 700, for example can calculate bit error rate (BER) (BER), and can calculate other retransmission rate from BER from first retransmission rate.Method 700 can be for example such as bluetooth TMRealize in the software that is written in the memory in the Wireless Telecom Equipment of Wireless Telecom Equipment 100.Method 700 can also be for example realizes in the hardware of the DSP module that is included in link controller 104 for example or link manager 106.
Exemplary method 700 can comprise step 702,704,706,708,710,712 and 714, and the part of having described method 700 with easily according to another embodiment illustration method 700, but not necessarily for method for limiting 700.In other words, method 700 can realize with the different step that is different from the different order that illustrates in Fig. 7, and still can realize data are divided into dissimilar groupings for Wireless Telecom Equipment according to the present invention.Exemplary method 700 illustrates with reference to above-mentioned explanation and with the example of Fig. 5 explanation.
Method 700 starts from step 702, and wherein the grouping of a particular type k is the retransmission rate R of single type kCalculating be counting by keeping two to separate, one of them counting is the sum of the transmitted in packets of single type, another is the sum that single type packet is successfully transmitted, and the sum that the sum of the transmitted in packets of single type is successfully transmitted divided by single type packet is to calculate the retransmission rate R of single type packet kFor example, k may be selected in communication period and uses Wireless Telecom Equipment (such as bluetooth TMWireless Telecom Equipment 100) packet type that is sending.
Method 700 can proceed to step 704, can calculate BER for single type packet at this, and the retransmission rate of the type grouping is calculated in step 702.For example can be by setting P k=1-1/R kAt first from the retransmission rate R of single type packet kCalculate packet error rate P kAnd calculating BER.Then, for the grouping of un-encoded-can be by finding the solution following the acquisition such as the calculating of DH1, DH3 and DH5-BER:
P k＝1-(1-BER) 36(1+2BER) 18(1-BER) bk
Wherein bk is the load data bit number, comprises the load head, as known in the field.Then, for coding back packet type-can be by following finding the solution calculated such as DM1, DM3 and DM5-BER:
Wherein bk is the effective load data bit number, comprises pay(useful) load head and coded-bit-such as cyclic redundancy code (CRC) bit, as known in the field.Following example two explanations use above-mentioned two kinds of formula to calculate the mathematic(al) treatment of BER.
Method 700 can proceed to step 706, can be following calculates from BER at this and is different from the retransmission rate R of each type k that calculates the single type of its retransmission rate in step 702 kFor the packet type of un-encoded-such as DH1, DH3 and DH5-retransmission rate R kCan use following formula to be calculated:
R k＝(1-BER) -36(1+2BER) -18(1-BER) -bk
Wherein bk is the effective load data bit number, comprises the pay(useful) load head, as known in the field.For coding groups type-such as DM1, DM3 and DM5-retransmission rate R kCan use following formula to calculate:
Figure A20038010125700282
Wherein bk is the effective load data bit number, comprises pay(useful) load head and coded-bit-such as cyclic redundancy code (CRC) bit, as known in the field.Following example two explanations use above-mentioned two kinds of formula to calculate retransmission rate R kMathematic(al) treatment.
Method 700 can proceed to step 708, at this expectation time of reception E[(RX)] measurement be by the record in the microprocessor that remains on time of reception RX and calculate operation as mentioned above and on average obtain, the use Wireless Telecom Equipment takes place simultaneously (such as bluetooth TMThe communication of Wireless Telecom Equipment 100), described time of reception RX is such as the time of reception in Fig. 5 516.
Method 700 continues step 710, is using the total expectation affirmation transmitting time T that communicates the grouping of each the type k that is sent out simultaneously such as the Wireless Telecom Equipment of equipment 100 at this kCan be calculated as T as mentioned above k=(TX) k+ E[(RX)].
Method 700 can proceed to step 712, is using the transmitting time E that hopes to succeed that communicates the grouping of each the type k that is sent out simultaneously such as the Wireless Telecom Equipment of equipment 100 at this kCan be calculated as T as mentioned above kMultiply by R k
Method 700 can proceed to step 714, can select optimum packet type as mentioned above at this, its E of the type k k/ L kBe to use Wireless Telecom Equipment to communicate the type of all branch class mean minimums simultaneously such as equipment 100.Method 700 can for example continue to carry out after completing steps 714, to use Wireless Telecom Equipment 100 communication period to continue performing step 702,704,706,708,710,712 and 714.Therefore, the retransmission rate value can be continuously updated in step 702 to 706; The expectation time of reception can be updated in step 708 continuously; Step 710,712 and 714 calculating can be upgraded continuously; And can reselect optimum packet type along with the communication period condition changing that uses Wireless Telecom Equipment 100 in step 714.
With reference to figure 8, flowchart text is used for method 800 another example embodiment with the grouping of packet several different types, and as mentioned above, wherein each grouping has type k and the length L that depends on type k kAmong the embodiment that in Fig. 8, illustrates, given retransmission rate can shift to an earlier date with the optimum packet type of expecting time of reception to be calculated, make in case be that a type packet has been determined the packet retransmission rate, and determined the expectation time of reception, can be immediately by for example using the question blank of having stored previous result calculated to determine optimum packet type, rather than after having determined retransmission rate and expectation time of reception, calculate optimum packet type, in the cards as the embodiment that illustrates in Fig. 6 and Fig. 7.In the example embodiment of method 800, shift the form class and can be calculated and be stored in advance in the Wireless Telecom Equipment, serving as that transmission determines that optimum packet type is by the equipment reference in communication period.Method 800 can be for example such as bluetooth TMRealize in the software that is written in the memory in the Wireless Telecom Equipment of Wireless Telecom Equipment 100.Method 700 can also be for example realizes in the hardware of the DSP module that is included in link controller 104 for example or link manager 106.
Exemplary method 800 can comprise step 802,804,806,808,810 and 812, and this part of having described method 800 according to another embodiment illustration method 800, but is not for method for limiting 800 with easily.In other words, method 800 can realize with the different step that is different from the different order that illustrates in Fig. 8, and still can realize data are divided into dissimilar groupings for Wireless Telecom Equipment according to the present invention.Exemplary method 800 illustrates with reference to above-mentioned explanation and with the example of Fig. 5 explanation.
Method 800 starts from step 802, wherein can calculate a plurality of transfer forms-such as illustrate in the form 901,902,903 that illustrates in Fig. 9 A, Fig. 9 B 911,912,913 and 920 and Fig. 9 C in illustrate in the form 931,932,933 that illustrates and Fig. 9 D 941,942 and 943.Each form can be based on expectation time of reception E[(RX)] and the given expectation time of reception value hypothesis of the packet type set that allows.For example form 901 can be based on expectation time of reception E[(RX)]=5 time slots and being calculated, form 902 can be based on expectation time of reception E[(RX)]=hypothesis of 3 time slots and obtain calculating, and form 903 can be based on expectation time of reception E[(RX)]=hypothesis of 1 time slot and being calculated.Therefore, for example when using all six whens grouping, form 901,902 and 903 can be considered to form a class and be used for any desired time of reception E[(RX)] measured value.For example, in the time can using all six packet types, can allow the packet type set can be the set that comprises packet type DM1, DM3, DM5, DH1, DH3 and DH5.Can expect time of reception E[(RX according to the most approaching reality of which given expectation time of reception value)] and from one bunch, select certain table, wherein said actual expectation time of reception E[(RX)] be to use such as bluetooth TMMeasure in the grouping that the Wireless Telecom Equipment communication period of Wireless Telecom Equipment 100 sends.Therefore for example, if actual expectation time of reception E[(RX)]=1.9 time slots, can use form 903, and if actual expectation time of reception E[(RX)]=2.1 time slots, can use form 902.
Similarly, for example when allow using any length to be the packet type of three time slots, form 911,912 and 913 can be considered to be formed for any desired time of reception E[(RX)] measured value bunch.For example, when allowing to use three time slots or packet type still less (ground of equal value is less than 5 time slots), admissible packet type set can be the set that comprises packet type DM1, DM3, DH1 and DH3.Similarly, for example when using two kinds of packet type DM1 and DH1 any, form 920 can be considered to form one and be used for any desired time of reception E[(RX)] measured value bunch.And for example when allow using any DM packet type, form 931,932 and 933 is considered to form one and is used for any desired time of reception E[(RX)] measured value bunch.For example when allow using any DM packet type, the packet type set that is allowed to can be the set that comprises packet type DM1, DM3 and DM5.Similarly, for example when allow using any length to be less than or equal to the DM grouping of 3 time slots, form 941,942 and 943 can be considered to form one and be used for any desired time of reception E[(RX)] measured value bunch.For example, when allow using three time slots or still less during the DM packet type of length, the packet type set that is allowed to may be the packet type that comprises packet type DM1 and DM3.
With reference to figure 9A, 9B, 9C and 9D and the transfer form 901 of example especially as an illustration, for example using such as bluetooth TMWhen the Wireless Telecom Equipment of Wireless Telecom Equipment 100 is communicated by letter, shift the corresponding current packet type that is sent out of every row of form.Therefore, for example shift the corresponding packet type DH5 of the first row possibility of form 901, as what indicate at left line 904 marks that shift form 901.By contrast, the every row that shift form are corresponding should to be sent out the packet type that promptly shifts, to obtain higher data throughout, i.e. E among all packet type k that are sent out k/ L kMinimum value.Therefore, first row 905 that for example shift form 901 can corresponding packet type DH5, indicate as mark by the row 905 that shift form 901 tops, and shift the secondary series 906 of form 901 may corresponding packet type DM5, indicate as row 906 marks that shift form 901 tops.
The every lattice record that shifts form may stipulate to determine whether to carry out to packet type that should the lattice catalogue to the transfer of packet type that should lattice catalogue row to obtain the more condition of high data throughput.For example the lattice catalogue 907, " 1.000＜=R DH5＜=1.513 " regulation one condition;, then should carry out the transfer (row 905 of corresponding lattice catalogue 907) of grouping from type DH5 grouping (row 904 of corresponding lattice catalogue 907) to type DH5 if promptly send the current retransmission rate (branch value is otherwise known as) between 1.000 and 1.513 of packet type (being DH5 in this example).In other words, if in this case, satisfy this condition, the grouping that then is sent out is best type, should not carry out any packet type and change.
As second example, lattice catalogue 908, " 1.513＜R DH5" regulation one condition; if the current retransmission rate of the i.e. grouping of the packet type of Fa Songing (DH5 is greater than 1.513 in this case; branch value is otherwise known as) then should be carried out the transfer of the grouping (row 906 of corresponding lattice catalogue 908) from type DH5 grouping (row 904 of corresponding lattice catalogue 908) to type DM5.In other words, if satisfy this condition in this case, the grouping that then is sent out is not best type, and should carry out being grouped into from type DH5 the transfer of type DM5 grouping.
The step 802 of continuation method 800, and, for example use a plurality of test retransmission rate value R that allow packet type with the second operation instruction step of describing just now 802 k, by allowing packet type to calculate a plurality of test value E for all k/ L k, can determine branch value 1.513.It should be noted that E kCalculating may be similar to the above, depend on given expectation time of reception E[(RX)] value, this value is given expectation time of reception E[(RX for form 901 in this example)]=5 time slots.Therefore for example, can use 1.512,1.513 and 1.514 R DH5Carry out E DH5/ L DH5Calculating, can also use R kValue is carried out E for the k of other permissions k/ L kCalculating.Then, based on test value E DH5/ L DH5With test E k/ L kComparison, can select branch value.In this case, for E DM5/ L DM5＜E DH5/ L DH5, for example branch value may be selected the end point values of test retransmission rate scope.For example may be for value R DH5=1.514 and bigger value, E DM5/ L DM5＜E DH5/ L DH5, but be not that therefore 1.513 is E for value 1.512 and 1.513 DM5/ L DM5＜E DH5/ L DH5The termination value of scope, therefore and 1.513 be selected as branch value for the lattice catalogue 908 of form 901.Similarly, 1.513 be selected as branch value for the lattice catalogue 907 of form 901.Similarly, each branch value that each that illustrates in Fig. 9 A and the 9B shifts each lattice catalogue of form can be determined in a similar fashion.Therefore, each shifts form and has embodied correspondence between retransmission rate value and optimum packet type by shifting the branch value that comprises in the form.
Shift the branching algorithm of form regulation or can stipulate such as each that shifts form 901, such as the state transition diagram 1001 that illustrates in Figure 10 by state transition diagram.The state transition diagram 1001 that illustrates in Figure 10 provides another kind of regulation for the standard of the branching algorithm of form 901 regulations, as known in the field.Row 904 and row 905 that state 1004 can corresponding form 901 for example.State transitions 1007 can corresponding form 901 lattice catalogue 907.Therefore, the transfer of the lattice catalogue 907 between state transitions 1007 form DH5 and the DH5 is as the arrow of getting back to state 1004 from state 1004 and with the identical mark of dative catalogue 907.And for example, state 1004 can corresponding row 904, and the row 906 that state 1006 can corresponding form 901.State transitions 1008 can corresponding form 901 lattice catalogue 908.Therefore, the transfer of the lattice catalogue 908 between state transitions 1008 expression DH5 and the DM5, as 1006 arrow from state 1004 to state, and with the identical mark mark of dative catalogue 908.Therefore, each lattice catalogue of form 901 can be represented with the state transitions of state transition diagram 1001.Equally, each that illustrates in Fig. 9 A and the 9B shifts form and can be represented by the state diagram of the regulation branching algorithm identical with the transition diagram of representing.
Method 800 can proceed to step 804, time of reception E[(RX in this actual expectation)] can be average and measured by for example in the microprocessor of time of reception RX (time of reception 516 that illustrates in such as Fig. 5), keep following the tracks of and calculate as mentioned above operation, Wireless Telecom Equipment is such as bluetooth simultaneously TM Wireless Telecom Equipment 100 is being communicated by letter.
Method 800 can also proceed to step 806, wherein can select to shift form from shift form bunch.For example at Wireless Telecom Equipment such as bluetooth TMWhen Wireless Telecom Equipment 100 is being communicated by letter, be the most approachingly to receive the actual expectation time of reception E[(RX that grouping is determined from communication period according to which the given expectation time of reception value that is used for computation sheet)] and from bunch selecting certain table.Therefore, for example, if actual expectation time of reception E[(RX)]=4.1 time slots, can select form 901, actual else if expectation time of reception E[(RX)]=3.9 time slots, then can select form 902.Which grouping the transfer form of selecting bunch can send and determine by allowing.For example, if allow to send all packet types, then must from form 901,902 or 903, select.Yet, if only allow a grouping, its (TX) k＜=3 time slots and " DM " type packet just then select to comprise 941,942 and 943 form bunch.
Method 800 can proceed to step 808, and the grouping that wherein sends packet type is the current retransmission rate R of single grouping kCalculating be counting by keeping two to separate, one of them counting is the sum that sends the transmitted in packets of packet type, another is to send the packet type successfully sum of transmission that divide into groups, and the sum of transmitted in packets that will send packet type is divided by sending the packet type sum that successfully the transmits packet retransmission rate R with calculating transmission packet type that divides into groups kFor example, k may be selected in communication period and uses Wireless Telecom Equipment (such as bluetooth TMWireless Telecom Equipment 100) packet type that is sending.
Method 800 can proceed to step 810, wherein the current retransmission rate R of the packet type grouping of the transmission of determining in step 808 kCompare with the suitable branch value in the selected transfer table in the step 806.For example using Wireless Telecom Equipment (such as bluetooth TMWireless Telecom Equipment 100) when communication, suitable branch value is the row of transfer table of type k of the grouping of those corresponding current transmissions.Therefore for example, if the grouping of current transmission has type DH5, and selected transfer form is form 901, then current retransmission rate R k=R DH5Can compare with the branch value 1.513 of first row 904 of the type DH5 of corresponding form 901.
Continue identical example, if current retransmission rate R DH5Less than 1.513, then method 800 can continue by the known DH5 grouping that is divided in DH5 being chosen as optimum packet type and continuing effective load data such as field according to selected transfer form 901 in step 812.If current retransmission rate R DH5Greater than 1.513, then method 800 can proceed to step 812 with the DM5 grouping that is divided into known in effective load data such as the field by DM5 being chosen as optimum packet type and continuing according to selected transfer form 901.
Method 800 can for example continue to carry out after completing steps 812, to use Wireless Telecom Equipment 100 communication period to continue performing step 804,806,808,810 and 812.Therefore, the retransmission rate value can be continuously updated in step 808; The expectation time of reception can be updated in step 804 continuously; The selection at step 806 and 810 places and comparison can be upgraded continuously; And can reselect optimum packet type along with the communication period condition changing that uses Wireless Telecom Equipment 100 in step 812.
Example one
Making more, high layer packets length is the L byte.Make L kIt is the base band block length (unit is a byte) of type k; Wherein k ∈ 1 ..., 6}.Make N kExpression is used to send the type k packet count of upper-layer packet.All combinations that send the more base band grouping of high layer packets fully should be satisfied:
∑ kN kL k＞＝L?????????????????????????????(1)
Wherein in the following formula more than or equal to number representing that nearest boundaries of packets is more than or equal to L.Make allocation vector D={N 1, N 2..., N 6Expression sends the more combination of high layer packets fully.
Make T kThe grouping of expression transmission types k also receives the time that ACK/NAK responds.Transmitting time (TX) depends on that packet type is 1,3 or 5 time slot.ACK/NAK may be attached in the reception grouping of (RX)=1,3 or 5 time slot.Therefore, T kFor:
T k＝(TX) k+E[(RX)]????????????????????????(2)
E[wherein] the expression desired operation.T kTherefore it is the total expected time that sends once and receive ACK/NAK.Make R kFor making it, the grouping that needs transmission types k passes through desired number of times.
R k=(transmission number/successfully transmit number) k(3)
T then kR kIt is the expected time of the grouping of transmission types k.We use E kExpression.The total time of the combination needs that transmission D represents is:
∑ kN kE k??????????????????????????????????(4)
That D that calculates minimum value for equation (4) will obtain maximum throughput.Therefore need find this D, promptly
min D∑ kN kE k??????????????????????????????(5)
We then find the solution equation (5) under the restriction that equation (1) illustrates.
Separate
Make N k=X k 2To guarantee N k＞0.Also temporarily suppose N kIt or not integer.Use X k 2Substitution N k, obtain:
min∑ kX k 2E k??????????????????????????????(6)
Make
∑ kX k 2L k＝L??????????????????????????????(7)
Because X k 2No longer be integer, so the equal sign of equation (7) is set up.Make index m make:
E m / L m < = E k / L k &ForAll; k - - - ( 8 )
Rewrite equation (7)
X m 2L m＝L-∑ k≠mX k 2L k
X m 2＝L/L m-∑ k≠mX k 2L k/L m
Consider equation (6)
∑ kX k 2E k＝X m 2E m+∑ k≠mX k 2E k
＝[L/L m-∑ k≠mX k 2L k/L m]E m+∑ k≠mX k 2E k
＝E m[L/L m-∑ k≠mX k 2[E k/E m-L k/L m]]
We need select X k, k ≠ m is with the left side of minimum equation (9).Watch the X on the right k 2Coefficient, we obtain since the reason of equation (8) they always for more than or equal to 0.Therefore has only the X of working as kDuring=0 k ≠ m, the left side is minimized.This means:
N k＝0k≠m
N m＝L/L m?????????????????????????????????????(10)
In above equation, N mIt no longer is integer.But in fact, we to need it be integer.
L is illustrated in data and is sent to the buffer sizes that base band is stored data before being used to send.Therefore at the peak rate place, even when base band empties it, buffer can be filled up continuously.Therefore, N mFractional part inessential to us.We always have sufficient data to fill up the whole group of type m.In equation (10), we consider that L is L mMultiple.
Therefore in practice, we only select to make E k/ L kThe packet type k that value is minimum.
Example two
When providing the vectorial R of repeating transmission, algorithm is selected the best packet type.Therefore, we only send this packet type and refresh again up to next time and retransmit vector.This means that we do not have the retransmission rate information of other any packet types except the retransmission rate information of the packet type of previous selection.This part illustrates a method under a given retransmission rate situation, calculates the retransmission rate of other packet types.
Method is as follows: from (R k) calculating packet error rate (P k), from P kCalculate bit error rate (BER) (BER).Calculate R from BER i i ≠ k.
DSP gives two numerals of preprocessor, and one is the number of times (t that it sends to a given packet type k), another is the number of times (r that it must retransmit this packet type k).Therefore we can calculate:
R k＝t k/(t k-r k)
P k＝r k/t k
Therefore, R k=(1-P k) -1(11)
The bluetooth baseband grouping has two parts, head and pay(useful) load.Head is all used 1/3 duplication code coding in all groupings.Pay(useful) load is encoded with 2/3 Hamming code in the DM grouping, and not encoded in the DH grouping.We list P kWith head probability of failure P HdrAnd pay(useful) load probability of failure p k PyldRelation is as follows:
P k＝1-(1-p hdr)(1-p kp yld)?????????????????????????????????(12)
Head is 18 bit long, and with 1/3 duplication code coding, makes to add up to 54 bits.Because duplication code can be corrected all individual bit mistakes, the probability that 3 bits of encoded pieces are correctly decoded is (1-BER) 3+ 3BER (1-BER) 2Therefore,
p hdr＝1-[(1-BER) 3+3BER(1-BER) 2] 18
＝1-(1-BER) 36(1+2BER) 18?????????????????????????????(13)
P is calculated in grouping for un-encoded k PyldFor,
p kpyld＝1-(1-BER) bk?????????????????????????????????????(14)
Wherein bk is the bit number in the pay(useful) load, comprises pay(useful) load head and CRC bit.
In the grouping behind coding, coding replaces 10 Bit data sequences with 15 bits of encoded words.This yard corrected all the individual bit mistakes in 15 bit sequences.Therefore the p of grouping after encoding k PxldFor:
Figure A20038010125700351
Therefore, from equation (12), (13), (14), the packet error rate of the grouping of un-encoded becomes:
P k uncodet＝1-(1-BER) 36(1+2BER) 18(1-BER) bk??????????????(16)
From equation (12), (13), (15), the packet error rate of coding groups becomes:
Figure A20038010125700352
Represent retransmission rate (equation (11)) with packet error rate, and use equation (16), divide into groups for un-encoded that our obtain,
R k＝(1-BER) -36(1+2BER) -18(1-BER) -bk????????????????????????(18)
Equation (11) and equation (17) are used in encoded grouping,
Therefore, the R of a given grouping k, can calculate BER and calculate R from it by BER i i ≠ k.
Certainly, be appreciated that the above optimum embodiment of the present invention that relates to, under the principle of the invention that can in not departing from following claims, propose and the situation of scope it made amendment.

Claims (74)

1. one kind is used for data are divided into type k and the length L of selecting from multiple packet type kThe method of grouping, it is characterized in that comprising:
Be the type k grouping transmitting time E that determines to hope to succeed k
Select its E k/ L kIt is the optimum packet type of minimum value;
Described data are divided into grouping with described optimum packet type.
2. the method for claim 1 is characterized in that also comprising:
Type k transmission packets sum is counted;
Successful transmission counting number to the grouping of type k;
By described transmission is total divided by the described retransmission rate R that successfully transmits number compute type k grouping kAnd at described definite described transmitting time E that hopes to succeed kStep in use described retransmission rate R k
3. the method for claim 1 is characterized in that each packet delivery time of type k is (TX) k, and further comprising the steps of:
Determine expectation time of reception E[(RX)];
Press T k=(TX) k+ E[(RX)] calculate and always expect to confirm transmitting time T kAnd
At described definite described transmitting time E that hopes to succeed kStep in use described total expectation to confirm transmitting time T k
4. the method for claim 1 it is characterized in that k selects from comprise 1,2,3,4,5,6 set, and a plurality of packet type comprises packet type DM1, DH1, DM3, DH3, DM5, DH5.
5. one kind is used for data are divided into type k and the length L of selecting from multiple packet type kThe method of grouping, it is characterized in that comprising:
Determine the retransmission rate of single type packet;
For described single type packet is calculated bit error rate (BER) (BER) from described retransmission rate;
Using described BER is that retransmission rate R is calculated in the grouping with type k k
Use described retransmission rate R kFor having the grouping calculation expectation success transmitting time E of type k k
Select E k/ L kIt is the optimum packet type of minimum value;
Described data are divided into grouping with described optimum packet type.
6. method as claimed in claim 5 is characterized in that further comprising the steps of:
Transmitted in packets sum to described single type is counted;
Successful transmission counting number to the grouping of described single type type;
By described transmission sum is successfully transmitted the retransmission rate that number calculates described single type packet divided by described.
7. method as claimed in claim 5 is characterized in that each type k grouping has transmitting time (TX) k, and further comprising the steps of:
Determine expectation time of reception E[(RX)];
Press T k=(TX) k+ E[(RX)] calculate and always expect to confirm transmitting time T kAnd
With T kMultiply by R kCalculate the described transmitting time E that hopes to succeed k
8. method as claimed in claim 5 is characterized in that what described k selected from the packet type set that comprises packet type DM1, DH1, DM3, DH3, DM5, DH5.
9. method as claimed in claim 5 is characterized in that described k selects from the packet type set that comprises packet type DM1, DM3 and DM5.
10. method as claimed in claim 5 is characterized in that k selects from the packet type set that comprises packet type DM1, DM3, DH1 and DH3.
11. method as claimed in claim 5 is characterized in that k selects from the packet type set that comprises packet type DM1 and DM3.
12. method as claimed in claim 5 is characterized in that k selects from the packet type set that comprises packet type DM1 and DH1.
13. one kind is used for data are divided into the grouping method that is used to transmit in wireless communication system, each grouping of described grouping has type k, and described grouping is to select from allow the packet type set and length is L k, it is characterized in that may further comprise the steps:
Calculate a plurality of transfer forms from a plurality of given expectation time of reception values, each of wherein said a plurality of transfer forms shifts the correspondence between form embodiment retransmission rate value and optimum packet type, and wherein said correspondence depends in the given expectation time of reception value;
Determine actual expectation time of reception E[(RX)];
Select a selected form that shifts from described a plurality of transfer forms, described selected transfer form depends on the most approaching described actual expectation time of reception E[(RX)] and the described set of the corresponding packet type that allows of described a plurality of given expectation time of reception value;
For the packet type that sends is determined the current group retransmission rate;
The described current retransmission rate of the packet type of described transmission is compared with the branch value in the described selected transfer form;
Select optimum packet type according to described selected transfer form; And
Described data are divided into the grouping of described optimum packet type.
14. method as claimed in claim 13 is characterized in that described grouping for the packet type that sends determines the step of current retransmission rate, also further may further comprise the steps:
Transmitted in packets sum to packet type with described transmission is counted;
Successful transmission counting number to the grouping of packet type with described transmission;
By described transmission sum is successfully transmitted the described current retransmission rate of grouping that number calculates described transmission packet type divided by described.
15. method as claimed in claim 13 is characterized in that the step of a plurality of transfer forms of described calculating is further comprising the steps of:
Calculate a plurality of test value E based on a plurality of test retransmission rate values k/ L kAnd
The selection first kind is grouped into the branch value of second type packet,
Described branch value is selected from described a plurality of test retransmission rate value;
Described branch value is chosen as the end point values of described a plurality of test retransmission rate value scopes, to the test value E of the described grouping of the described first kind of described scope k/ L kA plurality of test value E less than type k grouping k/ L k
16. method as claimed in claim 13 is characterized in that described a plurality of given expectation time of reception value comprises 1 time slot, 3 time slots and 5 time slots.
17. method as claimed in claim 13, it is characterized in that, in the time of in any one of packet type DM1, DM3, DM5, DH1, DH3 and DH5 is included in described permission packet type set, described a plurality of transfer forms comprise can be used for any desired time of reception E[(RX)] measured value bunch.
18. method as claimed in claim 13, it is characterized in that, in the time of in any one of packet type DM1, DM3, DH1, DH3 is included in described permission packet type set, described a plurality of transfer forms comprise can be used for any desired time of reception E[(RX)] measured value bunch.
19. method as claimed in claim 13, it is characterized in that, in the time of in any one of packet type DM1, DH1 is included in described permission packet type set, described a plurality of transfer forms comprise can be used for any desired time of reception E[(RX)] measured value bunch.
20. method as claimed in claim 13, it is characterized in that, in the time of in any one of packet type DM1, DM3, DM5 is included in described permission packet type set, described a plurality of transfer forms comprise can be used for any desired time of reception E[(RX)] measured value bunch.
21. method as claimed in claim 13, it is characterized in that, in the time of in any one of packet type DM1, DM3 is included in described permission packet type set, described a plurality of transfer forms comprise can be used for any desired time of reception E[(RX)] measured value bunch.
22. a method that is used for data are divided into grouping in wireless communication system, each grouping of described grouping has type k, and described grouping is to select from allow the packet type set and length is L k, it is characterized in that may further comprise the steps:
Transmission packets sum with described type k is counted;
Successful transmission counting number to grouping with described type k;
By described transmission is total divided by the described retransmission rate R that successfully transmits number compute type k grouping k
Expectation time of reception E[(RX)] be defined as the average of time slot;
Press T k=(TX) k+ E[(RX)] calculate and always expect to confirm transmitting time T kAnd
With T kMultiply by R kThe transmitting time E that always hopes to succeed of the grouping of compute type k k
From the packet type set of described permission, select its E according to branching algorithm k/ L kIt is the optimum packet type of minimum value; And
Described data are divided into described optimum packet type data.
23. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When only allowing a time slot packet type:
When k=DH1, work as R DH1Elected described optimum packet type DH1 at＜=1.598 o'clock as, as 1.598＜R DH1Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DH1 at＜=1.005 o'clock as, as 1.005＜R DM1Shi Xuanwei DM1.
24. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
As E[(RX)]＜2.0 and when only allowing length less than all packet types of 5 time slots:
When k=DH3, work as R DH3Elected described optimum packet type DH3 at＜=1.513 o'clock as, as 1.513＜R DH3Shi Xuanwei DM3;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM3Elected DM3 as at＜=4.556 o'clock, as 4.556＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM1Elected DM3 as at＜=1.284 o'clock, as 1.284＜R DM3Shi Xuanwei DM1.
25. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 2.0＜E[(RX)]＜4.0 and when only allowing length less than all packet types of 5 time slots:
When k=DH3, work as R DH3Elected described optimum packet type DH3 at＜=1.513 o'clock as, as 1.513＜R DH3Shi Xuanwei DM3;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM3Elected DM3 as at＜=6.442 o'clock, as 6.442＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM1Elected DM3 as at＜=1.375 o'clock, as 1.375＜R DM1Shi Xuanwei DM1.
26. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 4.0＜E[(RX)] and when only allowing length less than all packet types of 5 time slots:
When k=DH3, work as R DH3Elected described optimum packet type DH3 at＜=1.496 o'clock as, as 1.496＜R DH3Shi Xuanwei DM3;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM3Elected DM3 as at＜=7.407 o'clock, as 7.407＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM1Elected DM3 as at＜=1.389 o'clock, as 1.389＜R DM1Shi Xuanwei DM1.
27. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
As E[(RX)]＜2.0 and when allowing all packet types:
When k=DH5, as 1.000＜R DH5Elected described optimum packet type DH5 at＜=1.513 o'clock as, as 1. 513＜R DH5Shi Xuanwei DM5;
When k=DM5, work as 1.000=R DM5The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM5Elected DM5 as at＜=1.588 o'clock, as 1.588＜R DM5Elected DM3 as at＜=15.990 o'clock, as 15.990＜R DM5Shi Xuanwei DM1; And
When k=DM3, work as 1.000=R DM3The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM3Elected DM5 as at＜=1.286 o'clock, as 1.286＜R DM3Elected DM3 as at＜=4.565 o'clock, as 4.565＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM1Elected DM5 as at＜=1.043 o'clock, as 1.043＜R DM1Elected DM3 as at＜=1.284 o'clock, as 1.284＜R DM1Shi Xuanwei DM1.
28. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 2.0＜E[(RX)]＜4.0 and when allowing all packet types:
When k=DH5, as 1.000＜R DH5Elected described optimum packet type DH5 at＜=1.513 o'clock as, as 1.513＜=R DH5Shi Xuanwei DM5;
When k=DM5, work as 1.000=R DM5The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM5Elected DM5 as at＜=2.061 o'clock, as 2.061＜R DM5Elected DM3 as at＜=29.849 o'clock, as 29.849＜R DM5Shi Xuanwei DM1;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM3Elected DM5 as at＜=1.482 o'clock, as 1.482＜R DM3Elected DM3 as at＜=6.447 o'clock, as 6.447＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM1Elected DM5 as at＜=1.066 o'clock, as 1.066＜R DM1Elected DM3 as at＜=1.359 o'clock, as 1.359＜R DM1Shi Xuanwei DM1.
29. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 4.0＜E[(RX)] and when allowing all packet types:
When k=DH5, as 1.000＜R DH5Elected described optimum packet type DH5 at＜=1.513 o'clock as, as 1.513＜R DH5Shi Xuanwei DM5;
When k=DM5, work as 1.000=R DM5The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM5Elected DM5 as at＜=2.377 o'clock, as 2.377＜R DM5Elected DM3 as at＜=38.889 o'clock, as 38.889＜R DM5Shi Xuanwei DM1;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM3Elected DM5 as at＜=1.607 o'clock, as 1.607＜R DM3Elected DM3 as at＜=7.414 o'clock, as 7.414＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM1Elected DM5 as at＜=1.081 o'clock, as 1.081＜R DM1Elected DM3 as at＜=1.390 o'clock, as 1.390＜R DM1Shi Xuanwei DM1.
30. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
As E[(RX)]＜2.0 and when only allowing length less than the DM packet type of 5 time slots:
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM3 at＜=4.556 o'clock as, as 4.556＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM3 at＜=1.284 o'clock as, as 1.284＜R DM1Shi Xuanwei DM1.
31. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 2.0＜E[(RX)]＜4.0 and when only allowing length less than the DM packet type of 5 time slots:
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM3 at＜=6.442 o'clock as, as 6.442＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM3 at＜=1.359 o'clock as, as 1.359＜R DM1Shi Xuanwei DM1.
32. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 4.0＜E[(RX)] and when only allowing length less than the DM packet type of 5 time slots:
When k=DM3, as 1.000＜=R DM3Elected optimum packet type DM3 at＜=7.407 o'clock as, as 7.407＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM3 at＜=1.389 o'clock as, as 1.389＜R DM1Shi Xuanwei DM1.
33. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
As E[(RX)]＜2.0 and when only allowing the DM packet type of any length:
When k=DM5, as 1.000＜=R DM5Elected described optimum packet type DM5 at＜=1.588 o'clock as, as 1.588＜R DM5Elected DM3 as at＜=15.990 o'clock, as 15.990＜R DM5Shi Xuanwei DM1;
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM5 at＜=1.286 o'clock as, as 1.286＜R DM3Elected DM3 as at＜=4.566 o'clock, as 4.566＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM5 at＜=1.043 o'clock as, as 1.043＜R DM1Elected DM3 as at＜=1.284 o'clock, as 1.284＜R DM1Shi Xuanwei DM1.
34. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 2.0＜E[(RX)]＜4.0 and when only allowing the DM packet type of any length:
When k=DM5, as 1.000＜=R DM5Elected described optimum packet type DM5 at＜=2.061 o'clock as, as 2.061＜R DM5Elected DM3 as at＜=29.849 o'clock, as 29.849＜R DM5Shi Xuanwei DM1;
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM5 at＜=1.482 o'clock as, as 1.482＜R DM3Elected DM3 as at＜=6.447 o'clock, as 6.447＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM5 at＜=1.066 o'clock as, as 1.066＜R DM1Elected DM3 as at＜=1.359 o'clock, as 1.359＜R DM1Shi Xuanwei DM1.
35. method as claimed in claim 22 is characterized in that described branching algorithm comprises:
When 4.0＜E[(RX)] and when only allowing the DM packet type of any length:
When k=DM5, as 1.000＜=R DM5Elected described optimum packet type DM5 at＜=2.377 o'clock as, as 2.377＜R DM5Elected DM3 as at＜=38.889 o'clock, as 38.889＜R DM5Shi Xuanwei DM1;
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM5 at＜=1.607 o'clock as, as 1.607＜R DM3Elected DM3 as at＜=7.414 o'clock, as 7.414＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM5 at＜=1.081 o'clock as, as 1.081＜R DM1Elected DM3 as at＜=1.391 o'clock, as 1.391＜R DM1Shi Xuanwei DM1.
36. a Wireless Telecom Equipment is characterized in that comprising:
One processor is used for data are divided into type k and the length L of selecting from multiple packet type kGrouping;
Wherein said processor is grouping with the type k transmitting time E that determines to hope to succeed k
Its E of described processor selection k/ L kIt is the optimum packet type of minimum value;
Described processor is divided into described optimum packet type with described data.
37. Wireless Telecom Equipment as claimed in claim 36 is characterized in that also comprising:
Described processor is counted the transmitted in packets sum of type k;
Described processor is to the successful transmission counting number of the grouping of type k;
Described processor is by total divided by the described retransmission rate R that successfully transmits number compute type k grouping with described transmission kAnd
Described processor is at described definite described transmitting time E that hopes to succeed kStep in use described retransmission rate R k
38. Wireless Telecom Equipment as claimed in claim 36 is characterized in that
The packet delivery time of each type k is (TX) k
Described processor is determined expectation time of reception E[(RX)];
Described processor is pressed T k=(TX) k+ E[(RX)] calculate and always expect to confirm transmitting time T kAnd
Described processor uses described total expectation to confirm transmitting time T kWith described definite described transmitting time E that hopes to succeed k
39. Wireless Telecom Equipment as claimed in claim 36 it is characterized in that k selects from comprise 1,2,3,4,5,6 set, and a plurality of packet type comprises packet type DM1, DH1, DM3, DH3, DM5, DH5.
40. a wireless communication system is characterized in that comprising:
At least one has the Wireless Telecom Equipment of processor, and described processor is divided into data type k and the length L of selecting from multiple packet type kGrouping;
Described processor is the type k grouping transmitting time E that determines to hope to succeed k
Its E of described processor selection k/ L kIt is the optimum packet type of minimum value;
Described processor is divided into described optimum packet type with described data.
41. wireless communication system as claimed in claim 40 is characterized in that:
Described processor is counted the transmitted in packets sum of described single type;
Described processor is to the successful transmission counting number of the grouping of described single type;
Described processor is by successfully transmitting the retransmission rate that number calculates described single type packet with described transmission sum divided by described;
Described processor is that described single type packet is calculated bit error rate (BER) (BER) from described retransmission rate;
Described processor uses described BER to calculate retransmission rate R as type k grouping k
Described processor uses described retransmission rate R kTransmitting time E determines to hope to succeed k
42. wireless communication system as claimed in claim 41 is characterized in that:
Each type k grouping has transmitting time (TX) k
Described processor is determined expectation time of reception E[(RX)];
Described processor is pressed T k=(TX) k+ E[(RX)] calculate and always expect to confirm transmitting time T kAnd
Described processor is with T kMultiply by R kCalculate the described transmitting time E that always hopes to succeed k
43. wireless communication system as claimed in claim 40 is characterized in that what described k selected from the packet type set that comprises packet type DM1, DH1, DM3, DH3, DM5, DH5.
44. wireless communication system as claimed in claim 40 is characterized in that k selects from the packet type set that comprises packet type DM1, DM3, DH1 and DH3.
45. wireless communication system as claimed in claim 40 is characterized in that k selects from the packet type set that comprises packet type DM1 and DH1.
46. wireless communication system as claimed in claim 40 is characterized in that described k selects from the packet type set that comprises packet type DM1, DM3 and DM5.
47. wireless communication system as claimed in claim 40 is characterized in that k selects from the packet type set that comprises packet type DM1 and DM3.
48. a short scope radio link of communication equipment is characterized in that comprising:
First Wireless Telecom Equipment;
Second Wireless Telecom Equipment with described first communication apparatus communication;
In wherein said first Wireless Telecom Equipment and described second Wireless Telecom Equipment at least one comprises a processor, described processor is divided into grouping with data, each grouping of described grouping has type k, and described grouping is to select from allow the packet type set and length is L kAnd the transmitting time E that hopes to succeed kAnd
Its E of described processor selection k/ L kIt is the optimum packet type of minimum value;
Described processor is divided into described optimum packet type with described data.
49. the short scope radio link of communication equipment as claimed in claim 48 is characterized in that:
Described processor is counted the transmission sum of described transmission packet type;
Described processor is to the successful transmission counting number of described transmission packet type;
Described processor is by successfully transmitting the described current retransmission rate R of grouping that number calculates described transmission packet type with described transmission sum divided by described k
Described processor is with the described current retransmission rate R of the grouping of described transmission packet type kCompare with the selected branch value that shifts in the form; And
Described processor is selected its E according to described selected transfer form k/ L kIt is the optimum packet type of minimum value.
50. the short scope radio link of communication equipment as claimed in claim 49 is characterized in that:
Described processor is determined actual expectation time of reception E[(RX)];
Described processor is selected a selected form that shifts from described a plurality of transfer forms, wherein:
Each of described a plurality of transfer forms shifts form and embodies corresponding between retransmission rate value and optimum packet type,
Described correspondence depends on of a plurality of given expectation time of reception values, and
Described selected transfer form depends on the most approaching described actual expectation time of reception E[(RX)] of described a plurality of given expectation time of reception value.
51. the short scope radio link of communication equipment as claimed in claim 50 is characterized in that described a plurality of given expectation time of reception value comprises 1 time slot, 3 time slots and 5 time slots.
52. the short scope radio link of communication equipment as claimed in claim 51 is characterized in that k selects from the packet type set that allows.
53. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that described permission packet type set is all packet type set.
54. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that described permission packet type set is length all packet type set less than 5 time slots.
55. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that described permission packet type set is all packet type set that length equals 1 time slot.
56. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that described permission packet type set is the set of all DM packet types.
57. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that described permission packet type set is the set of all length less than the DM packet type of 4 time slots.
58. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When described permission packet type set equals all packet type set of a time slot for only allowing length:
When k=DH1, work as R DH1Elected described optimum packet type DH1 at＜=1.598 o'clock as, as 1.598＜R DH1Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DH1 at＜=1.005 o'clock as, as 1.005＜R DM1Shi Xuanwei DM1.
59. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
As E[(RX)]＜2.0 and described when to allow packet type set be all length less than the set of all packet types of 4 time slots:
When k=DH3, work as R DH3Elected described optimum packet type DH3 at＜=1.513 o'clock as, as 1.513＜=R DH3Shi Xuanwei DM3;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM3Elected DM3 as at＜=4.556 o'clock, as 4.556＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM1Elected DM3 as at＜=1.284 o'clock, as 1.284＜R DM3Shi Xuanwei DM1.
60. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 2.0＜E[(RX)]＜4.0 and described when to allow packet type set be all length less than the set of all packet types of 5 time slots:
When k=DH3, work as R DH3Elected described optimum packet type DH3 at＜=1.513 o'clock as, as 1.513＜R DH3Shi Xuanwei DM3;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM3Elected DM3 as at＜=6.442 o'clock, as 6.442＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R OM1Elected DM3 as at＜=1.375 o'clock, as 1.375＜R DM1Shi Xuanwei DM1.
61. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 4.0＜E[(RX)] and described when to allow packet type set be all length less than the set of all packet types of 5 time slots:
When k=DH3, work as R DH3Elected described optimum packet type DH3 at＜=1.496 o'clock as, as 1.496＜R DH3Shi Xuanwei DM3;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM3Elected DM3 as at＜=7.407 o'clock, as 7.407＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH3 of Shi Xuanwei is as 1.000＜R DM1Elected DM3 as at＜=1.389 o'clock, as 1.389＜R DM1Shi Xuanwei DM1.
62. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
As E[(RX)]＜2.0 and described when allowing packet type set to be the set of all packet types:
When k=DH5, as 1.000＜R DH5Elected described optimum packet type DH5 at＜=1.513 o'clock as, as 1.513＜R DH5Shi Xuanwei DM5;
When k=DM5, work as 1.000=R DM5The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM5Elected DM5 as at＜=1.588 o'clock, as 1.588＜R DM5Elected DM3 as at＜=15.990 o'clock, as 15.990＜R DM5Shi Xuanwei DM1; And
When k=DM3, work as 1.000=R DM3The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM3Elected DM5 as at＜=1.286 o'clock, as 1.286＜R DM3Elected DM3 as at＜=4.565 o'clock, as 4.565＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM1Elected DM5 as at＜=1.043 o'clock, as 1.043＜R DM1Elected DM3 as at＜=1.284 o'clock, as 1.284＜R DM1Shi Xuanwei DM1.
63. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 2.0＜E[(RX)]＜4.0 and described when allowing packet type set to be the set of all packet types:
When k=DH5, as 1.000＜R DH5Elected described optimum packet type DH5 at＜=1.513 o'clock as, as 1.513＜R DH5Shi Xuanwei DM5;
When k=DM5, work as 1.000=R DM5The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM5Elected DM5 as at＜=2.061 o'clock, as 2.061＜R DM5Elected DM3 as at＜=29.849 o'clock, as 29.849＜R DM5Shi Xuanwei DM1;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM3Elected DM5 as at＜=1.482 o'clock, as 1.482＜R DM3Elected DM3 as at＜=6.447 o'clock, as 6.447＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM1Elected DM5 as at＜=1.066 o'clock, as 1.066＜R DM1Elected DM3 as at＜=1.359 o'clock, as 1.359＜R DM1Shi Xuanwei DM1.
64. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 4.0＜E[(RX)] and described when allowing packet type set to be the set of all packet types:
When k=DH5, as 1.000＜R DH5Elected described optimum packet type DH5 at＜=1.513 o'clock as, as 1.513＜R DH5Shi Xuanwei DM5;
When k=DM5, work as 1.000=R DM5The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM5Elected DM5 as at＜=2.377 o'clock, as 2.377＜R DM5Elected DM3 as at＜=38.889 o'clock, as 38.889＜R DM5Shi Xuanwei DM1;
When k=DM3, work as 1.000=R DM3The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM3Elected DM5 as at＜=1.607 o'clock, as 1.607＜R DM3Elected DM3 as at＜=7.414 o'clock, as 7.414＜R DM3Shi Xuanwei DM1; And
When k=DM1, work as 1.000=R DM1The described optimum packet type DH5 of Shi Xuanwei is as 1.000＜R DM1Elected DM5 as at＜=1.081 o'clock, as 1.081＜R DM1Elected DM3 as at＜=1.390 o'clock, as 1.390＜R DM1Shi Xuanwei DM1.
65. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
As E[(RX)]＜2.0 and described when to allow packet type set be all length less than the set of the DM packet type of 5 time slots:
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM3 at＜=4.556 o'clock as, as 4.556＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM3 at＜=1.284 o'clock as, as 1.284＜R DM1Shi Xuanwei DM1.
66. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 2.0＜E[(RX)]＜4.0 and described when to allow packet type set be all length less than the set of the DM packet type of 5 time slots:
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM3 at＜=6.442 o'clock as, as 6.442＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM3 at＜=1.359 o'clock as, as 1.359＜R DM1Shi Xuanwei DM1.
67. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 4.0＜E[(RX)] and described when to allow packet type set be all length less than the set of the DM packet type of 5 time slots:
When k=DM3, as 1.000＜=R DM3＜=7.407 optimum packet type DM3 are as 7.407＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM3 at＜=1.389 o'clock as, as 1.389＜R DM1Shi Xuanwei DM1.
68. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
As E[(RX)]＜2.0 and described when allowing packet type set to be the set of all DM packet types:
When k=DM5, as 1.000＜=R DM5Elected described optimum packet type DM5 at＜=1.588 o'clock as, as 1.588＜R DM5Elected DM3 as at＜=15.990 o'clock, as 15.990＜R DM5Shi Xuanwei DM1;
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM5 at＜=1.286 o'clock as, as 1.286＜R DM3Elected DM3 as at＜=4.566 o'clock, as 4.566＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM5 at＜=1.043 o'clock as, as 1.043＜R DM1Elected DM3 as at＜=1.284 o'clock, as 1.284＜R DM1Shi Xuanwei DM1.
69. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 2.0＜E[(RX)]＜4.0 and only described when allowing packet type set to be the set of all DM packet types:
When k=DM5, as 1.000＜=R DM5Elected described optimum packet type DM5 at＜=2.061 o'clock as, as 2.061＜R DM5Elected DM3 as at＜=29.849 o'clock, as 29.849＜R DM5Shi Xuanwei DM1;
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM5 at＜=1.482 o'clock as, as 1.482＜R DM3Elected DM3 as at＜=6.447 o'clock, as 6.447＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM5 at＜=1.066 o'clock as, as 1.066＜R DM1Elected DM3 as at＜=1.359 o'clock, as 1.359＜R DM1Shi Xuanwei DM1.
70. the short scope radio link of communication equipment as claimed in claim 52 is characterized in that:
When 4.0＜E[(RX)] and only described when allowing packet type set to be the set of all DM packet types:
When k=DM5, as 1.000＜=R DM5Elected described optimum packet type DM5 at＜=2.377 o'clock as, as 2.377＜R DM5Elected DM3 as at＜=38.889 o'clock, as 38.889＜R DM5Shi Xuanwei DM1;
When k=DM3, as 1.000＜=R DM3Elected described optimum packet type DM5 at＜=1.607 o'clock as, as 1.607＜R DM3Elected DM3 as at＜=7.414 o'clock, as 7.414＜R DM3Shi Xuanwei DM1; And
When k=DM1, as 1.000＜=R DM1Elected described optimum packet type DM5 at＜=1.081 o'clock as, as 1.081＜R DM1Elected DM3 as at＜=1.391 o'clock, as 1.391＜R DM1Shi Xuanwei DM1.
71. a Wireless Telecom Equipment is characterized in that comprising:
Be used for data are divided into type k and the length L of selecting from multiple packet type kThe device of grouping, wherein:
Be the type k grouping transmitting time E that determines to hope to succeed k
Select its E k/ L kIt is the optimum packet type of minimum value;
Described data are divided into described optimum packet type.
72., it is characterized in that as the described Wireless Telecom Equipment of claim 71:
Transmitted in packets sum to type k is counted;
Successful transmission counting number to the grouping of type k;
By described transmission is total divided by the described retransmission rate R that successfully transmits number compute type k grouping kAnd
Use described retransmission rate R kDetermine the described transmitting time E that hopes to succeed k
73., it is characterized in that as the described Wireless Telecom Equipment of claim 71:
The packet delivery time of each type k is (TX) k
Determine expectation time of reception E[(RX)];
Press T K=(TX) k+ E[(RX)] calculate and always expect to confirm transmitting time T kAnd
At described definite described transmitting time E that hopes to succeed kStep in use described total expectation to confirm transmitting time T k
74., it is characterized in that k selects from comprise 1,2,3,4,5,6 set, and a plurality of packet type comprises packet type DM1, DH1, DM3, DH3, DM5, DH5 as the described Wireless Telecom Equipment of claim 71.
CNB2003801012576A 2002-10-16 2003-10-14 A data partition method to maximize bluetooth baseband throughput Expired - Fee Related CN100352238C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US41924202P 2002-10-16 2002-10-16
US60/419,242 2002-10-16
US10/295,306 2002-11-15

Publications (2)

Publication Number Publication Date
CN1703887A true CN1703887A (en) 2005-11-30
CN100352238C CN100352238C (en) 2007-11-28

Family

ID=35632730

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2003801012576A Expired - Fee Related CN100352238C (en) 2002-10-16 2003-10-14 A data partition method to maximize bluetooth baseband throughput

Country Status (1)

Country Link
CN (1) CN100352238C (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210250117A1 (en) * 2018-07-24 2021-08-12 Sandip Homchaudhuri Techniques for rate adaptation under congestion and latency contraints

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8223867B2 (en) * 2000-06-09 2012-07-17 Texas Instruments Incorporated Wireless communications with efficient channel coding
US7095719B1 (en) * 2000-06-20 2006-08-22 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for dynamic packet selection in uncoordinated radio systems
US7039038B2 (en) * 2001-01-18 2006-05-02 Texas Instruments Incorporated Adaptive fragmentation for wireless network communications

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210250117A1 (en) * 2018-07-24 2021-08-12 Sandip Homchaudhuri Techniques for rate adaptation under congestion and latency contraints
US11811525B2 (en) * 2018-07-24 2023-11-07 Qualcomm Incorporated Techniques for rate adaptation under congestion and latency constraints

Also Published As

Publication number Publication date
CN100352238C (en) 2007-11-28

Similar Documents

Publication Publication Date Title
CN1638322A (en) Method and system for repeating request in hybrid ultra wideband-bluetooth radio
CN1135053C (en) Communication system
CN101729204B (en) Method for receiving scheduling information from user equipment in mobile communication system
RU2510139C2 (en) Resource allocation
JP5384686B2 (en) Method and apparatus in communication system
EP3197060B1 (en) Data transmission method, device and system
CN105515738B (en) Movement station, base station and the method for operating network infrastructure entity
CN1976272A (en) Method and apparatus for controlling reliability of feedback signal in a mobile communication system
CN101588230B (en) An operation method for synchronous mixed automatic repeat request in wireless communication system
CN101061686A (en) Method and apparatus for signaling control information of uplink packet data service in mobile communication system
CN1175701C (en) Base station device and wireless communication method
CN1806400A (en) Apparatus and method for transmitting reverse packet data in mobile communication system
CN1315095A (en) Apparatus and method for channel coding and multiplexing in CDMA communication system
CN1422086A (en) System and method for polling transmitting protocol data unit in buffer memory
JP2011176847A (en) Method and apparatus which provide acknowledgement and assignment message using single channel
CN1665195A (en) Communication apparatus, communication method, and communication system
CN1750450A (en) Method and apparatus for signalling user equipment status information for uplink packet transmission
CN1256822A (en) Device and method for exchanging frame message of different lengths in CDMA communication system
US8208495B2 (en) Data transmission with supplemental resources
CN101057423A (en) Method and apparatus for transmitting and receiving downlinkcontrol information in a mobile communication system supporting uplink packet data service
CN1701535A (en) Method and apparatus for providing uplink packet data service in asynchronous WCDMA system
CN1875589A (en) Access points with selective communication rate and scheduling control and related methods for wireless local area networks (wlans)
EP3429297B1 (en) Method for transmitting uplink data and corresponding apparatus and computer-readable storage medium
CN1728838A (en) Autonomous transmission method and apparatus in the mobile communication system of support enhanced uplink
CN105356984A (en) Method and apparatus for activating carriers in mobile communication system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 1082139

Country of ref document: HK

C14 Grant of patent or utility model
GR01 Patent grant
REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1082139

Country of ref document: HK

CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20071128

Termination date: 20181014