WO2001039420A1

WO2001039420A1 - Method for adapting the bit rate in a communications device and a corresponding communications device

Info

Publication number: WO2001039420A1
Application number: PCT/DE2000/001373
Authority: WO
Inventors: Bernhard Raaf
Original assignee: Siemens Aktiengesellschaft
Priority date: 1999-11-25
Filing date: 2000-05-02
Publication date: 2001-05-31

Abstract

The aim of the invention is to adapt the bit rate of a bit stream which is distributed to several timely successive frames by means of interleaving. The bits that are distributed to a certain first frame are removed and the bits that are distributed to additional frames are subsequently removed in such a way that, with regard to the additional frames, the distance (q) between bits removals which are successive in the original bit stream matches the distance within the first frame between the bit which precedes in the original bit stream respectively, has been removed before and pertains to the first frame and the bit which succeeds in the original bit stream respectively, has been removed before and pertains to the first frame.

Description

description

Method for adapting the bit rate in a communication device and corresponding communication device

The present invention relates to a method according to the preamble of claim 1 for adapting the bit rate in a communication device and to a corresponding communication device according to the preamble of claim 20.

Mobile radio technology is developing rapidly. Work is currently underway to standardize the so-called UMTS mobile radio standard ('Universal Mobile Telecommunications System') for mobile radio devices of the third mobile radio generation. According to the current status of UMTS standardization, provided to be sent bits before they are transmitted to an interleaver, which rearranges the bits of the bit stream supplied to it and divides them into several frames to be sent in succession (with UMTS with a frame duration of 10 ms each).

In order to adapt the bit rate to the respective possible transmission rate, a rate matching is carried out in the transmitter, wherein bits are either removed from the bit stream or multiplied, in particular doubled, in the bit stream. Removing bits is called 'puncturing' and multiplying is called 'repeating'.

However, there are some restrictions to consider when performing rate adjustment after the interleaving process. For example, the pattern or scheme with which the rate adjustment is carried out and the individual bits are punctured or repeated should be chosen such that the punctured or repeated bits are distributed as evenly as possible over the individual frames. It is also disadvantageous if there are several immediately consecutive bits of the interleaver originally zugefuhrten bitstream punk ^¬ be advantage.

The aforementioned second condition, for example, hurt when ausgege to each of the interleaver ^¬ enclosed frame always one and the same puncturing or REPE is applied tierungsmuster since then each frame m respectively, the same bit positions punctured or are repeated, but the m the original bit stream, which is fed to the interleaver, correspond to consecutive bits. If, for example, the bits were divided into eight frames by interleaving, this procedure had the consequence that eight consecutive bits of the original bit stream were punctured or repeated, which is undesirable.

This problem can be largely eliminated if offset puncturing or repetition patterns are applied to the individual frames output by the interleaver.

Nevertheless, depending on the choice of puncturing or repetition rate, i.e. the number of bits to be punctured or repeated based on the total number of bits of the individual frames, cases occur in which occasionally successive bits of the original bit stream are punctured. However, if the spacing between successive punctures or repetitions is changed one or more times for puncturing or repetition, not only can the puncturing or repetitions be distributed evenly over the individual frames, but also the puncturing or repetition of bits immediately following one another in the original bit stream can be avoided , This will be explained in more detail below with reference to FIG. 3.

3 shows the interleaving scheme for dividing the individual bits of a bit stream into a total of eight frames. is set, ie the individual bits are alternately assigned to frame No. 1, No. 2 ... No. 8, so that frame No. 1 has bits No. 0, No. 8, No. 16, etc., for example , In addition, the example for a puncturing scheme is shown in FIG. 3, which is to be applied to the individual frames after interleaving, each punctured bit being indicated by a thick border. The puncturing pattern is selected such that bits are punctured with a generally uniform spacing in the original bit stream. In the example shown in FIG. 3, for example, every sixth bit is punctured. After the fourth puncturing, ie the puncturing of bit no. 18, the puncturing distance q is shortened once to five bits, so that bit no. 23 is punctured (instead of bit no. 24). Then the normal puncturing distance is continued. After each column and thus each frame has been punctured once, the puncturing pattern is repeated, ie shifted down to bit no. 48. Accordingly, there is a further reduction in the puncturing distance between bits No. 66 and No. 71. In Fig. 3, a "normal" puncturing distance is indicated by a thin arrow and a "shortened" puncturing distance by a thick arrow.

It can be seen from the illustration in FIG. 3 that on the one hand uniform puncturing of the columns assigned to a respective frame is achieved and on the other hand no puncturing of successive bits in the original bit stream is punctured. Each column or frame is punctured individually with the same puncturing pattern, but the puncturing pattern is shifted from column to column.

In order to be able to actually obtain the desired puncturing rate, the puncturing of bit no. 104 must be continued after the repetition of the puncturing pattern described above and starting with bit no. 48. this has however, the consequence is that there is a relatively large distance between the last punctured bit No. 89 and the bit No. 104 to be punctured. In the example shown, a puncturing distance of five bits, twelve times a puncturing distance of six bits, once a puncturing distance of seven bits and once a puncturing distance of 15 bits are thus used in total.

