Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04J—MULTIPLEX COMMUNICATION
  • H04J13/00—Code division multiplex systems
  • H04J13/10—Code generation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04J—MULTIPLEX COMMUNICATION
  • H04J13/00—Code division multiplex systems
  • H04J13/0007—Code type
  • H04J13/004—Orthogonal
  • H04J13/0048—Walsh

Definitions

• the invention relates to both code sequences and radio stations, in particular mobile stations or base stations, which are set up to use code sequences accordingly.
• UMTS Universal Mobile Telecommunications System
• Enhanced-Up-Link is a focus of these development and standardization activities.
• Enhanced-Up-Link increased data rates are to be made available for the connection from a mobile station to a base station.
• the Enhanced Up Link Dedicated Channel Hybrid (ARQ Indicator Channel) and E-RGCH (Enhanced Up Link Dedicated Channel Relative Grant Channel) signaling channels are in the direction from the base station provided to the mobile station.
• E-HICH an "ACK: Acknowledge” or a “NACK: Not-Acknowlegde” is signaled to the mobile station, depending on whether a packet was received correctly by the base station or not.
• the E-RGCH signals to the mobile station whether it is allowed to transmit at a higher, equal or lower data rate.
• the data, in particular data bits, which are sent via said signaling channels, in particular via the same radio channel, to different mobile stations are spread for subscriber separation with a code sequence, also called a signature sequence.
• Enhanced-Up-Link channel relates to data transmission from the mobile station to the base station
• said signaling channels, E-HICH and E-RGCH describe the direction from the base station to various mobile stations.
• the invention is therefore based on the problem to provide a technical teaching that allows efficient implementation of said signaling channels.
• the invention is based initially on the idea to use code sequences that are orthogonal to each other.
• This has the advantage that a receiver (for example a mobile station) which correlates with its code sequence to a received signal sequence which is not intended for it, ideally receives no correlation signal. Therefore, in a first step, the use of code sequences which form the lines of a Hadamard matrix proves to be advantageous, since the lines of a Hadamard matrix are mutually orthogonal.
• Hadamard matrices are defined in particular as matrices with size 1 elements whose rows are mutually orthogonal and whose columns are mutually orthogonal. In the context of the application, however, the term "Hadamard matrix" is more generally intended to describe all matrices with elements of size 1 whose rows are mutually orthogonal.
• the Hadamard matrix originally proposed for UMTS is the Hadamard matrix used by default. It has the property that in the first column are all one's. It can now happen that the same signal is sent to all (or almost all) mobile stations (subscribers or subscriber stations). On the E-HICH, the mobile stations are informed whether they are allowed to increase their data rate or have to lower it.
• the base station will typically command all (or at least quite a few) mobile stations to lower the data rate to reduce the congestion as quickly as possible , Then (almost) all sequences (code sequences) are multiplied by the same value, added up element by element and then sent (in UMTS before yet another spread with the spreading factor 128 performed, but this is not relevant to the invention).
• This high transmit power or column sum requires correspondingly powerful transmit amplifiers, which are then only needed for a short time. So there would be an inefficient and unnecessarily expensive implementation.
• Another aspect of the invention is therefore the recognition to use for the realization of the above signaling channels code sequences whose orthogonality to each other is not affected as possible even in the presence of a frequency error. Therefore, a set of code sequences, in particular of length 40, should be given for which that the code sequences are mutually orthogonal and that the maximum of
• the invention thus aims to provide code matrices that result in low power maximums when using the lines of a corresponding code matrix in the sense mentioned above. Furthermore, the lines of the code matrix when used as code sequences (signature sequences) should also have good orthogonality properties in the case of frequency errors.
• the first goal can be achieved by multiplying individual lines of the (output) Hadamard matrix by -1. Multiplying a line means that each element of this line is multiplied by -1. This does not change the orthogonality properties: the rows of a matrix are orthogonal if the scalar product of all pairs of rows is 0. The scalar product of a line multiplied by -1 is equal to -1 times the original scalar product and thus 0 if and only if the original scalar product is also 0. Therefore, a matrix is too then orthogonal if one or more rows are multiplied by -1.
• This matrix has a column sum of 4 in the first column, otherwise 0.
• the modified matrix has the sum 2 in all columns. This matrix is therefore ideal for signaling because the maximum amplitude during transmission is reduced by a factor of 2 (from 4 to 2).
• the transmission power is thus reduced by a factor of 4 or 6dB.
• any other matrix can also be obtained by multiplying lines with -1 from the original matrix only have even column totals.
• a Williamson matrix in the sense of this invention consists of blocks of elementary matrices, the elementary matrices containing lines with cyclic permutation.
• the Williamson matrix is thus the following matrix, with the individual blocks of 5 highlighted:
• a Hadamard matrix of length 40 is then formed according to the standard construction:
• the matrix consists of blocks of 5x5 matrices, which are cyclic permutations of 5-element sequences. It is now desirable to preserve this property while still optimizing the column sums. This property of being constructed of cyclic blocks can be obtained if the multiplications with -1 are always applied to such blocks.
• This table shows a matrix of the block column sum in the first 8 columns. The total column totals are then the sums of the block column sums, multiplied by -1 if necessary, when a row block has been multiplied by -1. The last row of the table contains the column sums that result when no row block is multiplied by -1.
• the columns contain the values with which the corresponding row blocks must be multiplied.
• the first (left) column stands for the first (o- burst) line block.
• the last column shows an index. If you read it as a binary number, the positions correspond to a number of line blocks that are multiplied by a -1.
• the solutions with the indices 6, 24 and 96 are further distinguished by the fact that only two row blocks with -1 multiples and that these line blocks are also adjacent. Then only one block of 10 lines has to be multiplied by -1. For example, for index 6 solution, lines 5 through 14 must be multiplied by -1 (using the convention of numbering the rows of the matrix from 0 through 39).
• Line interchanges do not necessarily have to be taken into account when defining the matrix: Line interchanges mean that the lines are assigned to the connections in a different order. However, this assignment of the lines to individual connections and in particular the selection of the lines which are used for a given utilization of the system is anyway freely selectable in the configuration of the connections through the network.
• code matrices which result from the use of one or more of these operations of code matrices according to the invention and their use according to the invention are, of course, likewise within the scope of the invention.
• these operations can be used to optimize other properties of the matrices. Since column swaps do not affect the distribution of the column sums, it is also possible to improve the distribution of the column sums by multiplying the same rows by -1 for these frequency error optimized matrices as well as for the non-frequency error optimized matrix. So you can combine both optimizations.
• This code matrix has maximum secondary correlations of 2.7 at a frequency error of 200 Hz compared to a value of 8.3 achieved using a conventional code matrix. This means a suppression for the reception of broadcasts for other mobile stations of about 9.5 dB.
• the maximum side correlation results from the worst sequence pair (code string pairs) of the code matrix, where a sequence of one row corresponds to the code matrix. If we denote the elements of the matrix with x (i, k), where i is the row index and k is the column index, then one computes the secondary correlation values NC of two rows (code sequences) a and b (a ⁇ b) by means of its scalar product taking into account the frequency error as follows:
• NC (a, b) abs ( ⁇ x (a, k) x (b, k) exp (j * 2 * ⁇ * k * T * f)) k
• the optimization presented so far is particularly advantageous if the bits (or +1, -1) generated by the spreading are transmitted in chronological succession. This corresponds to the so-called BPSK modulation.
• QPSK modulation it is also possible to transmit two binary values at the same time. In this case, one binary value is transmitted by means of the I component (real part, in-phase component) and the second by means of the Q component (immaginar component, out-of-phase component) of a complex symbol. If the signals are superimposed for several mobile stations, the corresponding complex symbols are added, ie the I and Q components are added together. The power at a certain point in time then results from the power of the complex symbol, which is proportional to the sum of the squares of the I and Q components.
• the patterns respectively denote the values (+1 or -1) with which the corresponding rows of the matrix are multiplied. These values are multiplied by the corresponding lines of the frequency-optimized matrix.
• This matrix is an optimized matrix, whereby it was achieved by swapping columns that the maximum of the cross-correlations with frequency errors is as small as possible:
• a corresponding other code matrix results using the second pattern.
• radio stations in particular base stations and mobile stations, which are suitably set up to use code sequences according to the invention, in particular for the realization or transmission of the above-mentioned signaling channels.
• the data bits to be transmitted via these signaling channels can be multiplied (spread) by the transmitter side for better separability with the code sequences according to the invention.
• the receiver can correlate a code sequence according to the invention with the received signals for better separation of the received signals, ie form correlation sums and further process them accordingly.
• the formation of the correlation sums for example, as described below, by the calculation of the received signal E.
• One way of further processing is then, for example, to compare the signal strength with a threshold.
• the receiver knows that its assigned sequence (code sequence) has been received and evaluates the information.
• the information content of the received signal is an ACK or NACK of the base station to the mobile station in response to a data packet transmitted from the mobile station to the base station on the E-DCH.
• the information ACK or NACK can be signaled by the sign of the received signal E.
• Figure 1 is a simplified representation of an up-link or down-link connection
• Figure 2 is a code matrix
• FIG. 3 shows a simulation result
• FIG. 1 shows two (enhanced uplink) data channels EU0 and EU1 from two mobile stations MS0 and MS1 to a base station BS of a UMTS system.
• the signaling channels E-HICHO and E-HICHl Enhanced Up Link Dedicated Channel Hybrid ARQ Indicator Channel
• E-RGCHO and E-RGCHl Enhanced Up Link Dedicated Channel Relative Grant Channel
• the data bits to be transmitted via these signaling channels become different code sequences on the transmitter side (base station side) impressed.
• the radio stations are hardware-technically, for example by suitable receiving and / or transmitting devices or by suitable processor devices, and / or software so arranged that for the transmission of data code sequences according to the invention are used, in particular data to be transmitted multiplied by a code sequence according to the invention be (spread) or received signals are correlated with a code sequence according to the invention.
• a base station has a transmitting device for transmitting data to different subscribers and a processor device which is set up such that data directed to different subscribers are impressed on different code sequences, the code sequences being taken from a code matrix by the following steps available is:
• a mobile station has a receiving device for receiving a received signal sequence and a processor device which is set up in such a way that the received signal sequence is correspondingly correlated with one of the above-mentioned code sequences.
• the received signal E is when the transmitter transmits the sequence (code sequences) s and the receiver correlates to the sequence (code sequence) e:
• f denotes the value of the frequency error
• T the duration of one bit.
• the calculation is complex.
• the i-th symbol is transmitted at the time T times i. Strictly speaking, this is only the case if the bits are transmitted serially in succession. It is also possible, for example, to transmit two bits in parallel at the same time, for example by using a so-called IQ multiplex method, ie in a complex transmission signal the one bit is transmitted as a real part and the other as an imaginary part.
• transmissions affect each other, ie when data is sent to a mobile station on the basis of the code sequence s, this interferes with the reception at the mobile station, which expects data on the basis of the code sequence e. This disturbance is minimized by the present invention.
• the aim of the invention is therefore also to provide a method for generating such sequences and the use of these sequences for purposes of transmission.
• Hadamard matrices of length 20 are known, from which can be generated with this rule matrices of length 40, 80, 160 ....
• FIG. 3 shows the distribution of the correlations in the case of frequency errors, namely for the prior art (UMTS) and the presented method with the improved column interchange (opt) shown above (grouping even and odd columns).
• the frequency error was assumed to be 200 Hz.
• the size of the cross-correlations is plotted on the y-axis, they are sorted by size. The x-axis thus corresponds to the number of the pair for which the cross correlation was calculated, this number being assigned to a pair so that the pairs are sorted according to the amount of their cross-correlation.
• the distribution (ann) of the correlation sums when using a code matrix optimized in this way is now fairly balanced and in particular contains no peak at the maximum.
• the distribution approximates the theoretical ideal course (Theo.), In which all secondary lines have the same value. In this case, every correlation sum would be 1.53. However, this ideal case is practically unattainable because of the large number of theoretically possible correlation pairs. The optimization can, however, achieve a value that comes very close to this value for practical application.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Mobile Radio Communication Systems (AREA)
• Developing Agents For Electrophotography (AREA)
• Radio Relay Systems (AREA)
• Photoreceptors In Electrophotography (AREA)
• Error Detection And Correction (AREA)
• Detection And Correction Of Errors (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=36143420

Family Applications (1)

Country Status (13)

Families Citing this family (4)

Family Cites Families (14)

• 2005
  • 2005-02-15 DE DE102005006893A patent/DE102005006893B4/de active Active
• 2006
  • 2006-02-06 UA UAA200709280A patent/UA94577C2/ru unknown
  • 2006-02-06 MX MX2007008824A patent/MX2007008824A/es not_active Application Discontinuation
  • 2006-02-06 CN CN200680004948.8A patent/CN101120528B/zh active Active
  • 2006-02-06 EP EP06708025A patent/EP1849250A1/de not_active Withdrawn
  • 2006-02-06 EA EA200701747A patent/EA011917B1/ru unknown
  • 2006-02-06 WO PCT/EP2006/050677 patent/WO2006087270A1/de active Application Filing
  • 2006-02-06 US US11/884,368 patent/US8542664B2/en active Active
  • 2006-02-06 CA CA2597656A patent/CA2597656C/en active Active
  • 2006-02-06 JP JP2007555574A patent/JP5274024B2/ja active Active
  • 2006-02-10 TW TW095104548A patent/TWI379530B/zh active
  • 2006-02-15 AR ARM060100529A patent/AR052375A4/es active IP Right Grant
• 2007
  • 2007-06-05 ZA ZA200704688A patent/ZA200704688B/xx unknown

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events