# US 5,706,275 A · Data transmission method, transmitter, and receiver > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 5,706,275 A - Document ID: US5706275A - Status: Granted - Kind: A - Application number: 08/682,697 - Filed: 1996-07-26 - Granted: 1998-01-06 - Earliest claimed: 1994-11-29 - Assignees: Nokia Telecommunications Oy - Inventors: Qin Zhengdi - Web page: https://patentgrep.com/patent/US5706275A ## CPC - H04J 13/00: Code division multiplex systems (for frequency hopping H04B1/713) - H04B 1/707: using direct sequence modulation - H04B 1/713: using frequency hopping - H04B 7/264: {for data rate control} - H04J 1/00: Frequency-division multiplex systems (H04J14/00 takes precedence) - H04L 5/026: {using code division (code allocation applied as frequency-domain sequences H04L5/0021)} - H04B 1/692: Hybrid techniques using combinations of two or more spread spectrum techniques - H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S) - H04B: TRANSMISSION - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A receiver, and a data transmission method in a system wherein the CDMA multiple access method in a system wherein the CDMA multiple access method is utilized and wherein each data signal to be transmitted is multiplied by a pseudorandom code of a certain length, having a bit rate that is higher than that of the data signal to be transmitted. In order to ensure fast and inexpensive reception, the signal multiplied by the pseudorandom code is further modulated by a group of waveforms (f.sub.1 . . . f.sub.N) the number of which equals the number of bits in the pseudorandom code, the frequency domain given. The signal is converted in the receiver into a digital form and multiplied by the pseudorandom code which has been subjected to an inverse Fourier transform, and the multiplied signal is subjected to a Fourier transform. ## Claims ### Claim 1 A data transmission method in a system wherein the CDMA multiple access method is utilized, comprising: multiplying each data signal be transmitted by a transmitter by a pseudorandom code of a certain length, having a bit rate that is higher than that of the data signal to be transmitted; further multiplying the signal multiplied by the pseudorandom code by a group of waveforms (f.sub.1 . . . f.sub.N) the number of which equals the number of bits in the pseudorandom code, the frequency of each waveform being included in a given frequency domain. ### Claim 2 (depends on 1) A method according to claim 1, including: each bit sequence formed by a data signal and multiplied by a pseudorandom code controlling a group of switches the number of which equals the number of bits in said bit sequence, said switches controlling a corresponding number of frequency synthesizers in such a way that if the value of a bit in the bit sequence is a first given value, the corresponding switch is open, and if the value of a bit in the bit sequence is a second given value, the corresponding switch is closed; summing the output signals of the switches in the transmitter. ### Claim 3 (depends on 1) A method according to claim 1, including: when several data signals are transmitted simultaneously, summing the modulated signals to be transmitted in the transmitter. ### Claim 4 (depends on 1) A method according to claim 1, wherein: said group of waveforms (f.sub.1 . . . f.sub.N) consists of sinusoidal signals. ### Claim 5 (depends on 1) A method according to claim 1, wherein: said waveform (f.sub.1 . . . f.sub.N) have differences between them which are not all equal to one another. ### Claim 6 (depends on 1) A method according to claim 1, including: forming said waveforms (f.sub.1 . . . f.sub.N) by use of Walsh functions. ### Claim 7 (depends on 1) A method according to claim 1, including: transmitting the further modulated signal by the transmitter; receiving the further modulated signal by a receiver to provide a receiver signal; converting the received signal into a digital form and multiplying the received signal by a pseudorandom code that has been subjected to an inverse Fourier transform; and subjecting the multiplied signal to a Fourier transform. ### Claim 8 (depends on 1) A method according to claim 1, including: transmitting the further modulated signal by the transmitter; receiving the further modulated signal by a receiver to provide a receiver signal; converting the received signal into a digital form; subjecting the received signal to a Fourier transform to provide a converted signal; and correlating said converted signal a pseudorandom code. ### Claim 9 A transmitter, comprising; means for multiplying each data signal to be transmitted by a pseudorandom code of a certain length, having a bit rate that is higher than that of the data signal to be transmitted; and modulating means for modulating the signal multiplied by the pseudorandom code by a group of waveforms (f.sub.1 . . . f.sub.N) the number of which equals the number of bits in the pseudorandom code, the frequency of each waveform being included in a given frequency domain. ### Claim 10 (depends on 9) A transmitter according to claim 9, including: a plurality of frequency synthesizers; said modulating means comprising a group of switching means comprising a plurality switches the number of which equals the number of bits in the pseudorandom code; the input signals of the switches consisting of a corresponding number of output signals of said frequency synthesizers; the control signals of the switches consisting of the bits in the bit sequence formed by the data signal multiplied by the pseudorandom code and means for combining the output signals of the switches. ### Claim 11 (depends on 9) A transmitter according to claim 9, further comprising: means for combining several data signals as multiplied by a said pseudorandom code and modulated by a said group of waveforms (f.sub.1 . . . f.sub.N), to be transmitted simultaneously. ### Claim 12 A receiver, comprising: means for converting a received analog signal into a digital form; means for generating a desired pseudorandom code; means for subjecting the desired pseudorandom code to an inverse Fourier transform to generate a converted pseudorandom code; means for multiplying the digitized received signal by the converted pseudorandom code; and means for subjecting the multiplied signal to a Fourier transform.