摘要:
The present invention provides an apparatus and method for code group identification and frame synchronization for cell searching used in wide-band DS-CDMA cellular systems. This method characterizes each secondary synchronization code sequence (SSCS) with a corresponding theoretical frequency sequence, which represents the occurrence times of CS1 to CS16 in a corresponding SSCS. Thus, 64 secondary synchronization code sequences corresponding to 64 code groups defined in DS-CDMA systems also corresponds to 64 theoretical frequency sequences. By characterizing the SSCS transmitted by a base station, a real frequency sequence can be generated. Comparing the real frequency sequence with the 64 theoretical frequency sequences, one can determine one or two candidate code groups, which may be employed by the base station. Finally, one can compare the SSCS transmitted by the base station with all the possible SSCSs corresponding to the candidate code groups to determine a specific code group and a frame boundary for the base station.
摘要:
A receiver includes a Viterbi-like equalizer that provides diversity combining of soft values to produce reliability information. The output reliability information at time k is the average of the first reliability information at time k and the second reliability information at time (k−1) after being normalized by the noise power. The first reliability information at time k is the difference between the two accumulated metrics of the two preceding nodes arriving at the same node having the global minimum node metric at time k over all transitions of all states. The second reliability function at time k is the difference between the best accumulated metric characterized by the last (L−1) bit being binary “one” and the best accumulated metric characterized by the last (L−1) bit being binary “zero.”
摘要:
An MMSE linear detector is implemented using a variable step-size Griffiths' algorithm. The received signal is sampled and stored. The stored samples are multiplied with components of a spreading sequence to provide products that are summed to provide a first output. The stored samples are also multiplied with components of a weight vector to provide products that are summed to provide a second output. A computing unit uses the Griffiths' algorithm to iteratively compute the weight vector. Another computing unit computes the step-size for each successive iteration of the Griffiths' algorithm based on the first and second outputs.