Abstract:
To obtain frame synchronization and identify the cell codegroup in a cellular communication system (such as a system based upon the standard 3GPP FDD), there are available the synchronization codes (SSCH) organized in chips or letters transmitted at the beginning of respective slots. Slot synchronization is obtained previously in a first step of the operation of cell search. During a second step, there are acquired, by means of correlation (10) or fast Hadamard transform, the energy values corresponding to the respective individual letters with reference to the possible starting positions of the corresponding frame within the respective slot. Operating in a serial way (24) at the end of acquisition of the aforesaid energy values of the individual letters, or else operating in parallel, the energies of the corresponding words are determined. Of these eneriges only the maximum word-energy value and the information for the corresponding starting position are stored in a memory structure (22). Said maximum value and said starting position identify, respectively, the cell codes and the frame synchronization sought. A preferential application is in mobile communication systems based upon standards such as UMTS, CDMA2000, IS95, or WBCDMA.
Abstract:
In order to generate the main scrambling code of order N and the secondary scrambling code of order K within the set identified by the primary scrambling code of order N, a first m-sequence and a second m-sequence are generated using Fibonacci linear feedback shift registers (LFSRs). Then said first m-sequence and said second m-sequence are modulo-2 added so as to form the I branch of said primary scrambling code. A first T-bit masking word and a second T-bit masking word of rank 0 (X0-MASK, Y0-MASK) are generated that correspond to the polynomial time shifts (X0 (D), Y0 (D)), and the intermediate taps of the X and y registers respectively chosen by means of said masking words (X0-MASK, Y0-MASK) are modulo-2 added so as to generate a third sequence and a fourth sequence which are modulo-2 added together to form the Q branch of said primary scrambling code. With the choice, starting from the least significant Kmax bits of the register X, of the K-th intermediate tap corresponding to the secondary scrambling code of order K within said set identified by the primary scrambling code of order N, a fifth sequence is generated, which, modulo-2 added to said second sequence, forms the I branch of said secondary scrambling code. By modulo-2 summing the intermediate taps of the register X masked by means of the aforesaid first masking word of rank N (XN-MASK), a sixth sequence is generated, which, modulo-2 added to the aforesaid fourth sequence, forms the Q branch of the secondary scrambling code.
Abstract:
A method and a system for the acquisition and tracking of BOC (n,n) modulated codes are described, in which a correlation function is locally generated at a receiver terminal using a code w a according to the relationship w a ( τ ) = c ( τ n ) - a ⋅ prn τ n + T c ̸ 2 - prn τ n - T c ̸ 2 wherein c(τ) is a local replica of the BOC modulated pseudo-random noise code with delay τ n , prn(τ) is a replica of a unmodulated pseudo-random noise code, and a is a predeterminable weight coefficient. Said correlation function is used in an acquisition test function according to the formula x BOC ( n ) - a ⋅ x BOC / PRN ( n + 1 ) - x BOC / PRN n - 1 2 wherein x BOC is the autocorrelation function of the BOC modulated pseudo-random noise code acquired, and x BOC/PRN is the cross correlation function between said acquired BOC modulated pseudo-random noise code and the early and late local replica of the unmodulated pseudo-random noise code, respectively. Said test function is used to recognize a code acquisition, if a value of said test function is higher than a predetermined threshold.
Abstract:
A phase recovery and decoding method for decoding signals (S'(t)) comprising encoded symbols (u k ) over a respective symbol interval (T) which modulate a carrier, for example in a TCM system. The method envisages performing (20 to 26) a phase locking of the signal to be decoded so as to obtain a phase-locked signal which can present, during each symbol interval (T), variations induced by disturbances (noise, fading, etc.). The value attributed to the decoded symbol (U k ) is a function of the value assumed by the phase-locked signal on at least one subinterval of the symbol interval (T), for example located at the end of the symbol interval (T). Alternatively, the value assumed by the phase-locked signal on a plurality of subintervals comprised in each symbol interval (T) is detected (24,32), and a respective majority value of said phase-locked signal within said plurality of subintervals is identified (34,36). A suitable phase recovery and decoding circuit comprises a phase comparator (20), hard decision means (24), an encoder circuit (26), an oscillator (22) and a selection unit (28). For determining decoded value (U k ) and updating the state of the encoder circuit.
Abstract:
In a first step, slot synchronization is obtained by setting in correlation (210, 220) the received signal (r) with a primary sequence (SG), which represents the primary channel (PSC), and by storing said received signal. During a second step, the said correlator (210, 220) is re-used for correlating the received signal (r) with a secondary sequence (SSC) corresponding to the secondary synchronization codes. The correlator (210) is preferably structured in the form of a first filter (210) and of a second filter (220) set in series, which receive a first secondary sequence (SG1) and a second secondary sequence (SG2), typically consisting of Golay sequences. Proposed herein are architectures of a parallel and serial type, as well as architectures designed for re-using further circuit parts. A preferential application is in mobile communication systems based upon standards such as UMTS, CDMA2000, IS95, or WBCDMA.