Even if a puncturing pattern has been described by way of example with reference to FIG. 3, the above considerations apply analogously to a corresponding repeating pattern.

Based on the prior art described with reference to FIG. 3, the present invention is based on the object of providing a method for adapting the bit rate in a communication device and a corresponding communication device, it being possible to achieve a more uniform distribution of the bits to be punctured or repeated in particular, larger distances between punctured or repeated bits that follow one another in the original bit stream can be avoided.

This object is achieved according to the invention by a method with the features of claim 1 or a communication device with the features of claim 20. The subclaims define preferred and advantageous embodiments of the present invention.

According to the invention, it is proposed to first puncture or repeat the first frame using a specific puncturing or repetition pattern. Then the puncturing or repetition of the bits of the further frames takes place on the basis of this puncturing or repetition pattern of the first frame, the distance between those to be punctured or repeated and by the

Interleaving bits divided into the further frames depending on the puncturing or repetition distance of the first frame is selected. The puncturing or repetition distance for the bits of the further frames is preferably determined individually for each puncturing or repetition.

The present invention is based on the knowledge that the puncturing or repeating patterns of the individual frames do not have to be identical, but only have to be offset from one another, the nesting of the puncturing or repeating pattern of the individual frames not only globally but also locally each individual puncturing or repetition can be carried out. In this way, the puncturing or repeating pattern of the individual columns becomes irregular; overall, however, a very uniform puncturing or repetition is achieved when considering the overall framework, in particular larger puncturing or repetition distances are avoided or their frequency is at least reduced.

If uneven puncturing / repetition is desired, a special puncturing / repetition algorithm with bit-specific update parameters can be applied to the bits assigned to the first frame, so that the puncturing / repetition density of the first frame or the first column, which the Forms the basis for puncturing / repeating the other frames or columns, can be controlled in a targeted manner.

The present invention is particularly suitable for adapting the bit rate in (UMTS) mobile radio systems, this relating both to the area of the mobile radio transmitter and to that of the mobile radio receiver which is designed to receive a bit stream processed according to the invention. However, the invention is not restricted to this area of application, but can generally be used wherever the data rate of a bit stream has to be adapted. The present invention is described in more detail below with reference to the accompanying drawing using a preferred exemplary embodiment.

1 shows a simplified block diagram of a mobile radio transmitter according to the invention,

FIG. 2 shows a representation of a preferred exemplary embodiment for a puncturing scheme which can be used according to the invention by a unit shown in FIG. 1 for adapting the bit rate,

3 shows an illustration of a puncturing scheme used according to the prior art,

4A shows a possible algorithm that can be used to puncture a first frame shown in FIG. 2,

FIG. 4B shows a possible algorithm that can be used to repeat the first frame shown in FIG. 2, and

FIG. 5 shows another possible algorithm that can be used to puncture and repeat the first frame shown in FIG. 2.

1 schematically shows the structure of a mobile radio transmitter 1 according to the invention, from which data or communication information, in particular voice information, is transmitted to a receiver via a high-frequency transmission channel. The information supplied by a data source 2, for example a microphone, is first converted into a bit sequence using a digital source encoder 3. The encoded data is then encoded with the aid of a channel encoder 4, the actual user or message bits being encoded redundantly, as a result of which transmission errors can be recognized and then corrected. So-called block codes or convolutional codes are usually used for channel coding. According to the current state of UMTS standardization, the use of convolutional codes is proposed. An essential difference from block codes is that convolutional codes do not encode individual data blocks one after the other, but that they are continuous processing, each current code word of an input sequence to be coded also depending on the previous input sequences.

Before the channel-coded information is transmitted to the receiver, it is fed to an interleaver 5, which rearranges the bits to be transmitted in time according to a certain scheme and thereby spreads them in time, as a result of which the errors which generally occur in bundles are distributed in order to create a so-called memoryless Obtain transmission channel with a quasi-random error distribution. The information or data coded in this way is fed to a modulator 7, the function of which is to modulate the data onto a carrier signal and to transmit it to a receiver via a high-frequency transmission channel in accordance with a predetermined multiple access method.

In order to adapt the bit rate of the coded data stream to the respective possible transmission rate, a rate adjustment ('rate matching') is carried out in front of the modulator 7 with the aid of a unit 6, with the unit 6 puncturing, ie removing, certain bits according to a predetermined scheme , or repeated, ie multiplied. To explain the present invention, it is assumed below that the unit 6 is a puncturing unit. The invention explained in more detail below with reference to FIG. 2 can of course also be applied to the case of repetition. ) 0J N> l- ¹ P ¹

