WO2003067779A1 - Procede, systeme, programme informatique comportant des moyens de code programme et produit-programme informatique pour produire un signal de communication multiplexe a partir de plusieurs signaux de communication par la technologie cdma (acces multiple par code de repartition) - Google Patents

Procede, systeme, programme informatique comportant des moyens de code programme et produit-programme informatique pour produire un signal de communication multiplexe a partir de plusieurs signaux de communication par la technologie cdma (acces multiple par code de repartition) Download PDF

Info

Publication number
WO2003067779A1
WO2003067779A1 PCT/DE2003/000307 DE0300307W WO03067779A1 WO 2003067779 A1 WO2003067779 A1 WO 2003067779A1 DE 0300307 W DE0300307 W DE 0300307W WO 03067779 A1 WO03067779 A1 WO 03067779A1
Authority
WO
WIPO (PCT)
Prior art keywords
communication signal
code
codes
communication signals
multiplexed
Prior art date
Application number
PCT/DE2003/000307
Other languages
German (de)
English (en)
Inventor
Josef Scharinger
Franz Pichler
Dieter SCHÜTT
Original Assignee
Siemens Aktiengesellschaft
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 Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Priority to AU2003206652A priority Critical patent/AU2003206652A1/en
Publication of WO2003067779A1 publication Critical patent/WO2003067779A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/16—Code allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0074—Code shifting or hopping

