US20130100965A1 - System and method for spread spectrum communication - Google Patents

System and method for spread spectrum communication Download PDF

Info

Publication number
US20130100965A1
US20130100965A1 US13/668,495 US201213668495A US2013100965A1 US 20130100965 A1 US20130100965 A1 US 20130100965A1 US 201213668495 A US201213668495 A US 201213668495A US 2013100965 A1 US2013100965 A1 US 2013100965A1
Authority
US
United States
Prior art keywords
spreading
codes
section
inverse
signal
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.)
Abandoned
Application number
US13/668,495
Inventor
Shinichiro Ohmi
Yasuo Harada
Kazuhiro Ando
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
InterDigital Patent Holdings Inc
Original Assignee
Panasonic Corp
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 Panasonic Corp filed Critical Panasonic Corp
Priority to US13/668,495 priority Critical patent/US20130100965A1/en
Publication of US20130100965A1 publication Critical patent/US20130100965A1/en
Assigned to INTERDIGITAL PATENT HOLDINGS, INC. reassignment INTERDIGITAL PATENT HOLDINGS, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: PANASONIC CORPORATION
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J1/00—Frequency-division multiplex systems
    • H04J1/02—Details
    • H04J1/08—Arrangements for combining channels
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation

Definitions

  • This invention relates to a system and a method for spread spectrum communication for spreading an input signal over a wide frequency band for communication.
  • orthogonal codes such as Walsh codes, Hadamard codes, and Gold codes, or PN (Pseudorandom Noise) codes are used as spreading codes.
  • PN Pseudorandom Noise
  • Japanese Patent No. 2929244 discloses two types of PN codes for use as the spreading codes
  • Japanese Patent Publication No. 6-91509 discloses codes generated by combining two or more types of PN codes for use as the spreading codes.
  • spreading codes orthogonal to each other on the time axis are used.
  • the spreading codes used for conventional spread spectrum communication are orthogonal to each other only on the time axis, and the electric power characteristics of a spread signal are not uniform on the frequency axis. Therefore, in the conventional spread spectrum communication, transmission characteristics and multiplexing capacity have certain limitations.
  • an object of the present invention is to provide a spread spectrum communication system and a spread spectrum communication method that are superior to conventional ones in transmission characteristics and multiplexing capacity.
  • the present invention has the following aspects.
  • a first aspect of the present invention is directed to a communication system for carrying out spread spectrum communication, including:
  • the different channel identification codes are subjected to inverse Fourier transform, and the resultant codes are used as spreading codes.
  • these spreading codes are subjected to Fourier transform, absolute values of the resultant elements are constant. Therefore, with the use of such spreading code for spreading, the input signal is spread with uniform power on the frequency axis.
  • Such spectrum spreading with uniform power on the frequency axis improves transmission characteristics and increases multiplexing capacity.
  • each element of the spreading code stored in the first storage section is a complex number
  • each element of the inverse spreading code stored in the second storage section is a complex number
  • the input signal is spread by using the spreading code whose elements are complex numbers
  • the spread signal is inversely spread by using the inverse spreading code whose elements are complex numbers.
  • the communication system further includes a modulating section for carrying out quadrature modulation of a carrier by using the signal outputted from the spreading section, and
  • the carrier is subjected to quadrature modulation by using the real part and the imaginary part of the spread signal, and the modulated carrier is then subjected to quadrature demodulation.
  • the carrier is subjected to quadrature modulation by using the real part and the imaginary part of the spread signal, and the modulated carrier is then subjected to quadrature demodulation.
  • each element of the inverse spreading code stored in the second storage section is a conjugate complex number of a corresponding element of the spreading code stored in the first storage section.
  • the spread signal is inversely spread by using the inverse spreading code which is the conjugate number of the spreading code.
  • the coordinate axis which was rotated by a predetermined amount at the time of spreading can be returned to its original position at the time of inverse spreading.
  • the communication system further includes a filter section for outputting low-frequency components of a signal outputted from the inverse spreading section.
  • the communication system further includes a synchronization tracking section for finding a synchronization point for the inverse spreading code stored in the second storage section by detecting a peak point of a signal outputted from the inverse spreading section.
  • the synchronization point of the spread signal can be found by the receiving apparatus.
  • the input signal supplied to the spreading section is a complex number composed of a real part and an imaginary part.
  • the seventh aspect it is possible to transmit an input signal subjected to baseband modulation in the QPSK (Quadrature Phase Shift Keying) scheme, the 16 QAM (Quadrature Amplitude Modulation) scheme, or the like.
  • QPSK Quadadrature Phase Shift Keying
  • 16 QAM Quadadrature Amplitude Modulation
  • the channel identification codes are numerical value sequences of orthogonal codes.
  • the channel identification codes are numerical value sequences of Walsh codes.
  • the channel identification codes are numerical value sequences of Hadamard codes.
  • the channel identification codes are numerical value sequences of Gold codes.
  • the numerical value sequence obtained by multiplying the orthogonal code by the M-sequence is subjected to inverse Fourier transform.
  • inverse Fourier transform it is possible to find spreading codes orthogonal to each other on the frequency axis. Also, it is possible to randomize a bit pattern of the channel identification codes.
  • the channel identification codes are numerical value sequences obtained by adding or inserting a predetermined number of zero values at a same position in different numerical value sequences.
  • the numerical value sequence obtained by adding or inserting a predetermined number of zero values at the same position in different numerical value sequences is subjected to inverse Fourier transform.
  • inverse Fourier transform when the spread signal is transformed on the frequency axis, it is possible to free up a frequency band as an unused frequency band.
  • a guard band can be provided between two spread signals on the frequency axis, thereby simplifying the construction of the filter of the receiving apparatus for extracting a required band.
  • a carrier hole can be provided on the frequency axis, thereby preventing another system from interfering with a carrier of the frequency band.
  • a fourteenth aspect of the present invention is directed to a transmitting apparatus for spread spectrum communication.
  • the transmitting apparatus includes:
  • a transmitting apparatus for carrying out spectrum spreading with uniform power on the frequency axis can be structured.
  • the transmission characteristics are improved, and multiplexing capacity is increased.
  • a fifteenth aspect of the present invention is directed to a receiving apparatus for spread spectrum communication.
  • the receiving apparatus includes:
  • a receiving apparatus for carrying out spectrum spreading with uniform power on the frequency axis can be structured.
  • the transmission characteristics are improved, and multiplexing capacity is increased.
  • a sixteenth aspect of the present invention is directed to a communication method for carrying out spread spectrum communication.
  • the method includes the steps of:
  • a seventeenth aspect of the present invention is directed to a transmitting method for spread spectrum communication.
  • the transmitting method includes the steps of:
  • An eighteenth aspect of the present invention is directed to a receiving method for spread spectrum communication.
  • the receiving method includes the steps of:
  • FIG. 1 is a block diagram illustrating the configuration of a communication system according to an embodiment of the present invention
  • FIG. 2 is an illustration showing a process of generating spreading codes in the communication system according to the embodiment of the present invention
  • FIG. 3 is an illustration showing one example of channel identification codes and spreading codes in the communication system according to the embodiment of the present invention.
  • FIG. 4 is an illustration showing a detailed configuration of the communication system according to the embodiment of the present invention.
  • FIG. 5 is an illustration showing one example of transmission characteristics of the communication system according to the embodiment of the present invention.
  • FIGS. 6A-6C are a block diagrams showing other configurations of the spreading code generating apparatus according to the embodiment of the present invention.
  • FIG. 1 is a block diagram illustrating the configuration of a communication system according to one embodiment of the present invention.
  • the communication system includes a transmitting apparatus 20 and a receiving apparatus 30 , between which spread spectrum communication is carried out.
  • a spreading code generating apparatus 10 generates spreading codes 121 to be used in the transmitting apparatus 20 and an inverse spreading codes 131 to be used in the receiving apparatus 30 .
  • the spreading code generating apparatus 10 includes an orthogonal code generating section 11 , an M-sequence generating section 12 , a multiplier 13 , a zero value adding section 14 , and an inverse Fourier transforming section 15 .
  • the transmitting apparatus 20 includes a spreading code storage section 21 , a spreading section 22 , a filter section 23 , an RF (Radio Frequency) modulating section 24 , and an antenna 25 .
  • the receiving apparatus 30 includes an antenna 31 , an RF demodulating section 32 , an inverse spreading code storage section 33 , an inverse spreading section 34 , a filter section 35 , and a synchronization tracking section 36 .
  • the orthogonal code generating section 11 generates an orthogonal code that includes a predetermined number of vectors having a predetermined length and containing elements each indicating 1 or ⁇ 1. Examples of such orthogonal codes are Hadamard codes, Walsh codes, and Gold codes.
  • the M-sequence generating section 12 generates an M-sequence (maximum length sequence) having the same length as the vector generated by the orthogonal code generating section 11 and containing elements each indicating 1 or ⁇ 1.
  • an m-stage shift register is used to find an M-sequence having a length of (2 m ⁇ 1), and the found M-sequence is repeated as required.
  • the multiplier 13 multiplies, element by element, each vector included in the orthogonal codes generated by the orthogonal code generating section 11 by the M sequence generated by the M-sequence generating section 12 .
  • a vector of an orthogonal code generated by the orthogonal code generating section 11 is (A 1 , A 2 , . . . , A n ) and the M-sequence generated by the M-sequence generating section 12 is (B 1 , B 2 , . . . , B n ).
  • the multiplier 13 outputs (A 1 B 1 , A 2 B 2 , . . . , A n B n ) as a product of both elements.
  • This M-sequence multiplication is to randomize a bit pattern of the channel identification code, which is described further below.
  • the zero value adding section 14 adds a predetermined number of zero values to the head and the tail of each vector outputted from the multiplier 13 .
  • the zero value adding section 14 may add one or more zero values to either one or both of the head and the tail of each vector.
  • the number of zero values to be added to the head may be equal to the number added to the tail, or may be different therefrom.
  • This zero value addition is to provide a guard area between two spread signals transformed on the frequency axis, thereby simplifying the structure of a filter of the receiving apparatus 30 for extracting a required band.
  • the zero-value-added vectors are different from each other, and therefore are used as channel identification codes for spread spectrum communication.
  • the inverse Fourier transforming section 15 carries out inverse Fourier transform of each channel identification code obtained by the zero value adding section 14 to find a vector having the same number of elements as the original vector.
  • a group formed by the found vectors is called “a vector group”.
  • the elements of each vector after inverse Fourier transform become complex numbers. All or part of the vectors included in the vector group obtained by the inverse Fourier transforming section 15 are used by the transmitting apparatus 20 as spreading codes 121 . Further, the elements of the found vectors are replaced with their respective conjugate complex numbers, thereby obtaining inverse spreading codes 131 to be used by the receiving apparatus 30 .
  • the orthogonal code generating section 11 generates, for example, a Hadamard code each including sixteen vectors having a length of 16 (a vector group VG, illustrated in FIG. 2 ).
  • the M-sequence generating section 12 generates, for example, an M-sequence having a length of 16 such as (1, ⁇ 1, 1, 1, ⁇ 1, 1, 1, ⁇ 1, 1, ⁇ 1, ⁇ 1, 1, ⁇ 1, 1, ⁇ 1, ⁇ 1).
  • the multiplier 13 multiplies, element by element, the respective elements of the sixteen vectors generated by the orthogonal code generating section 11 by the M-sequence generated by the M-sequence generating section 12 to output a vector group VG b illustrated in FIG. 2 .
  • the zero value adding section 14 adds two zero values to each of the sixteen vectors outputted from the multiplier 13 both at the head and the tail to output a vector group including sixteen vectors having a length of 20 (a vector group VG c illustrated in FIG. 2 ).
  • the vectors included in the vector group VG C are used as the channel identification codes.
  • the inverse Fourier transforming section 15 carries out inverse Fourier transform of the sixteen channel identification codes obtained by the zero value adding section 14 .
  • FIG. 3 is an illustration showing one example of the channel identification codes and the spreading codes in the spreading code generating apparatus 10 .
  • FIG. 3 illustrates how a vector V c1 illustrated in FIG. 2 is transformed to a vector V d1 illustrated in FIG. 2 through inverse Fourier transform.
  • the inverse transforming section 15 carries out inverse Fourier transform of the respective sixteen channel identification codes to obtain a vector group including sixteen vectors each having a length of 20 and containing elements being complex numbers (a vector group VG d illustrated in FIG. 2 ).
  • All or part of the sixteen vectors included in the vector group VG d are used by the transmitting apparatus 20 as the spreading codes 121 .
  • the elements of the found vectors are replaced with their respective conjugate complex numbers, thereby obtaining the inverse spreading codes 131 to be used by the receiving apparatus 30 .
  • the transmitting apparatus 20 and the receiving apparatus 30 are supplied with the spreading codes 121 and the inverse spreading codes 131 , respectively, by the spreading code generating apparatus 10 .
  • the spreading codes 121 supplied by the spreading code generating apparatus 10 are stored in the spreading code storage section 21 .
  • the inverse spreading codes 131 supplied by the spreading code generating apparatus 10 are stored in the inverse spreading code storage section 33 .
  • the spreading codes 121 and the inverse spreading codes 131 may be stored in the respective storage sections at the time of manufacturing, or may be supplied through input means or communication means after manufacturing. Note that the number of codes stored by the spreading code storage section 21 and the inverse spreading code storage section 22 may be one, respectively.
  • the spreading code storage section 21 selects one spreading code 122 from the stored spreading codes 121 for output.
  • the inverse spreading code storage section 33 selects one inverse spreading code 132 from the stored spreading codes 131 for output.
  • the spreading code storage section 21 outputs, as the spreading code 122 corresponding to a channel to be used, a spreading code through inverse Fourier transform of a channel identification code for that channel.
  • the inverse spreading code storage section 33 outputs, as the inverse spreading code 132 corresponding to a channel to be used, an inverse spreading code obtained through inverse Fourier transform of a channel identification code for that channel.
  • the spreading section 22 is supplied with an input signal 201 as a signal to be transmitted.
  • the input signal 201 is a signal obtained by subjecting error correction encoding and predetermined baseband modulation to data to be transmitted.
  • the spreading section 22 spreads the input signal 201 with the spreading code 122 stored in the spreading code storage section 21 , and then outputs a spread signal 202 .
  • the spreading section 22 is supplied with the elements of the spreading code 122 at every time interval T 2 , which is shorter than a time interval T 1 during which the input signal 201 is changed.
  • the spreading section 22 multiplies the input signal 201 by each element of the spreading code 122 at every time interval T 2 . Such multiplication of each element of the spreading code at every time interval T 2 is generally called “multiplication of the spreading code at a chip rate”.
  • the filter section 23 is implemented by using a band-pass filter.
  • the filter section 23 eliminates noise components included in an unwanted band from the spread signal 202 outputted from the spreading section 22 .
  • the RF modulating section 24 carries out quadrature modulation of a carrier with a signal outputted from the filter section 23 , and outputs a signal of a radio frequency.
  • the RF modulating section 24 modulates the carrier with the real part of the signal outputted from the filter section 23 to a first direction, and also modulates the carrier with the imaginary part of the signal outputted from the filter section 23 to a second direction that is different from the first direction in phase by 90 degrees.
  • the antenna 25 emits a radio wave based on the signal outputted from the RF modulating section 24 .
  • the antenna 31 receives the radio wave emitted from the transmitting apparatus 20 , and outputs a signal of a radio frequency.
  • the RF demodulating section 32 carries out orthogonal demodulation of the signal emitted from the antenna 31 to output a baseband signal as a demodulated signal 301 .
  • the RF demodulating section 32 demodulates the signal emitted from the antenna 31 in the above-mentioned first direction to find the real part and also in the above-mentioned second direction to find the imaginary part, and then outputs the demodulated signal 301 in complex number form.
  • the inverse spreading section 34 uses the inverse spreading code 132 stored in the inverse spreading code storage section 33 to carry out inverse spreading of the demodulated signal 301 , and then outputs the inverse spread signal 302 .
  • the inverse spreading section 34 carries out complex multiplication of the demodulated signal 301 and the inverse spreading code 132 at the chip rate. That is, the inverse spreading section 34 carries out complex multiplication of the demodulated signal 301 and each element of the inverse spreading code 132 at every time interval T 2 . For example, consider a case where an element of the inverse spreading code 132 is a complex number (C ⁇ Dj) and the demodulated signal indicates a complex number (E+Fj).
  • the input signal 201 spread over the wide area on the frequency axis is converged to a specific frequency.
  • the filter section 35 is implemented by using a low-pass filter.
  • the filter section 35 eliminates noise components included in an unwanted band from the inverse spread signal 302 outputted from the inverse spreading section 34 , and outputs an output signal 303 .
  • the receiving apparatus 30 can produce the output signal 303 corresponding to the input signal 201 .
  • the output signal 303 is subjected to reverse processing (that is, baseband demodulation and decoding for error correction).
  • the synchronization tracking section 36 outputs a synchronizing signal 311 to the inverse spreading code storage section 33 .
  • the inverse spreading code storage section 33 outputs the inverse spreading code 132 to the inverse spreading section 34 in synchronization with the synchronizing signal 311 outputted from the synchronization tracking section 36 .
  • the synchronization tracking section 36 detects timing when the signal outputted from the inverse spreading section 34 becomes maximum in level (the timing is referred to as a peak point). With such operation of the synchronization tracking section 36 , the receiving apparatus 30 can find optimum timing for inverse spreading processing.
  • the receiving apparatus 30 may further include an AFC (Automatic Frequency Control) circuit for establishing synchronization in frequency with the transmitting apparatus 20 .
  • AFC Automatic Frequency Control
  • the spreading section 22 the RF modulating section 24 , the RF demodulating section 32 , the inverse spreading section 34 , the filter section 35 , and the synchronization tracking section 36 are illustrated in detail.
  • the input signal 201 has been baseband-modulated with the QPSK (Quadrature Phase Shift Keying) scheme is exemplarily described.
  • the spreading code 122 , the inverse spreading code 132 , the input signal 201 , and the demodulated signal 301 are all complex numbers.
  • the spreading code 122 is denoted as (C+Dj), the inverse spreading code 132 as (C ⁇ Dj), the input signal 201 as (A+Bj), and the demodulated signal 301 as (E+Fj).
  • a and B are 1 or ⁇ 1
  • C, D, and E are arbitrary real numbers.
  • the spreading section 22 includes four multipliers (first to fourth), a subtractor, and an adder.
  • the first multiplier finds a product AC of the real part A of the input signal 201 and the real part C of the spreading code 122 .
  • the other three multipliers find a product BD, a product AD, and a product BC, respectively.
  • the subtractor subtracts the product BD from the product AC to find a real part (AC ⁇ BD) of the spread signal 202 .
  • the adder adds the product AD and the product BC together to find an imaginary part (AD+BC) of the spread signal 202 .
  • the spreading section 22 outputs the real part and the imaginary part of the spread signal 202 separately.
  • the RF modulating section 24 includes two multipliers and an adder. One multiplier multiplies the real part of the spread signal 202 by an in-phase carrier (cosine wave), while the other multiplies the imaginary part of the spread signal 202 by an orthogonal carrier (sine wave).
  • the adder adds signals outputted from the two multipliers together.
  • the RF modulating section 24 outputs a single signal as a result of quadrature modulation of the carriers.
  • orthogonal carrier modulation is performed with four values (1, 1), (1, ⁇ 1), ( ⁇ 1, 1), and ( ⁇ 1, ⁇ 1). In the present embodiment, however, values other than the above four values can be used for orthogonal carrier modulation.
  • the RF demodulating section 32 includes two multipliers and two low-pass filters (denoted as LPF in FIG. 4 ).
  • the signal outputted from the RF modulating section 24 is divided into two in the RF demodulating section 32 .
  • One multiplier multiplies one of the divided signals by the in-phase carrier (cosine wave), while the other multiplier multiplies the other by the orthogonal carrier (sine wave).
  • the two low-pass filters respectively eliminate noise components included in an unwanted band from the signals outputted from the two multipliers.
  • the demodulated signal 301 corresponding to the spread signal 202 is produced.
  • the RF demodulating section 32 outputs the real part and the imaginary part of the demodulated signal 301 separately.
  • the inverse spreading section 34 includes four multipliers (first to fourth), a subtractor, and an adder.
  • the first multiplier finds a product EC of the real part E of the demodulated signal 301 and the real part C of the inverse spreading code 132 .
  • the other three multipliers find a product ( ⁇ FD), a product ( ⁇ ED), and a product FC, respectively.
  • the subtractor subtracts the product ( ⁇ FD) from the product EC to find a real part (EC+FD) of the inverse spread signal 302 .
  • the adder adds the product ( ⁇ ED) and the product FC together to find an imaginary part ( ⁇ ED+FC) of the inverse spread signal 302 .
  • the inverse spreading section 34 outputs the real part and the imaginary part of the inverse spread signal 302 separately.
  • the filter section 35 includes two accumulators. One accumulator accumulates the real part of the inverse spread signal 302 outputted from the inverse spreading section 34 for one data symbol of the input signal 201 , and outputs a real part A′ of the output signal 303 . Similarly, the other accumulator accumulates the imaginary part of the inverse spread signal 302 outputted from the inverse spreading section 34 for one data symbol of the input signal 201 , and outputs an imaginary part B′ of the output signal 303 . The filter section 35 outputs the real part and the imaginary part of the output signal 303 separately.
  • the synchronization tracking section 36 includes a correlation value calculating unit 37 and a peak detecting unit 38 .
  • the correlation value calculating unit 37 accumulates the inverse spread signal 302 for one data symbol of the input signal 201 , with the real part and the imaginary part of the inverse spread signal 302 being separate from each other. That is, the correlation value calculating unit 37 finds a complex number represented by ⁇ (EC+FD)+ ⁇ ( ⁇ ED+FC)j ⁇ (where ⁇ is a sum for one data symbol of the input signal 201 ). The correlation value calculating unit 37 then calculates an absolute value of the found complex number for output to the peak detecting unit 38 as a correlation value.
  • the peak detecting unit 38 outputs the synchronizing signal 311 to the inverse spreading code storage section 33 as appropriately changing output timing.
  • the correlation value outputted from the correlation value calculating unit 37 becomes maximum.
  • the peak detecting unit 38 detects, as a peak point, timing in which the correlation value outputted from the correlation value calculating unit 37 becomes maximum, and outputs the synchronizing signal 311 at the detected peak point.
  • the input signal 201 is assumed to have been baseband-modulated with the QPSK scheme. It is also possible, however, to construct a communication system similar in configuration to the system illustrated in FIG. 4 in a case where the input signal 201 has been baseband-modulated with another quadrature modulation scheme. For example, in a case where the input signal 201 has been baseband-modulated with 16 QAM (Quadrature Amplitude Modulation) scheme, the real part A and the imaginary part B of the input signal 201 can independently take four values. The detailed structure of each system component can be the same as that illustrated in FIG. 4 .
  • the spreading code generating apparatus 10 carries out M-sequence multiplication and zero value addition of the generated orthogonal codes to find channel identification codes, and then carries out inverse Fourier transform of the channel identification codes, thereby generating the spreading codes 121 and the inverse spreading codes 131 .
  • the transmitting apparatus 20 and the receiving apparatus 30 store the spreading codes 121 and the inverse spreading codes 131 , respectively, generated by the spreading code generating apparatus 10 , and use a single code respectively selected from the stored codes to carry out spread spectrum communication.
  • each orthogonal code generated by the spreading code generating apparatus 10 is orthogonal to each other. Since orthogonality is kept even after M-sequence multiplication and zero value addition, the channel identification codes obtained through these two processes are also orthogonal to each other. Moreover, since inverse Fourier transform is an orthogonal transform, the spreading codes obtained through inverse Fourier transform of the channel identification codes are orthogonal to each other. As such, by using spreading codes that are orthogonal to each other, the communication system according to the present embodiment can carry out spread spectrum communication as general spread spectrum communication systems using PN codes or the like.
  • vectors obtained through inverse Fourier transform of the channel identification codes containing elements of 1 or ⁇ 1 and orthogonal to each other are used as spreading codes. Therefore, when the spreading codes are subjected to Fourier transform, the elements obtained as a result of Fourier transform become 1 or ⁇ 1, and thus their absolute values are constant. Consequently, with the use of such spreading codes for spreading, the input signal is spread over a wide frequency band with uniform power on the frequency axis.
  • Such spectrum spreading with uniform power on the frequency axis improves transmission characteristics and increases multiplexing capacity, compared with a case of conventional spread spectrum communication not achieving uniform power on the frequency axis.
  • FIG. 5 is an illustration showing one example of transmission characteristics of the communication system according to the present embodiment.
  • a horizontal axis indicates an S/N ratio (signal-to-noise ratio), and a vertical axis indicates a bit error rate.
  • the transmission characteristics of the conventional art (denoted as a broken line) are observed when Hadamard codes each having a length of 16 are used as the spreading codes.
  • the transmission characteristics of the present embodiment (denoted as a solid line) are observed when the same Hadamard codes are inverse-Fourier-transformed and the resultant codes are used as the spreading codes.
  • a channel division scheme used is the CDMA (Code Division Multiple Access) scheme. As illustrated in FIG.
  • the bit error rate becomes larger.
  • the characteristics of the present embodiment are more advantageous than those of conventional art in that the bit error rate is smaller. Therefore, according to the communication system of the present embodiment, it is possible to increase multiplexing capacity in spread spectrum communication.
  • the spreading code generating apparatus 10 generates Hadamard codes as the orthogonal codes, and generates spreading codes based on the generated Hadamard codes.
  • Walsh codes, Gold codes, or other codes may be used as the orthogonal codes.
  • the spreading code generating apparatus 10 may generate channel identification codes that are different from each other, and may generate spreading codes based on the generated channel identification codes. In this case, absolute values of elements of the channel identification codes are preferably equal or approximately equal to each other. Still further, the channel identification codes do not necessarily have exact orthogonality, but may merely have characteristics so that an inner product of two vectors becomes closer to zero.
  • the spreading code generating apparatus 10 carries out M-sequence multiplication and zero value addition of the generated orthogonal codes. Alternatively, either or both of the two processes may not be carried out. With this, as illustrated in FIGS. 6A-6C , it is possible to construct a spreading code generating apparatus 17 ((a) of FIG. 6 ) that carries out inverse Fourier transform of the generated orthogonal codes; a spreading code generating apparatus 18 ((b) of FIG. 6 ) that carries out multiplication of the generated orthogonal codes, and the M-sequence and then inverse Fourier transform; and a spreading code generating apparatus 19 ((c) of FIG. 6 ) that adds zero values to the generated orthogonal codes and then carries out inverse Fourier transform.
  • These three types of spreading code generating apparatuses can achieve the same effects as those achieved by the spreading code generating apparatus 10 .
  • the spreading code generating apparatus 10 adds a predetermined number of zero values to the head and the tail of each vector outputted from the multiplier 13 .
  • a predetermined number of zero values may be inserted at the same position of each vector outputted from the multiplier 13 .
  • Such insertion of zero values at the same position of each vector can provide a carrier hole (unused frequency band) on the frequency axis, thereby preventing another system from interfering with a carrier on the frequency band.
  • the spreading code generating apparatus 10 may add or insert a predetermined number of zero values at the same position in each different numerical value sequence.
  • the transmitting apparatus 20 includes the RF modulating section 24 and the antenna 25
  • the receiving apparatus 30 includes the antenna 31 and the RF demodulating section 32
  • wireless communication is performed between the transmitting apparatus 20 and the receiving apparatus 30 .
  • wired communication is performed therebetween.
  • the transmitting apparatus 20 may not carry out RF modulation
  • the receiving apparatus 30 may not carry out RF demodulation.
  • the apparatus and method for spread spectrum communication uses vectors obtained by carrying out inverse Fourier transform of different channel identification codes (orthogonal codes, for example) to carry out spectrum spreading with uniform power on the frequency axis.
  • channel identification codes orthogonal codes, for example