(_π o π O (Jl O Lπ

P- <! PJ>fc> rt "Z ω to • τj s: rt <VO u_5 CΛ S CΛ ^ Q rt ≤, α α ⁱ Q ξ P ⁾ Öd P ⁾ d M

3 O σ 00 P- PJ Φ JC P- P- C P- Φ rt P- PJ • rt φ P- Φ • Φ ⁾ Φ P- O P- dda

P cn φ _- ^■ P P- 'a φ Φ ti Φ o tr J φ rt tr Φ O d Φ P • cn CΛ d φ tr rt CΛ d α a- rt P -— - 3 ι-f P tr Φ ti P • a α α P. rt CΛ υ_) x

PJ J dd Φ Φ rt tr 0 rt Φ a α W P- Φ Φ P Φ cl Φ ^ 0 p- Φ rt P- aaaad Ό Φ a P- Φ a P- X a α P- X to P a P> d PP da to U3 P- ^ Q α Q. 0- ι £> d α 3 CΛ Φ CΛ ιQ Φ 1 Φ N rt ^ Φ PJ rt • Hi CΛ d PJ Φ P ⁾ Φ. z Φ CΛ a Φ P n CΛ HP "öd az CΛ P ^{^} I • Ö Φ PJ rt x ^ 'CΛ d P

Φ a <PJ PJ P p- tr d tr PJ d P- P- 1 d öd EP Φ rt P- § Q d

P- oa tr rt a N a H tr a φ rt d ω α d ≤ Φ P-> d tr φ rt a P- * Q Φ w Φ d rt P- a Λ CΛ P- Φ z. vQ P- CΛ iQ ti CΛ cn P- P Φ d • φ P- • _" Φ. d ⁾ d ^ Q P-

Φ CΛ n rt φ P. • Φ rt rt rt a tr φ n P- CΛ rt rt _Λ P d CΛ CΛ

P rt CΛ tr PJ P ω P- α tr J Φ CΛ P x Φ CΛ t rt td P- P φ 3 P> d (.0 PJ P ⁾ s: CΛ rt

Φ • P- a rt rt ιQ α Φ Φ aa Ό o rt a Φ vQ Φ z P ⁾ φ P ⁾ : P- P- ^* dd (- ^■ P- nd φ P- * _* φ • Φ ι-ia α rt P 3 P- P Φ P P- Λ P yQ d rt § ιQ H- Hi o P tr α ö tr Φ H cn P- φ α Hi Φ P H- rt rt φ Φ CΛ 3 υ_5 o α Φ J ⁾ P- Φ P α ϊö N) 3 Φ Λ Ό O ι_ι. P Φ zd: d α Φ Φ P Φ d CΛ Φ P- 3 CΛ

0 ⁾ φ d Φ O PJ PJ Φ PJ H tr Φ t; P φ tr P d α P- cn n * 1 rt P- P ⁾

IT Λ d a s> Ö "ιQ H E> 3 P- Φ rt ≤ ti P- P CΛ α φ PJ N d - tr o Φ φ Q.

£ j <

Cd α Φ CΛ ιQ P- P n ** Φ iQ P- rt rt TJ P ⁾ d dd tr Z Φ Φ P P- P PJ α o φ er P- CΛ N Φ N rt Φ rt α tr μ. 3 Φ • P ⁾ p α P- Φ P- 3 α 3 3 rt EP PJ dd Φ rt Φ Φ dd Φ Φ tr rt P- Φ P ⁾ P d rt H- CΛ Φ P> rt Φ P

CΛ P- od P- a Φ <_ id CΛ Φ d Φ ü rt P ⁾ ω o tr P Φ d <_ ι £ 5 α tr Φ dt pj: tr ιQ P- P- α Pi CΛ H a PJ Φ d α tr φ P- P- Z o Φ Φ

N d _ φ CΛ n N rt ω O rt α t ⁾ CΛ tr a P- Hl P- Φ Φ CΛ yQ CΛ d Φ öd d CΛ P z rt N tr ≤ Φ TJ tr - c Λ J Φ T o Φ Φ d P d rt Φ rt φ P P- rt

• φ Ξ T) ω Λ a PJ Φ Φ α n PH P> P- α d P- 3 P rt Φ T) rt H- £ P- rt α P. II tr CΛ d: a ¹ Φ T) P- Φ g P ¹ 3 P>: α Φ Λ Φ do _^ CΛ a rt tr rt <v ⁾ n Hi rt a § z P d φ P ^ 3 öa Φ φ d rt 3 d

Ό O! CΛ Φ P- Φ Φ C tr X o Φ <Q Φ P- d CΛ tr CΛ X rt 1-1 d • P rt Λ "oo

PJ α lr rt P- Φ P- i ω Po ιQ P ^J P a P? Φ J rt Φ ^ PJ rt O ^ rt

(D φ P-. Ts CΛ <X P- Φ o U-) P- PJ rt 3 P ⁾ dd P- P CΛ Ö 3 d P- rt s> d Φ N φ Φ Ό Φ rt n H Hi α φ to n P> P P- tr dd ιQ rt Ό P- ω rt Z Φ

Φ PZP P- ι-i P- tr C- Φ a PJ tr tr α IQ Φ T) α • _^ P φ Φ o P a 3 d P- d CΛ φ PJ: Φ l__l. tr π α IT Φ tr Φ Φ P d α d Φ PJ P tr d

PJ Φ! -J CΛ d rt ti H tr Φ H Φ a pj: P CΛ dd Φ NP ¹ d> α n öd σ Φ d

