EP1836789A1 - Codefolge und funkstation - Google Patents
Codefolge und funkstationInfo
- Publication number
- EP1836789A1 EP1836789A1 EP05813363A EP05813363A EP1836789A1 EP 1836789 A1 EP1836789 A1 EP 1836789A1 EP 05813363 A EP05813363 A EP 05813363A EP 05813363 A EP05813363 A EP 05813363A EP 1836789 A1 EP1836789 A1 EP 1836789A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- matrix
- column
- code
- forms
- original
- 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.)
- Withdrawn
Links
Classifications
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
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.
- Enhanced-up-link is a focal point 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) signaling channels and Enhanced Up Link dedicated Channel Relative Grant Channel (E-RGCH) are provided in the direction from the base station 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.
- An essential aspect of the invention is therefore the knowledge to use code sequences for the realization of the above-mentioned signaling channels, the orthogonality of which is as far as possible unimpaired even in the presence of a frequency error.
- the subject matter of the invention is therefore also a set of code sequences, in particular of length 40, for which it holds that the code sequences are mutually orthogonal and that the maximum of
- code sequence which is described by a line of a code matrix, the code matrix being obtainable by the following steps: Forming a Hadamard matrix of length n; Swapping columns of the Hadamard matrix.
- the columns would be in the order (0, 1, 2, 3, 4, 5, 6, 7) in the
- FIG. 4 shows, using the example of a matrix with 8 columns, the permutation achieved by this operation. Column interchange.
- This operation in the context of this invention, is called "combing.” It is somewhat similar to a so-called pharaoh mixture, also known as the Weber mix in England, where the cards are split into two equal stacks Cards mixed together, alternately using a card from one stack and the other (see Martin Gardner: Kopf oder Zahl, Paradoxa und mathematische Knobeleien, 1978, Spektrum dermaschine Verlagsgesellschaft mbH & Co., Weinheim, pages 144-145) Strictly speaking, a pharaoh mixture differs slightly from the operation of combing: Typically, you start by mixing with the top two cards of the two stacks and use it to build up the new, mixed stack, bringing those two cards to the bottom of the new stack. The pharaoh mixture is thus a combing combined with a reversal of the order of the
- de-combing The combing inverse operation (here called "de-combing") is the following operation:
- n columns of the Hadamard matrix from 0 to n-1; - Grouping of the columns in even-numbered columns (0, 2, 4, ... n-2) and in odd-numbered columns (1, 3, 5, ..., n-1);
- Odd-numbered columns form the last n / 2 columns of the code matrix. This type of column interchange can also lead to improved code matrices.
- this code matrix has maximum secondary correlations of 2, 7 compared to a value of 8, 3, which is achieved using a conventional code matrix. This means a suppression for the reception of transmissions for other mobile stations of approx. 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 the secondary correlation values NC of two rows (code sequences) a and b (a ⁇ b) are calculated by means of their scalar product, taking the frequency error into account follows:
- radio stations in particular base stations and mobile stations, which are suitably set up, code sequences according to the invention, in particular for the realization or.
- 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.
- a code sequence according to the invention can be correlated with the received signals, ie. H . Form correlation sums and process them accordingly.
- the education 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 resp. 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
- Figure 4 is an illustration of the column swap operation of combing for the example of a matrix of Figure 8
- Figure 5 is an illustration of the column swap operation Block Inversion for the example of an 8-column matrix
- Figure 6 is an illustration of the column swap operation block shift for the example of an 8-column matrix
- Figure 7 is an illustration of the column interchange operation of the block combing for the example of an 8-column matrix
- Fig. 8 is an illustration of the column swap operation of the block de-combing for the example of an 8-column matrix
- Figure 9 is an illustration of a simple column swap operation for the example of an 8-column matrix
- FIG. 10 shows a code matrix
- FIG. 11 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-RGCH1 Enhanced Up Link Dedicated Channel Relative Grant Channel
- the signaling channels implemented by the base station BS to the mobile stations MSO MS1 within a radio channel (same time and frequency resource) separable on the receiver side for the different mobile stations MSO, MSl, the data bits to be transmitted via these signaling channels become different code sequences on the transmitter side (base station side) imprinted.
- the radio stations are hardware technology, for example, by suitable receiving and / or transmitting devices or by suitable processor devices, and / or software so arranged that are used for the transmission of data code sequences according to the invention, in particular data to be transmitted with an inventive Code sequence are multiplied (spread) or received signals are correlated with a code sequence according to the invention.
- Variable Spreading Factor Orthogonal Variable Spreading Factor sequences because UMTS is a CDMA system.
- this spreading takes place only at the symbol level, ie a very short time interval, so that this spread has only a negligible influence on the frequency error characteristics and is therefore mentioned here only for the sake of completeness.
- a base station has a transmitting device for transmitting data to different subscribers and a processor device which is set up in such a way that data directed to different subscribers is impressed on different code sequences, the code sequences of a Code matrix, which is obtainable by the following steps:
- the code sequences are taken from a code matrix obtainable by the following steps (combing): grouping of the columns in columns of the first half (1, 2,..., N / 2-1) and in columns of the second half (n / 2, n / 2 + 1, ..., n-1) with odd number (1, 3, 5, ..., n-1);
- the code sequences are taken from a code matrix which is obtainable by the following steps (decombining):
- 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:
- C (s, i) represents the i-th element of the code sequence used on the transmitting side
- C (e, i) represents the i-th element of the code sequence used on the receiving side
- f denotes the value of the frequency error
- T is 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.
- I-Q multiplex method i. H . in a complex transmission signal, one bit is transmitted as a real part and the other as an imaginary part.
- emissions affect each other, d. H .
- data When data is sent to a mobile station on the basis of the code string s, it disturbs the reception at the mobile station which expects data on the basis of the code string e. This disturbance is minimized by the present invention.
- the above-mentioned influence should be as small as possible for the worst pair of sequences.
- 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 ....
- a column interchange which has been found to be particularly advantageous in simulations, is the following one (he algorithm is described here for the convention that the columns are counted starting with 0 (not 1), but of course can also be used for other numbering Customize conventions):
- a Hadamard matrix of length 2n is generated by replacing all elements of the Hadamard matrix of length 2n with the elementary 2-integer Hadamard matrix multiplied by the value of the element, d. H . you replace in the matrix
- 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 C20 is thus the following matrix, with the individual blocks of 5 highlighted:
- C and D are Hadamard matrices
- C and D are Hadamard matrices
- code matrices can be further optimized by the above-mentioned column commutation steps, in particular combing.
- FIG. 3 shows the distribution of the correlations in the case of frequency errors, specifically for the prior art
- code matrices have been described which result from aliasing operations from a Hadamard matrix.
- column swapping operations were performed before and / or after doubling the length of an output Hadamard matrix.
- the most common column swapping operations have been described as "combing”, “combing out” and “simple column exchanges”.
- Block inversion You can reverse the order for a block of columns, that is, a set of consecutive columns. From a column arrangement 0, 1, 2, 3, 4, 5, 6, 7 is obtained by block inversion of the block of columns 3 to 6, the permutation 0, 1, 2, 6, 5, 4, 3, 7. This example shown in FIG. This is also a good operation: the contribution of a block to the total correlation remains the same in this operation, but the sign is reversed. This one can possibly. achieve that the value of the correlation is better compensated by the negative contribution of the inverted block, i. H . that the contributions of the remaining columns are better compensated.
- Block shift You can move a block of columns so that this block is in a different position. From a column arrangement 0, 1, 2, 3, 4, 5, 6, 7 is obtained by moving the block of columns 5 to 6 to the point 1, the permutation 0, 5, 6, 1, 2, 3, 4, 7 ( Figure 6). This is also a good operation: the contribution of a block to the total correlation remains the same in this operation (considering the amount as a complex value), but moving the complex value rotates an amount equal to that Frequency error corresponds to the shift. As a side effect, moving a block also moves other blocks of columns because the moved block displaces other columns at its new location. shifts. Also, the contribution to the correlation of this implicitly shifted
- combing is a valuable operation to influence the correlation sum.
- combing was done for the entire matrix, ie for all columns of the matrix. leads .
- it can also be applied to only one subarea: one chooses a block of columns and performs the operation only on this subarea. From a column arrangement 0, 1, 2, 3, 4, 5, 6, 7 is obtained by combing the block of columns 0 to 5, the permutation
- This code matrix is obtainable from the 40s matrix C 40 , which is formed by the following formation law from the matrix C 20 mentioned above:
- column no. 28 the original matrix C '40 is the column number. 0, the column no. 21 of the original matrix to the column no. 1, etc. The columns are numbered consecutively from 0 to 39 again.
- the resulting matrix has maximum secondary correlations of 2, 7 with a frequency error of 200 Hz, which is comparable to the value of the original matrix of 8, 3. This means a suppression for the reception of transmissions for other mobile stations of approx. 9, 5 dB.
- 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.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE200510001149 DE102005001149A1 (de) | 2005-01-10 | 2005-01-10 | Codefolge und Funkstation |
DE102005005695.4A DE102005005695B4 (de) | 2005-02-08 | 2005-02-08 | Codefolge und Funkstation |
PCT/EP2005/056438 WO2006072517A1 (de) | 2005-01-10 | 2005-12-02 | Codefolge und funkstation |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1836789A1 true EP1836789A1 (de) | 2007-09-26 |
Family
ID=35789205
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP05813363A Withdrawn EP1836789A1 (de) | 2005-01-10 | 2005-12-02 | Codefolge und funkstation |
Country Status (2)
Country | Link |
---|---|
EP (1) | EP1836789A1 (de) |
WO (1) | WO2006072517A1 (de) |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6724741B1 (en) * | 1998-06-29 | 2004-04-20 | L-3 Communications Corporation | PN code selection for synchronous CDMA |
US6091760A (en) * | 1998-06-29 | 2000-07-18 | L-3 Communications Corporation | Non-recursively generated orthogonal PN codes for variable rate CDMA |
US6125378A (en) * | 1999-01-13 | 2000-09-26 | Barbano; Paolo Emilio | Method and apparatus for generating families of code signals using multiscale shuffling |
-
2005
- 2005-12-02 EP EP05813363A patent/EP1836789A1/de not_active Withdrawn
- 2005-12-02 WO PCT/EP2005/056438 patent/WO2006072517A1/de active Application Filing
Non-Patent Citations (2)
Title |
---|
ERICSSON: "E-HICH/E-RGCH SIGNATURE SEQUENCES", TSG RAN WG1 #39, XX, XX, no. R1-041421, 15 November 2004 (2004-11-15), pages 1 - 4, XP002375434 * |
See also references of WO2006072517A1 * |
Also Published As
Publication number | Publication date |
---|---|
WO2006072517A1 (de) | 2006-07-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE60111299T2 (de) | Zuweisungsverfahren für einen physikalischen Kanal in einem mobilen Kommunikationssystem und Kommunikationsverfahren dafür | |
DE69833382T2 (de) | Verfahren zur erzeugung von quasi-orthogonalen koden und spreizer dafür in einem mobilen kommunikationssystem | |
DE69914108T2 (de) | System und verfahren zur steuerung von zufälligen zugriffen | |
DE69737974T2 (de) | Zusätzliche hochratige Übertragungskanäle für CDMA Kommunikationssystem | |
DE60038520T2 (de) | Verschlüsselungskodes und Kanalisierungskodes für Signale mit mehreren Chipraten in einem CDMA zellularen Mobilfunkkommunikationssystem | |
DE3527329A1 (de) | Digitales funkuebertragungssystem mit variabler zeitschlitzdauer der zeitschlitze im zeitmultiplexrahmen | |
DE20023092U1 (de) | Vorrichtung zur Erzeugung von Verwürfelungscode in einem UMTS-Mobilkommunikationssystem | |
DE1791135B2 (de) | Nachrichtenuebertragungssystem unter anwendung eines zeit- oder frequenz- multiplex-verfahrens | |
WO1993015574A1 (de) | Decodierung durch kreuzkorrelation einer durch zyklische verschiebung und invertierung codierten datenfolge | |
EP1618689B1 (de) | Verfahren, Sender und Empfänger zur Übertragung von Daten in einem CDMA-System mittels vollständig komplementären Codematrizen zur Zweidimensionalen Spreizung der Daten in Frequenz- und Zeit-Richtung | |
DE102005006893B4 (de) | Funkstation und Verfahren zur Übertragung von Daten | |
DE102005005696B4 (de) | Verfahren und Funkstation zur Übertragung von Daten | |
DE102005005695B4 (de) | Codefolge und Funkstation | |
EP1836789A1 (de) | Codefolge und funkstation | |
EP1391133B1 (de) | Verfahren zur zuweisung von kanälen in einem funk-kommunikationssystem, basisstationssystem, teilnehmerstation und funk-kommunikationssystem | |
EP1844622B1 (de) | Verfahren zur gruppierung und zuweisung von funkressourcen in einem multicarrier-system | |
WO2006072516A1 (de) | Codefolge und funkstation | |
DE69901276T2 (de) | Multirate, Multikode CDMA Übertragung für ein zellulares Mobilfunksystem | |
EP1584151A1 (de) | Verfahren zum übertragen eines daten-worts | |
EP1566024B1 (de) | Verfahren zum uebertragen von daten einer verbindung mit sich waehrend der bestehenden verbindung aendernder uebertragungsrate sowie entsprechende station | |
EP1469609B1 (de) | Funk-Übertragungsverfahren und Funk-Übertragungssystem | |
WO2006087268A1 (de) | Codefolge und funkstation | |
EP1512232B1 (de) | Verfahren und system zur steuerung der sendeleistung von gruppennachrichten unterschiedlicher gruppen | |
EP1629621B1 (de) | Verfahren und tester zum bestimmen einer fehlerrate eines mobilfunkgeräts bei variabler blockzuordnung | |
DE10065238A1 (de) | Funkbetriebenes Telekommunikatonssystem |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20070712 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SIEMENS AKTIENGESELLSCHAFT |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SIEMENS AKTIENGESELLSCHAFT |
|
17Q | First examination report despatched |
Effective date: 20150612 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SIEMENS AKTIENGESELLSCHAFT |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN |
|
18W | Application withdrawn |
Effective date: 20171020 |