Abstract

A spreading code generating apparatus carries out M-sequence multiplication and zero value addition of generated orthogonal codes to obtain channel identification codes, and then carries out inverse Fourier transform of the channel identification codes to generate spreading codes and inverse spreading codes. A transmitting apparatus and a receiving apparatus store the spreading codes and the inverse spreading codes generated by the spreading code generating apparatus, respectively, and use a single code respectively selected from the stored codes to carry out spread spectrum communication.

Description

    BACKGROUND OF THE INVENTION
  • 1. Technical Field
  • This invention relates to a system and a method for spread spectrum communication for spreading an input signal over a wide frequency band for communication.
  • 2. Background art
  • In conventional spread spectrum communication using Direct Sequence (DS) spreading schemes, orthogonal codes such as Walsh codes, Hadamard codes, and Gold codes, or PN (Pseudorandom Noise) codes are used as spreading codes. For example, Japanese Patent No. 2929244 discloses two types of PN codes for use as the spreading codes, and Japanese Patent Publication No. 6-91509 discloses codes generated by combining two or more types of PN codes for use as the spreading codes. As such, in the conventional spread spectrum communication, spreading codes orthogonal to each other on the time axis are used.
  • However, the spreading codes used for conventional spread spectrum communication are orthogonal to each other only on the time axis, and the electric power characteristics of a spread signal are not uniform on the frequency axis. Therefore, in the conventional spread spectrum communication, transmission characteristics and multiplexing capacity have certain limitations.
  • Therefore, an object of the present invention is to provide a spread spectrum communication system and a spread spectrum communication method that are superior to conventional ones in transmission characteristics and multiplexing capacity.
    • SUMMARY OF THE INVENTION
  • To achieve the object mentioned above, the present invention has the following aspects.
  • A first aspect of the present invention is directed to a communication system for carrying out spread spectrum communication, including:
      • a first storage section for storing a spreading code;
      • a second storage section for storing an inverse spreading code corresponding to the spreading code stored in the first storage section;
      • a spreading section for spreading an input signal using the spreading code stored in the first storage section; and
      • an inverse spreading section for inversely spreading a signal outputted from the spreading section, wherein
      • the spreading code stored in the first storage section is included in a vector group obtained by carrying out inverse Fourier transform of a plurality of different channel identification codes.
  • In the first aspect, the different channel identification codes are subjected to inverse Fourier transform, and the resultant codes are used as spreading codes. When these spreading codes are subjected to Fourier transform, absolute values of the resultant elements are constant. Therefore, with the use of such spreading code for spreading, the input signal is spread with uniform power on the frequency axis. Such spectrum spreading with uniform power on the frequency axis improves transmission characteristics and increases multiplexing capacity.
  • According to a second aspect of the present invention based on the first aspect, each element of the spreading code stored in the first storage section is a complex number, and each element of the inverse spreading code stored in the second storage section is a complex number,
      • the spreading section carries out complex multiplication of the input signal and each element of the spreading code stored in the first storage section, and
      • the inverse spreading section carries out complex multiplication of the signal outputted from the spreading section and each element of the inverse spreading code stored in the second storage section.
  • In the second aspect, the input signal is spread by using the spreading code whose elements are complex numbers, and the spread signal is inversely spread by using the inverse spreading code whose elements are complex numbers.
  • According to a third aspect of the present invention based on the second aspect, the communication system further includes a modulating section for carrying out quadrature modulation of a carrier by using the signal outputted from the spreading section, and
      • a demodulating section for carrying out quadrature demodulation of a signal outputted from the modulating section, and outputting the demodulated signal to the inverse spreading section.
  • In the third aspect, the carrier is subjected to quadrature modulation by using the real part and the imaginary part of the spread signal, and the modulated carrier is then subjected to quadrature demodulation. Thus, it is possible to reproduce the spread signal by the receiving apparatus.
  • According to a fourth aspect of the present invention based on the third aspect, each element of the inverse spreading code stored in the second storage section is a conjugate complex number of a corresponding element of the spreading code stored in the first storage section.
  • In the fourth aspect, the spread signal is inversely spread by using the inverse spreading code which is the conjugate number of the spreading code. Thus, the coordinate axis which was rotated by a predetermined amount at the time of spreading can be returned to its original position at the time of inverse spreading.
  • According to a fifth aspect of the present invention based on the first aspect, the communication system further includes a filter section for outputting low-frequency components of a signal outputted from the inverse spreading section.
  • In the fifth aspect, it is possible to produce an output signal corresponding to the input signal.
  • According to a sixth aspect of the present invention based on the first aspect, the communication system further includes a synchronization tracking section for finding a synchronization point for the inverse spreading code stored in the second storage section by detecting a peak point of a signal outputted from the inverse spreading section.
  • In the sixth aspect, the synchronization point of the spread signal can be found by the receiving apparatus.
  • According to a seventh aspect of the present invention based on the first aspect, the input signal supplied to the spreading section is a complex number composed of a real part and an imaginary part.
  • In the seventh aspect, it is possible to transmit an input signal subjected to baseband modulation in the QPSK (Quadrature Phase Shift Keying) scheme, the 16 QAM (Quadrature Amplitude Modulation) scheme, or the like.
  • According to an eighth aspect based on the first aspect, the channel identification codes are numerical value sequences of orthogonal codes.
  • According to a ninth aspect based on the first aspect, the channel identification codes are numerical value sequences of Walsh codes.
  • According to a tenth aspect based on the first aspect, the channel identification codes are numerical value sequences of Hadamard codes.
  • According to an eleventh aspect based on the first aspect, the channel identification codes are numerical value sequences of Gold codes.
  • In the eighth to eleventh aspects, by carrying out inverse Fourier transform of orthogonal codes, Walsh codes, Hadamard codes, or Gold codes, it is possible to find spreading codes orthogonal to each other on the frequency axis.
  • According to a twelfth aspect of the present invention based on the first aspect,
      • the channel identification codes are numerical value sequences obtained by multiplying numerical value sequences of orthogonal codes by an M-sequence.
  • In the twelfth aspect of the present invention, the numerical value sequence obtained by multiplying the orthogonal code by the M-sequence is subjected to inverse Fourier transform. Thus, it is possible to find spreading codes orthogonal to each other on the frequency axis. Also, it is possible to randomize a bit pattern of the channel identification codes.
  • According to a thirteenth aspect of the present invention based on the first aspect, the channel identification codes are numerical value sequences obtained by adding or inserting a predetermined number of zero values at a same position in different numerical value sequences.
  • In the thirteenth aspect, the numerical value sequence obtained by adding or inserting a predetermined number of zero values at the same position in different numerical value sequences is subjected to inverse Fourier transform. Thus, when the spread signal is transformed on the frequency axis, it is possible to free up a frequency band as an unused frequency band. In one example, by adding zero values at the head and the tail of each numerical value sequence, a guard band can be provided between two spread signals on the frequency axis, thereby simplifying the construction of the filter of the receiving apparatus for extracting a required band. In another example, by inserting zero values in the middle of each numerical value sequence, a carrier hole can be provided on the frequency axis, thereby preventing another system from interfering with a carrier of the frequency band.
  • A fourteenth aspect of the present invention is directed to a transmitting apparatus for spread spectrum communication. The transmitting apparatus includes:
      • a storage section for storing a spreading code; and
      • a spreading section for spreading an input signal by using the spreading code stored in the storage section, wherein
      • the spreading code is included in a vector group obtained by carrying out inverse Fourier transform of a plurality of different channel identification codes.
  • In the fourteenth aspect, a transmitting apparatus for carrying out spectrum spreading with uniform power on the frequency axis can be structured. By carrying out spectrum communication by using this transmitting apparatus and a receiving apparatus corresponding thereto, the transmission characteristics are improved, and multiplexing capacity is increased.
  • A fifteenth aspect of the present invention is directed to a receiving apparatus for spread spectrum communication. The receiving apparatus includes:
      • a storage section for storing an inverse spreading code corresponding to a spreading code; and
      • an inverse spreading section for inversely spreading a signal that has been spread with the spreading code, by using the inverse spreading code stored in the storage section, wherein
      • the spreading code is included in a vector group obtained by carrying out inverse Fourier transform of a plurality of different channel identification codes.
  • In the fifteenth aspect, a receiving apparatus for carrying out spectrum spreading with uniform power on the frequency axis can be structured. By carrying out spectrum communication by using this receiving apparatus and a transmitting apparatus corresponding thereto, the transmission characteristics are improved, and multiplexing capacity is increased.
  • A sixteenth aspect of the present invention is directed to a communication method for carrying out spread spectrum communication. The method includes the steps of:
      • spreading an input signal by using a spreading code;
      • transmitting the signal spread in the spreading step;
      • receiving the signal transmitted in the transmitting step; and
      • inversely spreading the signal received in the receiving step by using an inverse spreading code corresponding to the spreading code, wherein
      • the spreading code is included in a vector group obtained by carrying out inverse Fourier transform of a plurality of different channel identification codes.
  • A seventeenth aspect of the present invention is directed to a transmitting method for spread spectrum communication. The transmitting method includes the steps of:
      • spreading an input signal by using a spreading code; and
      • transmitting the signal spread in the spreading step, wherein
      • the spreading code is included in a vector group obtained by carrying out inverse Fourier transform of a plurality of different channel identification codes.
  • An eighteenth aspect of the present invention is directed to a receiving method for spread spectrum communication. The receiving method includes the steps of:
      • receiving a signal that has been spread with a spreading code; and
      • inversely spreading the signal received in the receiving step by using an inverse spreading code corresponding to the spreading code, wherein
      • the spreading code is included in a vector group obtained by carrying out inverse Fourier transform of a plurality of different channel identification codes.
    BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram illustrating the configuration of a communication system according to an embodiment of the present invention;
  • FIG. 2 is an illustration showing a process of generating spreading codes in the communication system according to the embodiment of the present invention;
  • FIG. 3 is an illustration showing one example of channel identification codes and spreading codes in the communication system according to the embodiment of the present invention;
  • FIG. 4 is an illustration showing a detailed configuration of the communication system according to the embodiment of the present invention;
  • FIG. 5 is an illustration showing one example of transmission characteristics of the communication system according to the embodiment of the present invention; and
  • FIGS. 6A-6C are a block diagrams showing other configurations of the spreading code generating apparatus according to the embodiment of the present invention.
    •  DETAILED DESCRIPTION OF THE INVENTION
  • FIG. 1 is a block diagram illustrating the configuration of a communication system according to one embodiment of the present invention. The communication system according to the present embodiment includes a transmitting apparatus 20 and a receiving apparatus 30, between which spread spectrum communication is carried out. Before communication is carried out, a spreading code generating apparatus 10 generates spreading codes 121 to be used in the transmitting apparatus 20 and an inverse spreading codes 131 to be used in the receiving apparatus 30. The spreading code generating apparatus 10 includes an orthogonal code generating section 11, an M-sequence generating section 12, a multiplier 13, a zero value adding section 14, and an inverse Fourier transforming section 15. The transmitting apparatus 20 includes a spreading code storage section 21, a spreading section 22, a filter section 23, an RF (Radio Frequency) modulating section 24, and an antenna 25. The receiving apparatus 30 includes an antenna 31, an RF demodulating section 32, an inverse spreading code storage section 33, an inverse spreading section 34, a filter section 35, and a synchronization tracking section 36.
  • First, the operation of the spreading code generating apparatus 10 is described. Before spread spectrum communication is carried out between the transmitting apparatus 20 and the receiving apparatus 30, the spreading code generating apparatus 10 operates as follows. The orthogonal code generating section 11 generates an orthogonal code that includes a predetermined number of vectors having a predetermined length and containing elements each indicating 1 or −1. Examples of such orthogonal codes are Hadamard codes, Walsh codes, and Gold codes.
  • The M-sequence generating section 12 generates an M-sequence (maximum length sequence) having the same length as the vector generated by the orthogonal code generating section 11 and containing elements each indicating 1 or −1. To generate an M-sequence having an arbitrary length, an m-stage shift register is used to find an M-sequence having a length of (2m−1), and the found M-sequence is repeated as required.
  • The multiplier 13 multiplies, element by element, each vector included in the orthogonal codes generated by the orthogonal code generating section 11 by the M sequence generated by the M-sequence generating section 12. Specifically, consider a case where a vector of an orthogonal code generated by the orthogonal code generating section 11 is (A1, A2, . . . , An) and the M-sequence generated by the M-sequence generating section 12 is (B1, B2, . . . , Bn). In this case, the multiplier 13 outputs (A1B1, A2B2, . . . , AnBn) as a product of both elements. This M-sequence multiplication is to randomize a bit pattern of the channel identification code, which is described further below.
  • The zero value adding section 14 adds a predetermined number of zero values to the head and the tail of each vector outputted from the multiplier 13. The zero value adding section 14 may add one or more zero values to either one or both of the head and the tail of each vector. When zero values are added to both the head and the tail of each vector, the number of zero values to be added to the head may be equal to the number added to the tail, or may be different therefrom. This zero value addition is to provide a guard area between two spread signals transformed on the frequency axis, thereby simplifying the structure of a filter of the receiving apparatus 30 for extracting a required band. The zero-value-added vectors are different from each other, and therefore are used as channel identification codes for spread spectrum communication.
  • The inverse Fourier transforming section 15 carries out inverse Fourier transform of each channel identification code obtained by the zero value adding section 14 to find a vector having the same number of elements as the original vector. A group formed by the found vectors is called “a vector group”. The elements of each vector after inverse Fourier transform become complex numbers. All or part of the vectors included in the vector group obtained by the inverse Fourier transforming section 15 are used by the transmitting apparatus 20 as spreading codes 121. Further, the elements of the found vectors are replaced with their respective conjugate complex numbers, thereby obtaining inverse spreading codes 131 to be used by the receiving apparatus 30.
  • With reference to FIG. 2, the operation of the spreading code generating apparatus 10 is exemplarily described. The orthogonal code generating section 11 generates, for example, a Hadamard code each including sixteen vectors having a length of 16 (a vector group VG, illustrated in FIG. 2). The M-sequence generating section 12 generates, for example, an M-sequence having a length of 16 such as (1, −1, 1, 1, −1, 1, 1, −1, 1, −1, −1, 1, −1, 1, −1, −1). The multiplier 13 multiplies, element by element, the respective elements of the sixteen vectors generated by the orthogonal code generating section 11 by the M-sequence generated by the M-sequence generating section 12 to output a vector group VGb illustrated in FIG. 2. The zero value adding section 14 adds two zero values to each of the sixteen vectors outputted from the multiplier 13 both at the head and the tail to output a vector group including sixteen vectors having a length of 20 (a vector group VGc illustrated in FIG. 2). The vectors included in the vector group VGC are used as the channel identification codes.
  • The inverse Fourier transforming section 15 carries out inverse Fourier transform of the sixteen channel identification codes obtained by the zero value adding section 14. FIG. 3 is an illustration showing one example of the channel identification codes and the spreading codes in the spreading code generating apparatus 10. FIG. 3 illustrates how a vector Vc1 illustrated in FIG. 2 is transformed to a vector Vd1 illustrated in FIG. 2 through inverse Fourier transform. The inverse transforming section 15 carries out inverse Fourier transform of the respective sixteen channel identification codes to obtain a vector group including sixteen vectors each having a length of 20 and containing elements being complex numbers (a vector group VGd illustrated in FIG. 2). All or part of the sixteen vectors included in the vector group VGd are used by the transmitting apparatus 20 as the spreading codes 121. The elements of the found vectors are replaced with their respective conjugate complex numbers, thereby obtaining the inverse spreading codes 131 to be used by the receiving apparatus 30.
  • Next, the operations of the transmitting apparatus 20 and the receiving apparatus 30 are described. Before communication is carried out, the transmitting apparatus 20 and the receiving apparatus 30 are supplied with the spreading codes 121 and the inverse spreading codes 131, respectively, by the spreading code generating apparatus 10. In the transmitting apparatus 20, the spreading codes 121 supplied by the spreading code generating apparatus 10 are stored in the spreading code storage section 21. In the receiving apparatus 30, the inverse spreading codes 131 supplied by the spreading code generating apparatus 10 are stored in the inverse spreading code storage section 33. The spreading codes 121 and the inverse spreading codes 131 may be stored in the respective storage sections at the time of manufacturing, or may be supplied through input means or communication means after manufacturing. Note that the number of codes stored by the spreading code storage section 21 and the inverse spreading code storage section 22 may be one, respectively.
  • For communication between the transmitting apparatus 20 and the receiving apparatus 30, the spreading code storage section 21 selects one spreading code 122 from the stored spreading codes 121 for output. Similarly, the inverse spreading code storage section 33 selects one inverse spreading code 132 from the stored spreading codes 131 for output. In more detail, the spreading code storage section 21 outputs, as the spreading code 122 corresponding to a channel to be used, a spreading code through inverse Fourier transform of a channel identification code for that channel. The inverse spreading code storage section 33 outputs, as the inverse spreading code 132 corresponding to a channel to be used, an inverse spreading code obtained through inverse Fourier transform of a channel identification code for that channel.
  • The spreading section 22 is supplied with an input signal 201 as a signal to be transmitted. The input signal 201 is a signal obtained by subjecting error correction encoding and predetermined baseband modulation to data to be transmitted. The spreading section 22 spreads the input signal 201 with the spreading code 122 stored in the spreading code storage section 21, and then outputs a spread signal 202. In more detail, the spreading section 22 is supplied with the elements of the spreading code 122 at every time interval T2, which is shorter than a time interval T1 during which the input signal 201 is changed. The spreading section 22 multiplies the input signal 201 by each element of the spreading code 122 at every time interval T2. Such multiplication of each element of the spreading code at every time interval T2 is generally called “multiplication of the spreading code at a chip rate”.
  • In the present embodiment, each element of the spreading code 122 is a complex number. Therefore, the spreading section 22 multiplies the input signal by the spreading code 122 at a chip rate. That is, the spreading section 22 carries out complex multiplication of the input signal 201 and each element of the spreading code 122 at every time interval T2. For example, consider a case where an element of the spreading code 122 is (C+Dj) when the imaginary unit is j. When the input signal 201 indicates a real number A, the spreading section 22 outputs a signal indicative of A×(C+Dj)=(AC+ADj) as the spread signal 202. When the input signal 201 indicates a complex number (A+Bj), the spreading section 22 outputs a signal (A+Bj)×(C+Dj)={(AC−BD)+(AD+BC) j} as the spread signal 202. With such operation of the spreading section 22, the input signal 201 is spread over a wide frequency band on the frequency axis.
  • The filter section 23 is implemented by using a band-pass filter. The filter section 23 eliminates noise components included in an unwanted band from the spread signal 202 outputted from the spreading section 22. The RF modulating section 24 carries out quadrature modulation of a carrier with a signal outputted from the filter section 23, and outputs a signal of a radio frequency. In more detail, the RF modulating section 24 modulates the carrier with the real part of the signal outputted from the filter section 23 to a first direction, and also modulates the carrier with the imaginary part of the signal outputted from the filter section 23 to a second direction that is different from the first direction in phase by 90 degrees. The antenna 25 emits a radio wave based on the signal outputted from the RF modulating section 24.
  • In the receiving apparatus 30, the antenna 31 receives the radio wave emitted from the transmitting apparatus 20, and outputs a signal of a radio frequency. The RF demodulating section 32 carries out orthogonal demodulation of the signal emitted from the antenna 31 to output a baseband signal as a demodulated signal 301. In more detail, the RF demodulating section 32 demodulates the signal emitted from the antenna 31 in the above-mentioned first direction to find the real part and also in the above-mentioned second direction to find the imaginary part, and then outputs the demodulated signal 301 in complex number form.
  • The inverse spreading section 34 uses the inverse spreading code 132 stored in the inverse spreading code storage section 33 to carry out inverse spreading of the demodulated signal 301, and then outputs the inverse spread signal 302. In more detail, the inverse spreading section 34 carries out complex multiplication of the demodulated signal 301 and the inverse spreading code 132 at the chip rate. That is, the inverse spreading section 34 carries out complex multiplication of the demodulated signal 301 and each element of the inverse spreading code 132 at every time interval T2. For example, consider a case where an element of the inverse spreading code 132 is a complex number (C−Dj) and the demodulated signal indicates a complex number (E+Fj). In this case, the inverse spreading section 34 outputs a signal (E+Fj)×(C−Dj)={(EC+FD)+(−ED+FC) j} as the inverse spread signal 302. With such operation of the inverse spreading section 34, the input signal 201 spread over the wide area on the frequency axis is converged to a specific frequency.
  • The filter section 35 is implemented by using a low-pass filter. The filter section 35 eliminates noise components included in an unwanted band from the inverse spread signal 302 outputted from the inverse spreading section 34, and outputs an output signal 303. Thus, the receiving apparatus 30 can produce the output signal 303 corresponding to the input signal 201. As the input signal 201 is obtained from data to be transmitted by encoding for error correction and baseband modulation, the output signal 303 is subjected to reverse processing (that is, baseband demodulation and decoding for error correction).
  • The synchronization tracking section 36 outputs a synchronizing signal 311 to the inverse spreading code storage section 33. The inverse spreading code storage section 33 outputs the inverse spreading code 132 to the inverse spreading section 34 in synchronization with the synchronizing signal 311 outputted from the synchronization tracking section 36. By appropriately changing output timing of the synchronizing signal 311, the synchronization tracking section 36 detects timing when the signal outputted from the inverse spreading section 34 becomes maximum in level (the timing is referred to as a peak point). With such operation of the synchronization tracking section 36, the receiving apparatus 30 can find optimum timing for inverse spreading processing. Note that the receiving apparatus 30 may further include an AFC (Automatic Frequency Control) circuit for establishing synchronization in frequency with the transmitting apparatus 20.
  • With reference to FIG. 4, main components of the transmitting apparatus 20 and the receiving apparatus 30 are described in detail. In FIG. 4, the spreading section 22, the RF modulating section 24, the RF demodulating section 32, the inverse spreading section 34, the filter section 35, and the synchronization tracking section 36 are illustrated in detail. Hereinafter, a case where the input signal 201 has been baseband-modulated with the QPSK (Quadrature Phase Shift Keying) scheme is exemplarily described. In this case, the spreading code 122, the inverse spreading code 132, the input signal 201, and the demodulated signal 301 are all complex numbers. Therefore, the spreading code 122 is denoted as (C+Dj), the inverse spreading code 132 as (C−Dj), the input signal 201 as (A+Bj), and the demodulated signal 301 as (E+Fj). In this case, A and B are 1 or −1, and C, D, and E are arbitrary real numbers.
  • The spreading section 22 includes four multipliers (first to fourth), a subtractor, and an adder. The first multiplier finds a product AC of the real part A of the input signal 201 and the real part C of the spreading code 122. The other three multipliers find a product BD, a product AD, and a product BC, respectively. The subtractor subtracts the product BD from the product AC to find a real part (AC−BD) of the spread signal 202. The adder adds the product AD and the product BC together to find an imaginary part (AD+BC) of the spread signal 202. The spreading section 22 outputs the real part and the imaginary part of the spread signal 202 separately.
  • The RF modulating section 24 includes two multipliers and an adder. One multiplier multiplies the real part of the spread signal 202 by an in-phase carrier (cosine wave), while the other multiplies the imaginary part of the spread signal 202 by an orthogonal carrier (sine wave). The adder adds signals outputted from the two multipliers together. The RF modulating section 24 outputs a single signal as a result of quadrature modulation of the carriers. Generally, in QPSK modulation, orthogonal carrier modulation is performed with four values (1, 1), (1, −1), (−1, 1), and (−1, −1). In the present embodiment, however, values other than the above four values can be used for orthogonal carrier modulation.
  • The RF demodulating section 32 includes two multipliers and two low-pass filters (denoted as LPF in FIG. 4). The signal outputted from the RF modulating section 24 is divided into two in the RF demodulating section 32. One multiplier multiplies one of the divided signals by the in-phase carrier (cosine wave), while the other multiplier multiplies the other by the orthogonal carrier (sine wave). The two low-pass filters respectively eliminate noise components included in an unwanted band from the signals outputted from the two multipliers. With such operation of the RF demodulating section 32, the demodulated signal 301 corresponding to the spread signal 202 is produced. The RF demodulating section 32 outputs the real part and the imaginary part of the demodulated signal 301 separately.
  • The inverse spreading section 34 includes four multipliers (first to fourth), a subtractor, and an adder. The first multiplier finds a product EC of the real part E of the demodulated signal 301 and the real part C of the inverse spreading code 132. The other three multipliers find a product (−FD), a product (−ED), and a product FC, respectively. The subtractor subtracts the product (−FD) from the product EC to find a real part (EC+FD) of the inverse spread signal 302. The adder adds the product (−ED) and the product FC together to find an imaginary part (−ED+FC) of the inverse spread signal 302. The inverse spreading section 34 outputs the real part and the imaginary part of the inverse spread signal 302 separately.
  • The filter section 35 includes two accumulators. One accumulator accumulates the real part of the inverse spread signal 302 outputted from the inverse spreading section 34 for one data symbol of the input signal 201, and outputs a real part A′ of the output signal 303. Similarly, the other accumulator accumulates the imaginary part of the inverse spread signal 302 outputted from the inverse spreading section 34 for one data symbol of the input signal 201, and outputs an imaginary part B′ of the output signal 303. The filter section 35 outputs the real part and the imaginary part of the output signal 303 separately.
  • The synchronization tracking section 36 includes a correlation value calculating unit 37 and a peak detecting unit 38. The correlation value calculating unit 37 accumulates the inverse spread signal 302 for one data symbol of the input signal 201, with the real part and the imaginary part of the inverse spread signal 302 being separate from each other. That is, the correlation value calculating unit 37 finds a complex number represented by {Σ(EC+FD)+Σ(−ED+FC)j} (where Σ is a sum for one data symbol of the input signal 201). The correlation value calculating unit 37 then calculates an absolute value of the found complex number for output to the peak detecting unit 38 as a correlation value. The peak detecting unit 38 outputs the synchronizing signal 311 to the inverse spreading code storage section 33 as appropriately changing output timing. When the demodulated signal 301 and the inverse spreading code 132 become synchronized with each other, the correlation value outputted from the correlation value calculating unit 37 becomes maximum. The peak detecting unit 38 detects, as a peak point, timing in which the correlation value outputted from the correlation value calculating unit 37 becomes maximum, and outputs the synchronizing signal 311 at the detected peak point.
  • In the above description, the input signal 201 is assumed to have been baseband-modulated with the QPSK scheme. It is also possible, however, to construct a communication system similar in configuration to the system illustrated in FIG. 4 in a case where the input signal 201 has been baseband-modulated with another quadrature modulation scheme. For example, in a case where the input signal 201 has been baseband-modulated with 16 QAM (Quadrature Amplitude Modulation) scheme, the real part A and the imaginary part B of the input signal 201 can independently take four values. The detailed structure of each system component can be the same as that illustrated in FIG. 4.
  • Next, effects of the communication system according to the present embodiment are described. As has been described above, the spreading code generating apparatus 10 carries out M-sequence multiplication and zero value addition of the generated orthogonal codes to find channel identification codes, and then carries out inverse Fourier transform of the channel identification codes, thereby generating the spreading codes 121 and the inverse spreading codes 131. The transmitting apparatus 20 and the receiving apparatus 30 store the spreading codes 121 and the inverse spreading codes 131, respectively, generated by the spreading code generating apparatus 10, and use a single code respectively selected from the stored codes to carry out spread spectrum communication.
  • The vectors of each orthogonal code generated by the spreading code generating apparatus 10 are orthogonal to each other. Since orthogonality is kept even after M-sequence multiplication and zero value addition, the channel identification codes obtained through these two processes are also orthogonal to each other. Moreover, since inverse Fourier transform is an orthogonal transform, the spreading codes obtained through inverse Fourier transform of the channel identification codes are orthogonal to each other. As such, by using spreading codes that are orthogonal to each other, the communication system according to the present embodiment can carry out spread spectrum communication as general spread spectrum communication systems using PN codes or the like.
  • Further, in the communication system according to the present embodiment, vectors obtained through inverse Fourier transform of the channel identification codes containing elements of 1 or −1 and orthogonal to each other are used as spreading codes. Therefore, when the spreading codes are subjected to Fourier transform, the elements obtained as a result of Fourier transform become 1 or −1, and thus their absolute values are constant. Consequently, with the use of such spreading codes for spreading, the input signal is spread over a wide frequency band with uniform power on the frequency axis. Such spectrum spreading with uniform power on the frequency axis improves transmission characteristics and increases multiplexing capacity, compared with a case of conventional spread spectrum communication not achieving uniform power on the frequency axis.
  • FIG. 5 is an illustration showing one example of transmission characteristics of the communication system according to the present embodiment. In FIG. 5, a horizontal axis indicates an S/N ratio (signal-to-noise ratio), and a vertical axis indicates a bit error rate. The transmission characteristics of the conventional art (denoted as a broken line) are observed when Hadamard codes each having a length of 16 are used as the spreading codes. The transmission characteristics of the present embodiment (denoted as a solid line) are observed when the same Hadamard codes are inverse-Fourier-transformed and the resultant codes are used as the spreading codes. In both cases, a channel division scheme used is the CDMA (Code Division Multiple Access) scheme. As illustrated in FIG. 5, in both cases, as the S/N ratio deteriorates, the bit error rate becomes larger. However, the characteristics of the present embodiment are more advantageous than those of conventional art in that the bit error rate is smaller. Therefore, according to the communication system of the present embodiment, it is possible to increase multiplexing capacity in spread spectrum communication.
  • In the present embodiment, the spreading code generating apparatus 10 generates Hadamard codes as the orthogonal codes, and generates spreading codes based on the generated Hadamard codes. Alternatively, Walsh codes, Gold codes, or other codes may be used as the orthogonal codes. Further, the spreading code generating apparatus 10 may generate channel identification codes that are different from each other, and may generate spreading codes based on the generated channel identification codes. In this case, absolute values of elements of the channel identification codes are preferably equal or approximately equal to each other. Still further, the channel identification codes do not necessarily have exact orthogonality, but may merely have characteristics so that an inner product of two vectors becomes closer to zero.
  • Also, in the present embodiment, the spreading code generating apparatus 10 carries out M-sequence multiplication and zero value addition of the generated orthogonal codes. Alternatively, either or both of the two processes may not be carried out. With this, as illustrated in FIGS. 6A-6C, it is possible to construct a spreading code generating apparatus 17 ((a) of FIG. 6) that carries out inverse Fourier transform of the generated orthogonal codes; a spreading code generating apparatus 18 ((b) of FIG. 6) that carries out multiplication of the generated orthogonal codes, and the M-sequence and then inverse Fourier transform; and a spreading code generating apparatus 19 ((c) of FIG. 6) that adds zero values to the generated orthogonal codes and then carries out inverse Fourier transform. These three types of spreading code generating apparatuses can achieve the same effects as those achieved by the spreading code generating apparatus 10.
  • Further, in the present embodiment, the spreading code generating apparatus 10 adds a predetermined number of zero values to the head and the tail of each vector outputted from the multiplier 13. Alternatively or simultaneously, a predetermined number of zero values may be inserted at the same position of each vector outputted from the multiplier 13. Such insertion of zero values at the same position of each vector can provide a carrier hole (unused frequency band) on the frequency axis, thereby preventing another system from interfering with a carrier on the frequency band. As such, the spreading code generating apparatus 10 may add or insert a predetermined number of zero values at the same position in each different numerical value sequence.
  • Still further, in the present embodiment, the transmitting apparatus 20 includes the RF modulating section 24 and the antenna 25, the receiving apparatus 30 includes the antenna 31 and the RF demodulating section 32, and wireless communication is performed between the transmitting apparatus 20 and the receiving apparatus 30. Alternatively, wired communication is performed therebetween. In this case, the transmitting apparatus 20 may not carry out RF modulation, and the receiving apparatus 30 may not carry out RF demodulation.
  • As described above, the apparatus and method for spread spectrum communication uses vectors obtained by carrying out inverse Fourier transform of different channel identification codes (orthogonal codes, for example) to carry out spectrum spreading with uniform power on the frequency axis. Thus, it is possible to improve transmission characteristics and increase multiplexing capacity.

Claims (6)

1-8. (canceled)
9. A method for transmitting a binary code using a Frequency Division Multiplexing (FDM), comprising:
outputting one PN binary code chosen from a plurality of PN binary codes;
modulating a plurality of subcarriers in a band, one-by-one, by binary element values, respectively, of the one PN binary code;
multiplexing the subcarriers having been modulated to obtain a transmission signal; and
transmitting the signal in an IFT (Inverse Fourier Transform) symbol time duration.
10. The method according to claim 9, wherein, in said modulating step, subcarriers in one group or plural groups of successive subcarriers in frequency domain are modulated by the binary element values, respectively, of the one PN binary code.
11. The method according to claim 10, wherein, in said modulating step, the successive subcarriers are modulated such that while preserving an unused frequency subcarrier between the groups of successive carriers.
12. The method according to claim 9, wherein the PN binary code is used for identifying a transmitting apparatus in a system operated by the FDM.
13. An apparatus for transmitting a binary code using a Frequency Division Multiplexing (FDM), said apparatus comprising:
a processor that executes instructions; and
a memory device having said instructions stored thereon, wherein
said instructions are issued for:
outputting one PN binary code chosen from a plurality of PN binary codes;
modulating a plurality of subcarriers in a band, one-by-one, by binary element values, respectively, of the one PN binary code;
multiplexing the subcarriers having been modulated to obtain a transmission signal; and
transmitting the signal in an IFT (Inverse Fourier Transform) symbol time duration.
US13/668,495 2001-10-19 2012-11-05 System and method for spread spectrum communication Abandoned US20130100965A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/668,495 US20130100965A1 (en) 2001-10-19 2012-11-05 System and method for spread spectrum communication

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
JP2001321655 2001-10-19
JP2001-321655 2001-10-19
PCT/JP2002/010728 WO2003036840A1 (en) 2001-10-19 2002-10-16 System and method for spread spectrum communication
US10/491,925 US7330496B2 (en) 2001-10-19 2002-10-16 System and method for spread spectrum communication
US11/976,838 US8325780B2 (en) 2001-10-19 2007-10-29 System and method for spread spectrum communication
US13/668,495 US20130100965A1 (en) 2001-10-19 2012-11-05 System and method for spread spectrum communication

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US11/976,838 Continuation US8325780B2 (en) 2001-10-19 2007-10-29 System and method for spread spectrum communication