≥; na ιQ na Φ tr d Φ α rt Λ a φ ti rt d cn z \. Λ ^* J tr P- z Φ P- iQ p tr tr; v J Φ a H Φ • a tö ^ Q • XI Φ ιQ rt P- _- ~ rt α & 5 Φ rt Φ PJ CΛ

, Hl tu 3 Φ rt ω Hi H ιQ φ II 3 CΛ P- P- d P- φ CΛ Ϊ P- P- d CΛ o <PJ Φ

O P- P- a P- TJ rt rt CΛ P- Φ O α rt »Q a α Φ PO 1 Φ φ yQ α tr Φ d P- rt rt Φ PJ Φ P> rt H- P ⁾ fa CΛ rt Φ P CΛ tr P ¹ PP Φ _l. CΛ P PJ d

1 ^ Q CΛ α P t ⁾ t tr CΛ a tr 1 t ti rt rt Φ P d rt φ - - d öd dd φ Φ P- tr

00 Φ Φ Φ d rt P ⁾ CΛ N Φ P ¹ rt P PJ P- da Φ ad P- d. αi o Φ d _2 P- d tf Φ d σ rt tr Φ P- P- O <Φ ≤> Q d ^ Q rt α ω φ d iQ P- tr α pd ιQ c Φ J φ ^ 3 Φ 3 o PH Φ CΛ PJ P- CΛ Λ CΛ Ό CΛ C rt o • Φ td t! ti a P- ti Z Φ ι-i Φ ti dd P- 3 to d Φ 3 P ⁾ : PJ p- N p α 3 P- 3 Φ Φ P- CΛ CP J. ^ »a rt rt d P ⁾ Hi ιQ d 3 rt t PJ Φ d

P- P- j- rt P- P rt X α H Φ ti Φ ιQ Φ Φ cn tr Φ Φ CΛ PN rt P ⁾ d

N Φ OD TJ CΛ rt PJ P- ⁾ Φ d α rt P- ≤ o CΛ PP rt 3 P- d rt • Φ Hi Φ ^ P o α P Φ ti Φ PCN 3 Φ tr PJ H ¹ Φ Φ Φ d 0 - Φ P- 3 p- P- φ d 0 dd ≥. Φ rt H a Λ 3 α rt P- σ Φ a P a PJ Φ P o OJ φ P- d yQ J rr d 3? P P- d • ti t Φ Φ d -> α CΛ PJ CΛ dd "• tr ddd N • h- ¹

(D a rt. Aa Φ PJ: rt P d 3 P 0) Φ rt <! a α Ό Hl CΛ CΛ Φ P- h- '; P- Φ <! > QM n P- a CΛ PJ P- J φ Φ Φ • nd 00 α ιQ ^ QP ¹ J ω rt H> Φ o 3 Φ CΛ CΛ tr Φ TJ α a O <ad CΛ a P dd P- Φ cn Φ d P- tr P- OP ι- (CΛ rt CΛ H c Φ H or? α ^ Q 3 rt Hi d φ rt P- CΛ Φ α Φ

P- Φ 0 ^ dd ^ rt n Φ rt C a P: P 1 Φ φ zo rt P> P d PJ a PJ P ω P - - - aad P- tr a Φ t ⁾ ? P- rt 13 tr 1 Hi d P Φ 1 P- C i öd PJ 3 0 rt d ιQ d 1 Φ a υ3 1 φ ιQ Φ d: ^ 1 1 Φ P- 1 rt o φ a ω 3 X 1 PP Φ P rt a ιQ 1 1 J 1 P rt cn

to bit 47 with a puncturing distance of six bits each (corresponding to the puncturing distance between bits No. 0 and 48 in the first frame), while the puncturing up to bit No. 103 is carried out horizontally with a puncturing distance of seven bits each (accordingly the puncturing distance between bits No. 48 and 104 in the first frame).

As has already been explained with reference to FIG. 3, care must also be taken with this procedure that even puncturing of the individual columns or frames is ensured, i.e. repeated puncturing should not occur in such a way that one column of the interleaving matrix has already been punctured twice before another column is punctured for the first time. Therefore, when using eight frames shown in FIG. 2, in the event that there is an even-numbered puncturing distance q for the horizontal puncturing of the further frames or columns No. 2-8, this must be changed accordingly at least once. In the example shown in FIG. 2, therefore, after the puncturing of bit no. 18, a one-time reduction of the puncturing distance to q = 5 is provided, so that bit no. 23 is then punctured. Subsequently, the puncturing takes place again with the puncturing distance q = 6. For the area of frame no. 2-8, which is punctured with q = 7, such a change in the puncturing distance is not necessary.

Starting from bit no. 104, the puncturing scheme shown in FIG. 2 can be repeated to finally obtain the desired puncturing rate.

It can be seen from the illustration in FIG. 2 that a puncturing distance of five bits in total once, a puncturing distance of six bits in total six times and a puncturing distance of seven bits in total nine times by the procedure described above. The in Fig. 3 Puncturing spacing of 15 bits is avoided. Overall, a more even distribution of the punctured bits is thus achieved, this advantage being particularly relevant at puncturing rates which are somewhat less than 1 / k, since in these cases the puncturing scheme for k-1 is used according to the prior art shown in FIG. 3 becomes.

In the preceding description of the invention, it was assumed that a puncturing or repetition pattern with punctuated or repeated bits distributed as evenly as possible was used for the first frame, the bits of the others then being described as a function of this puncturing or repeating pattern Frames are punctured or repeated.

For certain applications, however, an uneven distribution of the punctured or repeated bits can also be interesting.

For example, it may be desirable to transmit certain bit areas (so-called "Class A bits") with a better quality than other bit areas (so-called "Class B-" or "Class C bits"). This is particularly relevant for voice transmission. For AMR coders ("Adaptive Multi Rate" coders) in GSM mobile radio systems ("Global System For Mobile Communications"), this problem was solved by heuristically determining a puncturing pattern which was stronger for the class A bits Puncturing as provided for the areas of the Class B or Class C bits. However, this procedure cannot be used for UMTS systems for two reasons. On the one hand, the total number of bits to be punctured or the total number of bits to be transmitted are not fixed a priori in UMTS systems, but depend on the totality of the services to be transmitted. On the other hand, the puncturing, at least with an uplink

Connection and always in TDD mode ("Time Division Duplex") after the first interleaving, the bits must be punctured evenly in all frames.

Another application for uneven puncturing is so-called "tail puncturing". If convolutional coding is used for channel coding, which is common practice, the bits at the beginning and at the end of a frame are better protected against transmission errors than the bits present in the middle frame area. However, this is sometimes not necessary. A stronger puncturing in the edge areas of the frame can then achieve a more uniform error distribution and thus an overall better transmission performance.

4A shows a possible algorithm with which an uneven puncturing pattern can be achieved for the bits assigned to a frame to be transmitted. Here, m denotes the position of the currently considered bit x _m in the respective frame, while N indicates the number of bits in the frame. The algorithm evaluates a continuously updated error value e, which describes the error between the current puncturing rate and the desired puncturing rate. For each bit x ". an individual error value e, which is composed of the error value of the bit x _m - _ι preceding in the corresponding frame and an update _parameter e _mιn u _Ξ / e _p ι _us , is calculated as follows.

In a step (1), the error _value e is _initially set to an initial error e _ιnι . This initial value usually has the value 1 for the sake of simplicity. Then, in a step (2), the index of the currently viewed bit is set to 1 and the sequence embedded in a WHILE loop (3) is carried out. The error value is thus updated for bit x _^ , the difference between the current error value and a predetermined first update _parameter e _{minus being} calculated (step (4)). If the result e <0 (step (5)), the bit x- is punctured (step (6)) and then the error value e is updated again, with the current error value e being adjusted by a predetermined second update parameter e _p ι _{us is} increased (step (7)). The index of the bit under consideration is then increased in a step (8) and the WHILE loop for the next bit of the respective frame is thus run through.

In this way a indivi ^¬ dueller error value E is calculated for each bit X n-, of the frame which extends from the one for the previous bit x _m - the initialization _ιnι e _ι calculated error value, or when m = 1 and _mιn the Aktualisierungsparame- direct e u _S and e _p ι _us put together.

In principle, the algorithm shown in FIG. 4A and previously described is already known. In the conventional algorithm is, however, assumed that the parameters e _{_mιnus} and e _p ι _us are constant for the entire area of the frame, ie for the calculation of the error value e is calculated for each bit x same parameter value e _mιnus and e _n ι _us used.

Within the scope of the present invention, however, it is proposed that the parameters eπ. _{Not to keep lnus} and e _{dlus constant} for the entire area of the frame, but to vary them.

In the extreme case, each individual bit x _m can be assigned an individual value e _mιnU Ξ (x _m ) and / or e _p ι _us (x _m ). It is also conceivable that the bits are combined into specific groups, the bits within a group being assigned the same parameter values, while the parameter values differ from group to group. For example, the first ten bits, the next 20 bits, etc. can form such a group.

Since the puncturing _density depends on the parameters e _minus and e _pιU3 , the puncturing can be individually controls and thus uneven puncturing can be achieved.

4B shows a corresponding algorithm for the case of repetition of bits. To explain the individual steps (1) - (8), reference should also be made here to the explanations given above for FIG. 4A. The repetition algorithm differs from the puncturing algorithm only in that a WHILE loop is provided instead of the IF instruction, so that the respective bit x ~ is repeated and the error value e assigned to bit x _{m is} increased by e _Dιus until the error value is greater than zero.

According to the repetition algorithm shown in FIG. 4B, variable bit-specific parameter values e _minus (x _n ) and are used in order to achieve an uneven repetition _density .

In order to perform both puncturing and repetition in a single frame, the algorithm shown in FIG. 5 can be used, reference being again made in addition to the above comments on FIGS. 4A and 4B. The algorithm shown in FIG. 5 corresponds to a combination of the algorithms shown in FIGS. 4A and 4B, wherein steps (5) - (7) are used to execute a WHILE loop, which the corresponding bit x _m is used for the transmission to a receiver is selected and the corresponding error value e is increased by e _p ι _UΞ until the error value e assumes a value _greater than zero. This means that the bit x _m is not selected at all for the transmission and is therefore punctured if the error value e updated in step (4) is greater than zero. On the other hand, in the event that after step (4) the error value e is less than or equal to zero, the bit x _{n is} repeated just as often as the error value e by e _p ι _us until the value zero is reached can be enlarged. In the algorithm shown in FIG. 5, it can be controlled by varying the parameter _{neus in} which areas bits are punctured and in which areas bits are to be repeated. _Puncturing generally takes place in those areas where e _mιn u _S <e _plus applies, while conversely a repetition is carried out where e _mιnU s ≥ e _{DtUS applies} ).

In the case of an AMR-coded transmission with, for example, constant update parameter e _p ι _us , the parameter e _minus (x _m ) for the more important class A bits can thus be chosen to be relatively large, in order to achieve repetition of these bits while these parameters are being used For the less important Class B or Class C bits, it can be chosen to be relatively small in order to achieve a low repetition or even a puncturing. The signaling required for this, ie the transmission of values for determining the parameters e _dius (x _m ) and / or e _mιnus (x _m ) or the relationship between the individual parameters, is no more complex than the currently known solution, which is provided for is to send the bits of different classes m independent transport channels for which the puncturing or repetition is carried out independently of one another. Only the total number of bits of all transport channels after puncturing or repetition must correspond to the number of bits available for the transmission. With this procedure, therefore, for each class of bits, its relative weight or a corresponding parameter, which determines whether repetition or puncturing is used for the respective class, must also be transmitted.

The puncturing / repetition algorithm described above with reference to FIGS. 4A, 4B and 5 can be combined with the puncturing / repetition scheme described with reference to FIG. 2 in order to obtain an uneven puncturing / repetition. For this purpose, an individual value for e _mnUs can be assigned to each bit for the first column shown in FIG. 2, which corresponds to the first interleaving frame. The resulting puncturing / repetition pattern of the first column is then used according to the shift algorithm described with reference to FIG. 2 as the basis for the puncturing / repetition of the bits assigned to the other columns or frames.

In the case of repetition, the shift explained with reference to FIG. 2 is not necessarily determined between successive repeated bits, since, for example, all bits could also be repeated. Rather, in this case the shift between two successive bits is determined, which are not repeated or not repeated as often as the other bits. These bits are transferred to the other columns or frames analogously to in the case of puncturing according to FIG. However, it would also be conceivable to transfer the more frequently repeated bits of the first frame or the first column to the further frames or columns.

The parameters e _mιlus and e _p ι _us can be defined, for example, as follows, where N denotes the number of bits per frame before the rate adjustment, N _c the number of bits per frame after the rate adjustment and K denotes a constant corresponding to the weighting described below:

S luΞ ⁼ K e _mιn us = w (x * N _C

The parameter w (x _m ) individually determined for each bit x _m corresponds to the weight of the respective bit x _m , where: w (x _m ) = K. Overall, the error value e is increased and decreased by K * N =]. w (x _m ) denotes the weight assigned to the bit x _m , i.e. the mth bit. In a simplified nomenclature, this can also be expressed by w (m) N. ¹ P ¹

O C i o Oi

yQ Hi <rt öd N Cd PJ φ φ P φ z P n d ≤ z α P- ö PJ

Φ P- φ d tr Φ φ P d P a z

& φ d d P P * P- φ rt P- d Φ P φ φ N> £. P

, yQ J 3 P- cn yQ d> φ PJ Φ φ P Φ P M P cn P Φ w P- <! tr ≤ Φ

P tr P d P o N ιQ Λ rt a P d O h- ¹ PJ d

Φ Ϊ a α d φ n o- Pi φ P a • cn P- rt *! Hl Φ cn a tr Φ d P 3 α

P rt ^• »od PJ φ 3 dzd P o rt α dd P ιQ rt M 3 α o 3 Φ d P ad α 3 Φ 3 N 3 PJ LJ do ^ α Φ iQ <£! J d Φ Ό φ s_ Φ d tr Φ N Φ CΛ

Φ E Φ tr P J s: Φ P- u3 P d d P Φ

3 α P- P n PJ d Φ P a α P

P). Φ P- a O tr d Pi P- CΛ LJ. Hi Φ d Φ

EP ω tr Φ d öd Φ ιQ ιQ Φ N φ d tr d

P->

P P Φ Φ CΛ d α d w Φ • d

P- M N rt öd P PJ Ό P o w P P CΛ a 3 CΛ d CΛ P P <! d o CΛ Hi rt>

Ό d o CΛ rt Hi tr Φ d g tr Φ P- P d P r_ Hl Hl yQ PJ CΛ d Φ P? d d PJ Hl d

3 PJ O Φ rt φ P P Z rt Ό PJ α α ιQ o ιQ d P ti N CΛ P rt Φ P- PJ d Φ d Φ

IQ α x

Φ 3 P> H ¹ d CΛ Φ ti Φ CΛ n P dd P-

Ϊ CΛ PJ d P- M Φ rt α P CΛ tr «3 α φ x

Φ CΛ rt d n 3 d Φ rt d tr Φ CΛ PJ t P P rt tr ^ Φ z rt Φ d PJ Φ ≤ d Φ d