Definitions

  • the invention relates to a multiplexing method, or multiplexing for short, of several communication signals according to a code division multiple access (CDMA) technique.
  • CDMA code division multiple access
  • Multiplex concepts such as an FDMA (Frequency Division Multiple Access), a TDMA (Time Division Multiple Access) [1] or a CDMA (Code Division Multiple Access, [2], [3]) play because of the immense increase in communication traffic play a major role in establishing communication services for fixed or mobile communication participants using radio systems, such as so-called wireless personal communication services.
  • FDMA Frequency Division Multiple Access
  • TDMA Time Division Multiple Access
  • CDMA Code Division Multiple Access, [2], [3]
  • the FDMA and the TDMA, the CDMA, multiplexing based on orthogonal codes is also suitable for concentrating the communication traffic with regard to a radio transmission system.
  • a typical implementation in mobile subscriber networks is in the form of a DS-SS-CDMA (Direct Sequence Spread Spectrum CDMA) for radio transmission between mobile subscribers and base stations (up-link connection) and back (down-link connection) (Fig. l).
  • DS-SS-CDMA Direct Sequence Spread Spectrum CDMA
  • a code assigned to a message channel to be multiplexed or a message stream to be multiplexed remains constant during the multiplexing in a message connection.
  • the one to be transferred Message flow is thus "spread" from symbol to symbol ("high” and "low” values) in the same way.
  • the usual DS-SS-CDMA is usually narrowband CDMA (narrow band CDMA), a data rate of communication signals to be transmitted in a kilobit / sec range using a code, the length of which is equal to the length of a message symbol (periodic CDMA ) is [2], is generated.
  • narrowband CDMA narrow band CDMA
  • code the length of which is equal to the length of a message symbol (periodic CDMA ) is [2]
  • Such a DS-SS-CDMA is also known from [3], namely a CDMA from Qualcom for mobile telephony, a finite orthogonal system of 64 Walsh functions being used as the code.
  • a CDMA clearly seen as a coded multiple, provides security with regard to a function of the signal transmission, i.e. functional safety (safety) guaranteed.
  • the invention is therefore based on the object of specifying a multiplex method and a corresponding multiplex arrangement, by means of which a far-reaching security than that which is achieved in the known CDMA (safety) is made possible.
  • This task is performed by the multiplex method and the multiplex arrangement as well as by the computer program with program code means and the computer program product for generating a multiplexed communication signal with the paint solved according to the respective independent claim.
  • a code for coding the respective communication signal is assigned to the communication signals.
  • the communication signals are each encoded using the code assigned to the respective communication signal and multiplexed to form the multiplexed communication signal.
  • the codes assigned to the respective communication signals are changed during the multiplexing.
  • the arrangement for generating a multiplexed communication signal from a plurality of communication signals using a code division multiple access (CDMA) technique with codes for communication signal coding has a multiplex unit which is set up in such a way that a code for coding the respective communication signal can be assigned to each of the communication signals and the communication signals can each be coded using the code assigned to the respective communication signal and multiplexed to form the multiplexed communication signal, the codes assigned to the respective communication signals being changeable during multiplexing.
  • CDMA code division multiple access
  • the invention represents a so-called code hopping in analogy to a known frequency hopping.
  • the codes assigned to the respective communication signals or message channels during multiplexing for example with each Message bit of a communication signal or message stream changed.
  • This change in the assigned codes can be implemented by changing the respective codes themselves and / or also by changing the code assignment or the assignment of the code words to the message channels or message streams to be transmitted.
  • the subsequent coding of the communication signals using the code assigned to the respective communication signal is carried out in accordance with the CDMA technique (spreading code).
  • the inventive multiplexing method or code hopping enables a message to be transmitted in addition to security, the function relating to (safety), security relating to the message (security).
  • the computer program according to the invention with program code means is set up to carry out all steps according to the multiplex method according to the invention when the program is executed on a computer.
  • the computer program product with program code means stored on a machine-readable carrier is set up to carry out all steps according to the multiplex method according to the invention when the program is executed on a computer.
  • the arrangement and the computer program with program code means set up to carry out all steps according to the inventive multiplex method when the program is on a computer is executed, and the computer program product with program code means stored on a machine-readable carrier, configured to carry out all steps according to the inventive method, if the program is executed on a computer, are particularly suitable for carrying out the method according to the invention or one of its further training explained below.
  • the invention or any further development described below can also be implemented by a computer program product which has a storage medium on which the computer program with program code means which carries out the invention or further development is stored.
  • the change in the codes allocated in accordance with the invention can be changed by changing the respective codes themselves and / or also by changing the code assignment, ie the assignment of once generated (or again and again generated) codes or the assignment of code words once generated the to- transmitting message channels or message streams can be realized.
  • the changed assignment of the codes i.e. a variable code assignment can be generated by permuting the codes.
  • a set of codes to be assigned can be generated by each code permutation generated.
  • Message security can be increased if the creation of a code permutation is carried out by an iterative scrambling process with several iteration steps.
  • the number of iteration steps when generating a code permutation can be made dependent on a desired degree of scrambling or mixing.
  • the Kolmogoroff system To increase the security of the message (security), it is advantageous to initialize the Kolmogoroff system by means of a random parameter or key, for example by means of a random sequence of a predeterminable number of values, i.e. generate or set a permutation depending on this parameter.
  • This parameter or this random sequence can be generated using a random generator, which itself also initializes again using a random key can be.
  • random generators are known in principle and are used for example in the context of cryptology for stream encryption.
  • the codes are changed during the multiplexing after a predeterminable number of message bits of a communication signal, for example after every message bit.
  • the invention or its further development are particularly suitable for use in the context of a DS-SS-CDMA transmission method, which can thereby be improved with regard to message security.
  • FIG. 1 shows a sketch of a DS-SS-CDMA transmission system (DS-SS-CDMA module);
  • Figure 2 is a sketch of a DS-SS-CDMA transmission system
  • Figure 3 is a sketch describing an application of a Kolmogoroff system
  • FIG. 4 shows a sketch which describes the implementation of permutations using discrete Kolmogoroff systems
  • Figure 5 is a sketch describing an initial situation when generating key-dependent permutations.
  • FIG. 2 digital multi-channel CDMA code hopping transmission system
  • the digital multi-channel CDMA code hopping transmission system described below (Fig. 2) (short code hopping) is a component of a communication system and is based on an architecture of a known DS-SS-CDMA transmission system [2], [3] (Fig.l).
  • code hopping was chosen from analogy to the known frequency hopping. Since the CDMA can be seen as a generalization of the TDMA and FDMA, code hopping can be seen analogously to time scrambling and frequency scrambling of signals, both methods that are traditionally used in cryptography to disguise analog signals.
  • 1 shows a conventional DS-SS-CDMA transmission system or module 100, in which in a message connection a code a (spreading code) allocated to a message channel (x) 101 to be multiplexed or a message stream (x) 101 to be multiplexed ) 102 remains constant or unchanged during the multiplexing.
  • the message stream (x) 101 is thus "spread" from symbol to symbol ("high” and "low” values) in the same way.
  • the assignment of the codes or the assignment of the code words to the message channels or message streams to be transmitted is changed during the multiplexing with each message bit of a message stream during code hopping.
  • the codes generated during code hopping are permuted to implement the code changes.
  • the generation of the codes and their permutation is an important part of code hopping. In the code hopping described, this is achieved using a method based on discrete Kolmogoroff systems.
  • This method guarantees the generation of a large number of permutations used for code hopping with a corresponding cryptological quality. It should be noted that any other corresponding methods that generate permutations can be used.
  • Point 1. to be taken into account is fulfilled as described below by providing an effective generation principle for a sequence of permutations, the Kolmogoroff permutations.
  • Point 2. to be taken into account is fulfilled by means of a pseudo random generator, such as those of a known type used for cryptology for stream encryption.
  • the receiving part of the communication system there is a structure corresponding to the transmitting part with a corresponding mode of operation, ie the receiving part has the same random generator, which then has the same side on the receiver side Initialization - the same permutations and codes as generated by the transmitter.
  • the individual message streams are then “reconstructed” from a transmitted total signal y using these codes generated at the receiver. This is done in accordance with the known CDMA technology.
  • pseudo-random generators of high cryptological quality and their construction are sufficiently well known and can therefore be used by a person skilled in the art to implement a pseudo-random generator that can be used in the context of code hopping.
  • FIG. 2 shows the block diagram of an SD-SS-CDMA transmission system with code hopping 200.
  • the permutator P 205 to be constructed and described below is able to safely and efficiently generate permutations on 64 elements. With 64 elements, 64! generate different permutations. It should be noted that the permutator P 205 described below can be extended to permutations for other than 64 element permutations.
  • the permutator P 205 is required to provide a new permutation of the 64 values (0 to 63) as output in each step.
  • the pseudo-random generator (pseudo-noise generator PRG) 206 delivers byte values pi, P2, ⁇ ⁇ -, k in a pseudo-stochastic manner as a function of a key, in this case the initial value K 207, is to be for - Ensure that the permutations generated meet all requirements for pseudo-random permutations.
  • the initial value K for the reconstruction of the message signals is to be transmitted there by the receiver. In order to meet security requirements, the initial value is transmitted encrypted.
  • Kolmogoroff systems can be seen as permutation operators on the unit square. Through iterative stretching, upsetting and folding, they are able to mix them perfectly and thus guarantee confusion and diffusion.
  • Fig. 3 illustrates this way of working (300, 301 to 306).
  • 301 shows an initial occupancy of the unit square.
  • 302 to 306 shows successive iterative applications of a Kolmogoroff transfer function to the initially occupied unit square 301.
  • 301 to 306 shows how the unit square 301 is first broken down into vertical strips, these strips are stretched horizontally and compressed vertically and finally folded over one another. After just a few applications, the underlying data is completely mixed.
  • this process of stretching, compressing and folding the unit square E can be specified as follows:
  • F denotes defined by + Pi-i the left boundary of the vertical stripe that contains the point (x, y) eE to be transformed.
  • the family of continuous Kolmogoroff systems T ⁇ has an infinite number of members, each of which can guarantee confusion and diffusion of the underlying state space.
  • Code hopping uses a discrete implementation that is limited to subsets that only have integer stretching and compression factors and in which the mapping rule is modified.
  • the step is chosen randomly, that is, in the described code hopping the parameter p is generated pseudo-stochastically from the key K, it can be shown that the associated discrete Kolmogoroff system with the side length n is erodic and mixing after iteration of 4 * log2n steps is.
  • the modification of the mapping ensures that integer positions are bijectively assigned to each other in nxn and the mapping remains invertible.
  • n 8 by one byte (8 parameter bits).
  • the parameter is the pseudo-stochastic byte value p, which is made available in each step depending on the key K by the pseudo-noise generator PRG. In this case there are 55 different valid partitions ⁇ .
  • all 55 partitions can be permanently stored in a list.
  • the assignment of a parameter p with a value between 0 and 55 is then carried out by means of an indexed access to the list at the column p, the modulo 55 being used for indexing.
  • the value represented thereby in the range from 0 to 3 specifies the index for the entry to be selected in the list of dividers, this indexing having to be done modulo of the length of the list of dividers.
  • FIG. 5 shows an initial state 400 or 500 of a work field 500.
  • a distribution of the values 0 to 63 501 in this is completely arbitrary and has no significance for the quality of the permutations generated.
  • Each step t 401 and t 401 each round is the consequence of the application of a transformation Tg ⁇ .delta.t 402 and a subsequent cyclic shift 403 of the 8x8 data field to the offset 3. In this case, data which would be shifted out of the field, on the other Ring end pushed back into the field.
  • This processing within a round t 401 can be carried out iteratively several times depending on a desired degree of mixing.
  • the number of iterations can be selected to be lower.
  • each round is initialized by new byte values p.
  • the permutator P implemented in this way delivers a pseudo-random permutation in each step depending on byte values p.
  • CDMA Code Division Multiple Access

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Selon l'invention, des codes sont associés respectivement à des signaux de communication pour coder chaque signal de communication. Chaque signal de communication est codé au moyen du code qui lui a été associé, puis les différents signaux sont multiplexés pour former le signal de communication multiplexé. Pendant le multiplexage, les codes associés respectivement aux différents signaux de communication sont modifiés par permutation des codes par un procédé de Kolmogoroff.
PCT/DE2003/000307 2002-02-06 2003-02-04 Procede, systeme, programme informatique comportant des moyens de code programme et produit-programme informatique pour produire un signal de communication multiplexe a partir de plusieurs signaux de communication par la technologie cdma (acces multiple par code de repartition) WO2003067779A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2003206652A AU2003206652A1 (en) 2002-02-06 2003-02-04 Method, system, and computer program with program code means and computer program product for generating a multiplexed communication signal from several communication signals by using code division multiple access (cdma) technology

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE10204876.2 2002-02-06
DE10204876 2002-02-06

