Sandbridge Technologies, Inc.

Joon-Hwa Chun

Mayan Moudgill

Erdem Hokenek

Daniel Sabin Iancu

Jin Lu

The present method of initial synchronization of a communication signal includes the steps of symbol boundary search, fractional frequency offset estimation, fractional frequency offset compensation, frame boundary search, integer frequency offset estimation, integer frequency offset compensation, preamble segment ID search and preamble cell ID search. The symbol boundary search includes estimating the boundary of a present data symbol by a correlation index for the present data symbol and the correlation index for the next data symbol. The frame boundary search includes identifying the preamble symbol in the symbols found in the symbol boundary search to determine the frame boundary. The integer frequency offset estimation is derived from the pilot subcarriers of the frame control header of the frame after locating the preamble symbol.

Method of initial synchronization of a communication signal

A method of determining an acquisition indicator bit AIat a receiver in a communication system which includes receiving multiplexed acquisition indicator bits y=B&#xd7;AI+n, where B is the signature matrix known at both base station and UE, AI is all the acquisition indicator bits and n represents noise. Next, an estimated value of the acquisition indicator bit A&#xce;(s) as a function of is calculated, where B(s,.) is the s-th row vector of the transposed matrix Bfor acquisition indicator bit AI. Finally, the acquisition indicator bit AIis set as follows:=&#x2212;1, if()&#x3c;=0, if()&#x3c;=1, if()&#x2267;where R and U are decision thresholds.

Method of determining an acquisition indicator bit in a communication system

A method of decoding using a log posterior probability ratio L(u), which is a function of forward variable &#x3b1; (.) and backward variable &#x3b2; (.). The method comprises dividing the forward variable &#x3b1; (.) and the backward variable &#x3b2; (.) into, for example, two segments p and q, where p plus q equal the length of the code word U. The forward segments &#x3b1; (.) are parallel calculated, and the backward segments &#x3b2; (.) are parallel calculated. The ratio L(u) is calculated using the parallel calculated segments of &#x3b1; (.) and &#x3b2; (.).

Turbo decoder using parallel processing

A method of performing interleaving or deinterleaving in a communication system having at least one interleaver at the transmitter and at least one deinterleaver at the receiver. The method includes interleaving or deinterleaving the input bit sequence xas follows: y=x, n=0, . . . , N&#x2212;1, using a bridge function between &#x3c0;and n, n=0, . . . , N&#x2212;1, based on a spline linear model. When the system includes a first and a second interleaving or deinterleaving, the method is performed for both. When the second interleaving or deinterleaving includes adding padding bits, the location in the interleaved or deinterleaved bit sequence of the padding bits is determined and interleaving or deinterleaving for the determined locations is skipped.

Method of interleaving/deinterleaving in a communication system

A method of determining an acquisition indicator bit AIat a receiver in a communication system which includes receiving multiplexed acquisition indicator bits y=B&#xd7;AI+n, where B is the signature matrix known at both base station and the receiver, AI is all the acquisition indicator bits and n represents noise. Next, an estimated value of the acquisition indicator bit A&#xce;(s) as a function ofis calculated, where B(s,.) is the s-th row vector of the transposed matrix Bfor acquisition indicator bit AI. Finally, the acquisition indicator bit AIis set as follows:=&#x2212;1, if()&#x3c;=0, if()&#x3c;=1, if()&#x2267;where R and U are decision thresholds.

Growing community of inventors

Lake Grove, NY, United States of America

Joon-Hwa Chun