Back to results
US 8,670,428 B2Granted
Signal acquisition in peer-to-peer communications
AssigneeQUALCOMM Incorporated
InventorsRoy Franklin Quick, Jr., Henry David Pfister
Life of this patent
Estimating the term…
Abstract
Methods and mobile stations for transmitting, receiving and processing peer-to-peer communication signals without a base station or network element. A transmitting mobile station may alternate two or more long code masks to generate one or more pseudorandom noise (PN) codes to spread data for transmission. A receiving mobile station receives the spread data and achieves synchronization with the transmitting mobile station.
Claims10
An apparatus comprising:
- a selector to sequentially select a first mask and a second mask, each mask comprising a finite sequence of binary bits;
- a generator to receive the first mask, generate a first pseudorandom noise code, receive the second mask and generate a second pseudorandom noise code;
- a first multiplier to sequentially multiply the first and second pseudorandom noise codes with data to form a signal;
- a transmitter to wirelessly transmit the signal,
- wherein the selector is configured to select the first mask for a period of 80 milliseconds, then selects the second mask for a period of 80 milliseconds, and repeats.
2 more elements
An apparatus comprising:
- a selector to sequentially select a first mask and a second mask, each mask comprising a finite sequence of binary bits;
- a generator to receive the first mask, generate a first pseudorandom noise code, receive the second mask and generate a second pseudorandom noise code;
- a first multiplier to sequentially multiply the first and second pseudorandom noise codes with data to form a signal;
- a transmitter to wirelessly transmit the signal,
- wherein the selector is configured to select the first mask for a period of 80 milliseconds, then selects the second mask for a period of 80 milliseconds, then selects a third mask for a period of 80 milliseconds.
2 more elements
An apparatus comprising:
- a selector to sequentially select a first mask and a second mask, each mask comprising a finite sequence of binary bits;
- a generator to receive the first mask, generate a first pseudorandom noise code, receive the second mask and generate a second pseudorandom noise code;
- a first multiplier to sequentially multiply the first and second pseudorandom noise codes with data to form a signal;
- a transmitter to wirelessly transmit the signal,
- wherein the generator comprises a linear feedback shift register, a plurality of AND gates, and a plurality of exclusive-OR gates.
- wherein the first and second pseudorandom noise codes each have a length of 2L-1, where L is equal to a number of stages in the linear feedback shift register;
- wherein L is greater than 40.
4 more elements
An apparatus comprising:
- a selector to sequentially select a first mask and a second mask, each mask comprising a finite sequence of binary bits;
- a generator to receive the first mask, generate a first pseudorandom noise code, receive the second mask and generate a second pseudorandom noise code;
- a first multiplier to sequentially multiply the first and second pseudorandom noise codes with data to form a signal;
- a transmitter to wirelessly transmit the signal,
- wherein the generator comprises a linear feedback shift register, a plurality of AND gates, and a plurality of exclusive-OR gates.
- wherein the second mask is a function of the first mask, wherein the second mask is equal to a first row of a Boolean matrix MLC1 represented by:
- MLC1=MLC0(I⊕MT2)(MT3⊕MT4)−1
- where MLC0 and MLC1 are matrices that create next N bits of a pseudorandom noise sequence generated by the first and second masks for a given state R of the linear feedback shift register;
- where I is an identity matrix;
- where ⊕ is an XOR function;
- where MT2 is a matrix that advances the state of the linear feedback shift register by T2 chips, where T2 is equal to a length of a third pseudorandom noise code plus an integer X;
- where MT3 is a matrix that advances the state of the linear feedback shift register by T3 chips, where T3 is equal to three multiplied by the length of the third pseudorandom noise code plus X;
- and
- where MT4 is a matrix that advances the state of the linear feedback shift register by T4 chips, where T4 is equal to four multiplied by the length of the third pseudorandom noise code.
11 more elements
An apparatus comprising:
- a receiver to wirelessly receive a signal comprising a plurality of data samples spread by first, second, and third pseudorandom noise codes;
- and
- a multiplier to multiply each first received data sample by a complex conjugate of a second received data sample, a third received data sample and a complex conjugate of fourth received data sample, the second received data sample being time offset from the first received data sample by a length of the third pseudorandom noise code plus an integer X, the third received data sample being time offset from the first received data sample by three multiplied by the length of the third pseudorandom noise code plus integer X, the fourth received data sample being time offset from the first received data sample by four multiplied by the length of the third pseudorandom noise code.
An apparatus comprising:
- a receiving means to wirelessly receive a signal comprising a plurality of data samples spread by first, second, and third pseudorandom noise codes;
- and
- a multiplying means to multiply each first received data sample by a complex conjugate of a second received data sample, a third received data sample and a complex conjugate of a fourth received data sample, the second received data sample being time offset from the first received data sample by a length of the third pseudorandom noise code plus an integer X, the third received data sample being time offset from the first received data sample by three multiplied by the length of the third pseudorandom noise code plus integer X, the fourth received data sample being time offset from the first received data sample by four multiplied by the length of the third pseudorandom noise code.
A method comprising:
- sequentially selecting a first mask and a second mask, each mask comprising a finite sequence of binary bits;
- generating a first pseudorandom noise code based on the first mask;
- generating a second pseudorandom noise code based on the second mask;
- sequentially multiplying the first and second pseudorandom noise codes with data to form a signal;
- wirelessly transmitting the signal;
- wherein the second mask is equal to a first row of a Boolean matrix MLC1 represented by:
- MLC1=MLC0(I⊕MT2)(MT3⊕MT4)−1
- where MLC0 and MLC1 are matrices that create next N bits of a pseudorandom noise sequence generated by the first and second masks for a given state R of the linear feedback shift register;
- where I is an identity matrix;
- where ⊕ is an XOR function;
- where MT2 is a matrix that advances the state of the linear feedback shift register by T2 chips, where T2 is equal to a length of a third pseudorandom noise code plus an integer X;
- where MT3 is a matrix that advances the state of the linear feedback shift register by T3 chips, where T3 is equal to three multiplied by the length of the third pseudorandom noise code plus X;
- and
- where MT4 is a matrix that advances the state of the linear feedback shift register by T4 chips, where T4 is equal to four multiplied by the length of the third pseudorandom noise code.
11 more elements
A method comprising:
- wirelessly receiving a signal comprising a plurality of data samples spread by first, second, and third pseudorandom noise codes;
- and
- multiplying each first received data sample by a complex conjugate of a second received data sample, a third received data sample, and a complex conjugate of a fourth received data sample, the second received data sample being time offset from the first received data sample by a length of the third pseudorandom noise code plus an integer X, the third received data sample being time offset from the first received data sample by three multiplied by the length of the third pseudorandom noise code plus integer X, the fourth received data sample being time offset from the first received data sample by four multiplied by the length of the third pseudorandom noise code.
Dependencies are inferred from the claim text.