Publications (1)

Publication Number Publication Date
WO2003067779A1 true WO2003067779A1 (fr) 2003-08-14

Family

ID=27674566

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2003/000307 WO2003067779A1 (fr) 2002-02-06 2003-02-04 Procede, systeme, programme informatique comportant des moyens de code programme et produit-programme informatique pour produire un signal de communication multiplexe a partir de plusieurs signaux de communication par la technologie cdma (acces multiple par code de repartition)

Country Status (2)

Country Link
AU (1) AU2003206652A1 (fr)
WO (1) WO2003067779A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6457847A (en) * 1987-08-27 1989-03-06 Gen Res Electronics Inc Code hopping type multiplex spread spectrum communication system
GB2350759A (en) * 1999-05-29 2000-12-06 Roke Manor Research Mobile Telecommunications Systems
WO2001011897A2 (fr) * 1999-08-05 2001-02-15 Korea Advanced Institute Of Science And Technology Procede et appareil de multiplexage de canaux de communication par sauts de codes orthogonaux
US20020097703A1 (en) * 2000-10-27 2002-07-25 Nieczyporowicz Leon L. Spreading code hopping for synchronous DS-CDMA system to mitigate interference effects

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6457847A (en) * 1987-08-27 1989-03-06 Gen Res Electronics Inc Code hopping type multiplex spread spectrum communication system
GB2350759A (en) * 1999-05-29 2000-12-06 Roke Manor Research Mobile Telecommunications Systems
WO2001011897A2 (fr) * 1999-08-05 2001-02-15 Korea Advanced Institute Of Science And Technology Procede et appareil de multiplexage de canaux de communication par sauts de codes orthogonaux
US20020097703A1 (en) * 2000-10-27 2002-07-25 Nieczyporowicz Leon L. Spreading code hopping for synchronous DS-CDMA system to mitigate interference effects

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
JUNG-HYUN CHOI ET AL: "A fast cell search algorithm using code block CPM in asynchronous W-CDMA system", IEEE 52ND VEHICULAR TECHNOLOGY CONFERENCE, BOSTON, MA, USA, vol. 1, 24 September 2000 (2000-09-24) - 28 September 2000 (2000-09-28), pages 280 - 285, XP010525177 *
PATENT ABSTRACTS OF JAPAN vol. 013, no. 268 (E - 775) 20 June 1989 (1989-06-20) *
UNAL B ET AL: "Capacity improvement by code-hopping in S-CDMA systems", COMMUNICATIONS, 1998. ICC 98. CONFERENCE RECORD. 1998 IEEE INTERNATIONAL CONFERENCE ON ATLANTA, GA, USA 7-11 JUNE 1998, NEW YORK, NY, USA,IEEE, US, 7 June 1998 (1998-06-07), pages 989 - 993, XP010284731, ISBN: 0-7803-4788-9 *