Publications (1)

Publication Number Publication Date
US20130100965A1 true US20130100965A1 (en) 2013-04-25

Family

ID=19138840

Family Applications (3)

Application Number Title Priority Date Filing Date
US10/491,925 Expired - Lifetime US7330496B2 (en) 2001-10-19 2002-10-16 System and method for spread spectrum communication
US11/976,838 Active 2024-07-02 US8325780B2 (en) 2001-10-19 2007-10-29 System and method for spread spectrum communication
US13/668,495 Abandoned US20130100965A1 (en) 2001-10-19 2012-11-05 System and method for spread spectrum communication

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US10/491,925 Expired - Lifetime US7330496B2 (en) 2001-10-19 2002-10-16 System and method for spread spectrum communication
US11/976,838 Active 2024-07-02 US8325780B2 (en) 2001-10-19 2007-10-29 System and method for spread spectrum communication

Country Status (5)

Country Link
US (3) US7330496B2 (en)
EP (1) EP1436929B1 (en)
JP (2) JP4677461B2 (en)
DE (1) DE60205128T2 (en)
WO (1) WO2003036840A1 (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180138939A1 (en) * 2016-11-14 2018-05-17 Rampart Communications, LLC Reliable orthogonal spreading codes in wireless communications
US10735062B1 (en) 2019-09-04 2020-08-04 Rampart Communications, Inc. Communication system and method for achieving high data rates using modified nearly-equiangular tight frame (NETF) matrices
US10833749B1 (en) 2019-07-01 2020-11-10 Rampart Communications, Inc. Communication system and method using layered construction of arbitrary unitary matrices
US10873361B2 (en) 2019-05-17 2020-12-22 Rampart Communications, Inc. Communication system and methods using multiple-in-multiple-out (MIMO) antennas within unitary braid divisional multiplexing (UBDM)
US10917148B2 (en) 2019-07-01 2021-02-09 Rampart Communications, Inc. Systems, methods and apparatus for secure and efficient wireless communication of signals using a generalized approach within unitary braid division multiplexing
US10951442B2 (en) 2019-07-31 2021-03-16 Rampart Communications, Inc. Communication system and method using unitary braid divisional multiplexing (UBDM) with physical layer security
US10965352B1 (en) 2019-09-24 2021-03-30 Rampart Communications, Inc. Communication system and methods using very large multiple-in multiple-out (MIMO) antenna systems with extremely large class of fast unitary transformations
US11025470B2 (en) 2019-07-01 2021-06-01 Rampart Communications, Inc. Communication system and method using orthogonal frequency division multiplexing (OFDM) with non-linear transformation
US11050604B2 (en) 2019-07-01 2021-06-29 Rampart Communications, Inc. Systems, methods and apparatuses for modulation-agnostic unitary braid division multiplexing signal transformation
US11159220B2 (en) 2020-02-11 2021-10-26 Rampart Communications, Inc. Single input single output (SISO) physical layer key exchange
US11641269B2 (en) 2020-06-30 2023-05-02 Rampart Communications, Inc. Modulation-agnostic transformations using unitary braid divisional multiplexing (UBDM)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1436929B1 (en) * 2001-10-19 2005-07-20 Matsushita Electric Industrial Co., Ltd. System and method for spread spectrum communication
US20050031018A1 (en) * 2003-06-27 2005-02-10 Nokia Corporation Zero-padded OFDM with improved performance over multipath channels
JP3643366B2 (en) * 2003-07-10 2005-04-27 松下電器産業株式会社 CDMA transmitter and CDMA receiver
US7778270B1 (en) * 2005-08-31 2010-08-17 Hrl Laboratories, Llc Code-switching in wireless multi-hop networks
US20090135804A1 (en) * 2007-11-26 2009-05-28 Francis Swarts Method And System For Ordering Sequences For Synchronization Signaling In A Wireless System
US8363699B2 (en) * 2009-03-20 2013-01-29 On-Ramp Wireless, Inc. Random timing offset determination
CN114374406B (en) * 2020-10-14 2023-02-28 维沃移动通信有限公司 Signal sending method, signal receiving method, terminal and communication equipment
CN113630151B (en) * 2021-09-18 2022-07-19 哈尔滨工业大学 Time-frequency joint extension transmission method

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5677927A (en) * 1994-09-20 1997-10-14 Pulson Communications Corporation Ultrawide-band communication system and method
US5966377A (en) * 1996-05-20 1999-10-12 Mitsubishi Denki Kabushiki Kaisha Spread spectrum communication system
US6256508B1 (en) * 1998-02-27 2001-07-03 Mitsubishi Denki Kabushiki Kaisha Simultaneous broadcasting system, transmitter and receiver therefor
US6411645B1 (en) * 1997-08-21 2002-06-25 Electronics And Telecommunications Research Institute Modulation apparatus of multicarrier direct sequence spread spectrum communication system
US6418161B1 (en) * 1997-12-31 2002-07-09 At & T Corp. Spread spectrum bit allocation algorithm
US20020159425A1 (en) * 2000-03-17 2002-10-31 Mitsuru Uesugi Radio communication apparatus and radio communication method
US20030023648A1 (en) * 2000-03-09 2003-01-30 Toshiya Suzuki Method and apparatus for producing pseudorandom signal
US6658044B1 (en) * 1999-06-23 2003-12-02 Samsung Thomson-Csf Co., Ltd. Frequency hopping communication device and frequency hopping method
US6775332B1 (en) * 1998-12-23 2004-08-10 Nortel Networks Limited Multi-stage receiver
US7002945B2 (en) * 2000-05-11 2006-02-21 Nec Corporation FDM-CDMA transmitting method, FDM-CDMA receiving method, FDM-CDMA transmitting device and FDM-CDMA receiving device
US7072289B1 (en) * 2001-06-01 2006-07-04 Lin Yang Pseudo-random sequence padding in an OFDM modulation system
US20060193373A1 (en) * 1997-02-24 2006-08-31 Agee Brian G Highly bandwidth-efficient communications
US8396093B2 (en) * 2001-08-30 2013-03-12 Schleifring Und Apparatebau Gmbh Device and method for low interference signal transmission

Family Cites Families (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61205037A (en) * 1985-03-08 1986-09-11 Toshiba Corp Multiplex communication system
JP2929244B2 (en) 1991-04-12 1999-08-03 東洋通信機株式会社 Spread spectrum communication system
US5175743A (en) 1991-11-22 1992-12-29 Bell Communications Research, Inc. Spread-time code division multiple access technique with arbitrary spectral shaping
US5282222A (en) * 1992-03-31 1994-01-25 Michel Fattouche Method and apparatus for multiple access between transceivers in wireless communications using OFDM spread spectrum
US5555268A (en) * 1994-01-24 1996-09-10 Fattouche; Michel Multicode direct sequence spread spectrum
JPH0691509A (en) 1992-09-10 1994-04-05 Amada Washino Co Ltd Grinding machine
FI97505C (en) * 1994-11-29 1996-12-27 Nokia Telecommunications Oy Procedure for data communication, transmitters and receivers
US5574747A (en) * 1995-01-04 1996-11-12 Interdigital Technology Corporation Spread spectrum adaptive power control system and method
SE515752C2 (en) * 1995-08-28 2001-10-08 Telia Ab Direct access in OFDM system
JPH10285136A (en) * 1997-04-01 1998-10-23 Kazuo Tsubouchi Spread spectrum radio communication system
JPH10294715A (en) 1997-04-21 1998-11-04 Kazuo Tsubouchi Spread spectrum radio communication system
US6975673B1 (en) * 1998-07-14 2005-12-13 Axonn, L.L.C. Narrow-band interference rejecting spread spectrum radio system and method
JP2000236284A (en) * 1999-02-15 2000-08-29 Sony Corp Device and method for correlation detection
FI112893B (en) * 1999-12-21 2004-01-30 Nokia Corp Method in receiver and receiver
US6975666B2 (en) * 1999-12-23 2005-12-13 Institut National De La Recherche Scientifique Interference suppression in CDMA systems
US7295509B2 (en) * 2000-09-13 2007-11-13 Qualcomm, Incorporated Signaling method in an OFDM multiple access system
US6865218B1 (en) * 2000-11-27 2005-03-08 Ericsson Inc. Multipath interference reduction for a CDMA system
JP3385266B2 (en) * 2000-11-27 2003-03-10 富士通株式会社 Noise removal method and apparatus
US7158558B2 (en) * 2001-04-26 2007-01-02 Interuniversitair Microelektronica Centrum (Imec) Wideband multiple access telecommunication method and apparatus
KR100450936B1 (en) * 2001-08-27 2004-10-02 삼성전자주식회사 Apparatus for generating preamble sequence in broadband wireless access communication system using orthogonal frequency division multiplexing scheme and method thereof
JP4180343B2 (en) * 2001-10-19 2008-11-12 松下電器産業株式会社 Spread spectrum communication system and method
EP1436929B1 (en) * 2001-10-19 2005-07-20 Matsushita Electric Industrial Co., Ltd. System and method for spread spectrum communication
US7864663B2 (en) * 2007-05-25 2011-01-04 Telefonaktiebolaget Lm Ericsson (Publ) Orthogonal spread-spectrum waveform generation with non-contiguous spectral occupancy for use in CDMA communications

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5677927A (en) * 1994-09-20 1997-10-14 Pulson Communications Corporation Ultrawide-band communication system and method
US5966377A (en) * 1996-05-20 1999-10-12 Mitsubishi Denki Kabushiki Kaisha Spread spectrum communication system
US20060193373A1 (en) * 1997-02-24 2006-08-31 Agee Brian G Highly bandwidth-efficient communications
US6411645B1 (en) * 1997-08-21 2002-06-25 Electronics And Telecommunications Research Institute Modulation apparatus of multicarrier direct sequence spread spectrum communication system
US6418161B1 (en) * 1997-12-31 2002-07-09 At & T Corp. Spread spectrum bit allocation algorithm
US6256508B1 (en) * 1998-02-27 2001-07-03 Mitsubishi Denki Kabushiki Kaisha Simultaneous broadcasting system, transmitter and receiver therefor
US6775332B1 (en) * 1998-12-23 2004-08-10 Nortel Networks Limited Multi-stage receiver
US6658044B1 (en) * 1999-06-23 2003-12-02 Samsung Thomson-Csf Co., Ltd. Frequency hopping communication device and frequency hopping method
US20030023648A1 (en) * 2000-03-09 2003-01-30 Toshiya Suzuki Method and apparatus for producing pseudorandom signal
US20020159425A1 (en) * 2000-03-17 2002-10-31 Mitsuru Uesugi Radio communication apparatus and radio communication method
US7002945B2 (en) * 2000-05-11 2006-02-21 Nec Corporation FDM-CDMA transmitting method, FDM-CDMA receiving method, FDM-CDMA transmitting device and FDM-CDMA receiving device
US7072289B1 (en) * 2001-06-01 2006-07-04 Lin Yang Pseudo-random sequence padding in an OFDM modulation system
US8396093B2 (en) * 2001-08-30 2013-03-12 Schleifring Und Apparatebau Gmbh Device and method for low interference signal transmission

Cited By (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11018715B2 (en) * 2016-11-14 2021-05-25 Rampart Communications, Inc. Reliable orthogonal spreading codes in wireless communication
US10020839B2 (en) * 2016-11-14 2018-07-10 Rampart Communications, LLC Reliable orthogonal spreading codes in wireless communications
US10491262B2 (en) * 2016-11-14 2019-11-26 Rampart Communications, Inc. Reliable orthogonal spreading codes in wireless communication
CN113162723A (en) * 2016-11-14 2021-07-23 拉姆帕特通信有限责任公司 Reliable orthogonal spreading codes in wireless communications
US10819387B2 (en) * 2016-11-14 2020-10-27 Rampart Communications, Inc. Reliable orthogonal spreading codes in wireless communication
US20180138939A1 (en) * 2016-11-14 2018-05-17 Rampart Communications, LLC Reliable orthogonal spreading codes in wireless communications
US10873361B2 (en) 2019-05-17 2020-12-22 Rampart Communications, Inc. Communication system and methods using multiple-in-multiple-out (MIMO) antennas within unitary braid divisional multiplexing (UBDM)
US10833749B1 (en) 2019-07-01 2020-11-10 Rampart Communications, Inc. Communication system and method using layered construction of arbitrary unitary matrices
US11075681B2 (en) 2019-07-01 2021-07-27 Rampart Communications, Inc. Communication system and method using layered construction of arbitrary unitary matrices
US11050604B2 (en) 2019-07-01 2021-06-29 Rampart Communications, Inc. Systems, methods and apparatuses for modulation-agnostic unitary braid division multiplexing signal transformation
US10917148B2 (en) 2019-07-01 2021-02-09 Rampart Communications, Inc. Systems, methods and apparatus for secure and efficient wireless communication of signals using a generalized approach within unitary braid division multiplexing
US11025470B2 (en) 2019-07-01 2021-06-01 Rampart Communications, Inc. Communication system and method using orthogonal frequency division multiplexing (OFDM) with non-linear transformation
US10951442B2 (en) 2019-07-31 2021-03-16 Rampart Communications, Inc. Communication system and method using unitary braid divisional multiplexing (UBDM) with physical layer security
US11394588B2 (en) 2019-07-31 2022-07-19 Rampart Communications, Inc. Communication system and method using unitary braid divisional multiplexing (UBDM) with physical layer security
US10735062B1 (en) 2019-09-04 2020-08-04 Rampart Communications, Inc. Communication system and method for achieving high data rates using modified nearly-equiangular tight frame (NETF) matrices
US11258487B2 (en) 2019-09-04 2022-02-22 Rampart Communications, Inc. Communication system and method for achieving high data rates using modified nearly-equiangular tight frame (NETF) matrices
US10965352B1 (en) 2019-09-24 2021-03-30 Rampart Communications, Inc. Communication system and methods using very large multiple-in multiple-out (MIMO) antenna systems with extremely large class of fast unitary transformations
US11336341B2 (en) 2019-09-24 2022-05-17 Rampart Communications, Inc. Communication system and methods using very large multiple-in multiple-out (MIMO) antenna systems with extremely large class of fast unitary transformations
US11838078B2 (en) 2019-09-24 2023-12-05 Rampart Communications, Inc. Communication system and methods using very large multiple-in multiple-out (MIMO) antenna systems with extremely large class of fast unitary transformations
US11159220B2 (en) 2020-02-11 2021-10-26 Rampart Communications, Inc. Single input single output (SISO) physical layer key exchange
US11476912B2 (en) 2020-02-11 2022-10-18 Rampart Communications, Inc. Single input single output (SISO) physical layer key exchange
US11716131B2 (en) 2020-02-11 2023-08-01 Rampart Communications, Inc. Single input single output (SISO) physical layer key exchange
US11641269B2 (en) 2020-06-30 2023-05-02 Rampart Communications, Inc. Modulation-agnostic transformations using unitary braid divisional multiplexing (UBDM)

Also Published As

Publication number Publication date
EP1436929B1 (en) 2005-07-20
JP2008178118A (en) 2008-07-31
US20050018753A1 (en) 2005-01-27
US20080069184A1 (en) 2008-03-20
WO2003036840A1 (en) 2003-05-01
US7330496B2 (en) 2008-02-12
DE60205128T2 (en) 2006-05-24
US8325780B2 (en) 2012-12-04
EP1436929A1 (en) 2004-07-14
JP4677461B2 (en) 2011-04-27
JP5139508B2 (en) 2013-02-06
DE60205128D1 (en) 2005-08-25
JP2011055559A (en) 2011-03-17

Similar Documents

Publication Publication Date Title
US8325780B2 (en) System and method for spread spectrum communication
US10128899B2 (en) Transmission device, reception device, and radio communication method
US5757766A (en) Transmitter and receiver for orthogonal frequency division multiplexing signal
US8102831B2 (en) Radio transmitting apparatus and method for transmitting OFDM signals from different antennas according to the degree of multiplexing
US8130730B2 (en) User equipment for synchronizing to a TDD base station
EP1204224B1 (en) Mobile communication system in multi-carrier CDMA scheme using short code and long code
EP1188260B1 (en) Cell search procedure for time division duplex communication systems using code division multiple access
US20140056189A1 (en) Tdd base station for code group synchronization
JP4180343B2 (en) Spread spectrum communication system and method

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: INTERDIGITAL PATENT HOLDINGS, INC., DELAWARE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PANASONIC CORPORATION;REEL/FRAME:048143/0354

Effective date: 20180126