P yQ O Φ Φ Hi d Φ φ Φ CΛ ι £ 5 d cn dd rt dddd PJ CΛ P d Hl n P öd S φ J CΛ d M Φ α tr α tr α H- φ P ⁾

PH ¹ tQ - öd yQ P- Φ ^ rj N φ SP Φ rt P- d cn ω Φ CΛ P- CΛ Ό rt adz P o P CΛ CΛ Hi

? d tr O rt 1 P d • tr φ N Φ φ X PJ Hl CΛ öd PJ iQ 3 w Cd P- tr d Φ J

P PJ rt P- dd rt P P- P ¹ Φ <! P- d tr d rt Z rt tQ Ό to P φ rt Hi d O d PJ α φ d α P CΛ CΛ d • Φ Ό P d. P CΛ Φ d CΛ φ P rt 1 d P φ PJ a rt rt P

Pi P Φ o P Cd X Ö d rt rt w CΛ PJ Φ Φ o d tr P O P rt PJ d P Φ Φ Φ d

P CΛ Hi 3 rt P tr Φ 3 H ¹ tr P- Q iQ P d CΛ CΛ Φ Φ CΛ P PJ Ό tr ⁾ φ o P

Φ Φ d O P rt P P- 1 rt d CΛ d d o

3 d d N P rt Φ Hi J rt α. e

N cn - α d O Φ Z tr CΛ a <5 LJ. Φ d l_J P- 1 P- CΛ 3 φ N O U3 Φ Φ a φ O PI φ PJ tr P z CΛ tr Φ P Φ α

^ z tr d CΛ 9 φ N α • P- Φ P CΛ P Φ Φ

P- φ Φ Hi Φ y P z Φ ^ Q d rt a

^ Q P P O Φ d • a ta d PJ J <tr rt

P yQ a <Q Φ PJ tr d d Φ Φ ω

P P- 3 yQ Φ PP Ό P- ¹ Φ Λ P Ό

P> ιQ CΛ J Φ φ Hi φ a Φ CΛ ιQ i— ^■ s: PP

Φ rt rt P Hi d Ό rt φ O Φ P Φ Φ Φ φ d • P n PJ iQ φ α P d tr α o tr o

P O tr &> rt rt Φ Φ rt P Φ tr P tr

Pi M α a N rt P 3 1 CΛ P tr d ^ 3 Φ

O 3 P Φ • tr Φ Ό Φ dxd Φ d - ¹ Φ P- NP LJ P tr rt PJ ιQ α 1 1 1 z rt Φ Φ Φ d Φ 1 1 1 a

Claims

claims

1. A method for matching the bit rate in a onsvorrichtung Kommunikati ^¬, wherein the adjustment of the bit rate of a bit stream is carried out by puncturing or repetition of bits, with certain removed in puncturing specific bits or at the repetition bits are multiplied, and wherein the adjustment of the Bit rate is carried out after an interleaving of the bit stream, through which the bits of the

Bit streams are divided into a certain number of consecutive frames, characterized in that the following steps are carried out in succession to adjust the bit rate: a) the bits divided into a specific, selected first frame are punctured or repeated, and b) the bits divided into the further frames are punctured or repeated, the distance (q) between punctures or repetitions m successive m of the original bit stream depending on the distance within the first frame between the m of the original bit stream the previous bit punctured or repeated in step a) of the first frame and the bit of the first frame that follows in the original bit stream and is punctured or repeated in step a) is selected.

2. The method according to claim 1, characterized in that in step b) for the further frames, the distance (q) between punctuations or repetitions successive m the original bit stream as large as the distance within the first frame between the m the original bit stream in each case the preceding bit punctured or repeated in step a) of the first frame and the bit that follows in the original bit stream and m that Step a) dotted or repeated bit of the first frame is selected.

3. The method according to claim 2, characterized in that in step b) in the event that the distance (q) between m the punctuation or repetition of the bits divided in succession of the original bit stream and the number of frames a common part- 1er, at least once the distance (q) between two punctures or repetitions of the bits divided into the original bit stream is changed compared to this even number.

4. The method according to claim 3, characterized in that in step b) for the case that there is an even number for the distance (q) between m the original bit stream successive puncturing or repetition of the bits divided into the further frames, at least First, the distance (q) between two punctures or repetitions of the bits divided into the further frames in succession to the original bit stream is reduced or increased by the value 1 compared to this even number.

5. The method according to any one of the preceding claims, characterized in that in step b) for the further frame, the distance to the next puncturing or repetition individually for each puncturing or repetition m depending on the distance within the first frame between the m original bit stream each of the bits of the first frame that are preceding and punctured or repeated in step a) and the bit of the first frame that follows the original bit stream and that is punctured or repeated of step a) are selected.

6. The method according to any one of the preceding claims, characterized in that step b) is carried out repeatedly until m each frame has been punctured or repeated, and that step b) then starting at the m the original bit stream during the Step a) the next punctured or repeated bit of the first frame is carried out repeatedly.

7. The method according to any one of the preceding claims, characterized in that in step a) the bits divided on the first frame are punctured or repeated such that the distance between successive punctured or repeated bits of the first frame either k bits or k-1 Bits.

8. The method according to claim 7, characterized in that in step a) the bits divided on the first frame are punctured or repeated such that the distance between successive punctured or repeated bits of the first frame is alternately k-1 bits and k bits ,

9. The method according to any one of the preceding claims, d a d u r c h g e k e n n z e i c h n e t that the determined, selected first frame is the temporally first frame.

10. The method according to any one of the preceding claims, characterized in that in step a) the bits divided on the first frame are punctured or repeated in that for each of these bits (x) an updated error value (e) which is a measure of the Deviation between the current puncturing or repetition rate and the desired puncturing or repetition rate of the first frame is based on a bit which is immediately preceding the bit in the first frame. The previously determined error value and at least one update _parameter (e _p ius e _mιn us) are determined and the error value (e) thus updated is used to determine whether the corresponding bit (x) should be punctured or repeated or not.

11. The method according to claim 10, characterized in that for determining the updated error value (e) of the JE split to the first frame bits, a variable, bit-specific update parameter (e _p ι _us, e _mιnus) utilization ^¬ is det.

12. The method according to claim 11, characterized in that for determining the updated error value (e) of the individual divided to the first frame bits in each case, a variable, dependent on the position () of the respective bits in the first frame updating parameter (e _p ι _us , e _mι - _nus ) is used.

13. The method according to claim 11 or 12, characterized in that the bits divided on the first frame are assigned to specific bit groups, the same update parameter (e _P ι _us , for determining the updated error value (e) of the individual bits (x) of a bit group, e _mιnus ) is used.

14. The method according to any one of claims 10-13, characterized in that the updated error value (e) of each bit (x) divided on the first frame from the difference between the error value previously determined for the bit immediately preceding in the first frame and a first Update _parameter (e _mιnus ) is determined, and that is for the case that the thus updated error value (e) is not larger than a certain reference value, the ent dotted ^¬ speaking bit, and then the updated for this bit (x) error value again by the summation with a second update parameter (e _{D ^ us} ) is updated.

15. The method according to any one of claims 10-14, d a d u r c h g e k e n n z e i c h n e t that the updated error value (s) each at first

Frame divided bits (x) is determined from the difference between the error _value previously determined for the bit immediately preceding the first frame and a first update _parameter (e _minus ), and in the event that the error value (e) thus updated is not is greater than a certain reference value, the corresponding bit (x) is repeated and then the error value updated for this bit (x) is updated again each time by adding a second update parameter (e _p ι _us ) until the resulting one Error value (s) is greater than the reference value.

16. The method according to any one of claims 10-13, d a d u r c h g e k e n n z e i c h n e t that the updated error value (s) each at first

Frame divided bits (x) is determined from the difference between the error _value previously determined for the bit immediately preceding in the first frame and a first update _parameter (e _minus ), and in the event that the error value (e) thus updated is not is greater than a certain reference value, the corresponding bit (x) is selected for transmission by the communication device to a receiver, and then the error _value updated for this bit (x) is updated again by _adding a second update _parameter (e _Dlus ) , until the resulting error value (s) is greater than the reference value.

17. The method according to any one of claims 14-16, d a d u r c h g e k e n n z e i c h n e t that the reference value is zero.

18. The method according to any one of claims 14-17, characterized in that the first update parameter (e _p ι _us ) and / or second update parameter (e.) Used for determining the updated error value (e) of each bit (x) divided on the first frame _mιnus ) is variable and selected bit-specifically.

19. The method according to claim 18, characterized in that the value K is used as the first update parameter (e _p ι _us ) for each bit (x) divided into the first frame, while for each bit (x) divided into the first frame as the second Update _parameter (e _mιnuΞ ) a bit-specific value w * N _{c is} calculated, where N _c denotes the number of bits per frame after the adaptation of the bit rate, and w denotes a bit-specific weighting factor, and K the sum of the weighting factors of the bits of the first frame ,

20. Communication device, with an interleaving device (5) to divide the bits of a bit stream supplied to the interleaving device (5) into a certain number of successive frames, and with a bit rate adaptation device (6) which is connected downstream of the interleaving device (5) Adapting the bit rate by puncturing or repeating bits of the individual frames, certain bits being removed during puncturing or certain bits being multiplied during repetition, characterized in that the bit rate adjustment device (6) is designed such that it first punctures or repeats the bits divided into a certain first frame in order to adjust the bit rate and then punctures or repeats the bits divided over the further frames, the Bitrate adaption device (6) for these further frames the distance (q) between the punctuations or repetitions in succession m depending on the distance within the first frame between the punctured or repetitive bit of the first frame that precedes the original bit stream and the m selects the punctured or repeated bit of the first frame that follows and punctuates or repeats the original bit stream.

21. Communication device according to claim 20, so that the communication device (1) or the bit rate adaptation device (6) is designed to carry out the method according to one of claims 1-19.

22. Communication device according to claim 20 or 21, so that the communication device (1) is a mobile radio transmission device, in particular a UMTS mobile radio transmission device,

23. Communication device, so that the communication device is designed to receive and evaluate a bit stream processed by another communication device according to the method according to one of claims 1-19 and subsequently sent to the communication device.