Also Published As

Publication number Publication date
AU2003206652A1 (en) 2003-09-02

Similar Documents

Publication Publication Date Title
DE69832589T2 (de) Sender und Übertragungsverfahren, die die Flexibilität der Zuordnung von Koden erhöhen
DE69825171T2 (de) Verfahren und vorrichtung zur erzeugung eines bitstromverschlüsselungsschlüssels
DE602004009020T2 (de) Verfahren und System zur Bereitstellung von Kommunikationssicherheit
DE602005002632T2 (de) Schlüsselmaskierung für kryptographische Prozesse mittels einer Kombination von Zufallsmaskenwerten
DE69533086T2 (de) Kodierung für mehrfach-zugriff unter verwendung limitierter sequenzen für mobile radio nachrichtenübertragung
DE60037463T2 (de) Ratenanpassung und Kanalverschachtelung für ein Kommunikationssystem
DE69731470T2 (de) Spiral-verwürfelungsverfahren
DE60124588T2 (de) Hybride spreizband-technik zur erweiterung der kanalkapazität
DE4423209C2 (de) Verfahren zum Durchführen einer Punkt-zu-Punkt-Kommunikation bei abhörsicheren Kommunikationssystemen
DE69936593T2 (de) Geschlitzte modus kode nutzung in einem zellularen kommunikationssystem
DE60111746T2 (de) Lineartransformation für symmetrische verschlüsselungssysteme
CH660822A5 (de) Zufallsprimzahlen-erzeugungsmittel in einer mit oeffentlichem schluessel arbeitenden daten-verschluesselungsanlage.
DE3237489A1 (de) Stromchiffrierung unter verwendung einer chiffrieranlage mit oeffentlichem schluessel
DE10027216A1 (de) Vorrichtung und Verfahren zum Modulieren einer Datennachricht durch Verwendung von Codes mit orthogonalem veränderlichem Spreizungsfaktor (OVSF) in einem Mobilkommunikationssystem
DE60017845T2 (de) Minimierung der diskontinuierlichen Übertragung in einem Mobiltelekommunikationssystem
DE69835080T2 (de) Schnelle Datenübertragung unter Verwendung einer mehrzahl von langsameren Kanälen
DE60016561T2 (de) Blockverschachtelung für turbokodierung
DE2840552C2 (de) Digitales Übertragungssystem
EP1236287A1 (fr) Reduction du rapport valeur de crete/valeur moyenne et du rayonnement hors bande dans des systemes de modulation multiplex par repartition en code
DE60027006T2 (de) Verfahren und vorrichtung zur sicheren übertragung verteilter authentisierungsabfragewerte (rand) zur anwendung bei der authentifizierung einer mobilstation
WO2000057562A1 (fr) Transmission de donnees avec entrelacement puis adaptation de debits par perforation ou repetition
DE69835087T2 (de) Empfängerarchitektur für ein Mehrfachverwürfelkode CDMA Übertragungsverfahren
DE10359268B4 (de) Vorrichtung zum Erzeugen von Sendesignalen in einer Mobilfunkstation mittels eines Verwürfelungscode-Generators für Präambeln und für Sendesignale dedizierter physikalischer Kanäle
WO2003067779A1 (fr) Procede, systeme, programme informatique comportant des moyens de code programme et produit-programme informatique pour produire un signal de communication multiplexe a partir de plusieurs signaux de communication par la technologie cdma (acces multiple par code de repartition)
DE10250939B4 (de) DSSS und CCK-Basisband-Codierungsgerät und Verfahren

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP