PROCEDURE FOR JAMMER DETECTION
    87.
    发明专利

    公开(公告)号:AU2003268241A1

    公开(公告)日:2004-03-19

    申请号:AU2003268241

    申请日:2003-08-28

    Applicant: QUALCOMM INC

    Abstract: A method of and system for detecting whether a peak of a correlation function derived from a received signal is due to a jammer. The peak is within a localized portion of the correlation function which has a total number of peaks. In one embodiment, the total number of peaks is compared to a threshold number of peaks, and the peak is identified as being due to a jammer if the total number of peaks equals or exceeds a threshold number of peaks. In a second embodiment, the peak energy in relation to a noise estimate for the localized portion of the correlation function is compared to a jammer threshold. The peak is identified as being due to a jammer if the peak energy in relation to the noise estimate is less than or equal to the jammer threshold.

    88.
    发明专利
    未知

    公开(公告)号:BR9915926A

    公开(公告)日:2002-01-15

    申请号:BR9915926

    申请日:1999-12-03

    Applicant: QUALCOMM INC

    Abstract: A turbo code interleaver (100) using linear congruential sequences may be employed as a two-dimensional interleaver (16) in a turbo coder (10) that also includes first and second constituent encoders (12, 14). The interleaver (16) and the first encoder (12) are each configured to receive input bits. The first encoder (12) produces output symbols (22, 24) therefrom. The interleaver (16) receives the input bits (20) sequentially by row. A linear congruential sequence recursion algorithm within the interleaver (16) serves to pseudo-randomly rearrange, or shuffle, the bits within each row of the interleaver (16). The bits (26) are then output from the interleaver sequentially by column. The second encoder (14) is configured to receive the interleaved bits from the interleaver. The second encoder (14) produces output symbols (28) therefrom.; The two streams of output symbols (22, 24) are multiplexed together, with appropriate puncturing. If desired, the linear congruential recursion sequence can be generated in reverse. Also if desired, a bit reversal technique can be used in the interleaver (16) to rearrange, or shuffle, the rows of the interleaver (16).

    Turbo code interleaver using linear congruential sequences

    公开(公告)号:AU1931500A

    公开(公告)日:2000-06-26

    申请号:AU1931500

    申请日:1999-12-03

    Applicant: QUALCOMM INC

    Abstract: A turbo code interleaver (100) using linear congruential sequences may be employed as a two-dimensional interleaver (16) in a turbo coder (10) that also includes first and second constituent encoders (12, 14). The interleaver (16) and the first encoder (12) are each configured to receive input bits. The first encoder (12) produces output symbols (22, 24) therefrom. The interleaver (16) receives the input bits (20) sequentially by row. A linear congruential sequence recursion algorithm within the interleaver (16) serves to pseudo-randomly rearrange, or shuffle, the bits within each row of the interleaver (16). The bits (26) are then output from the interleaver sequentially by column. The second encoder (14) is configured to receive the interleaved bits from the interleaver. The second encoder (14) produces output symbols (28) therefrom.; The two streams of output symbols (22, 24) are multiplexed together, with appropriate puncturing. If desired, the linear congruential recursion sequence can be generated in reverse. Also if desired, a bit reversal technique can be used in the interleaver (16) to rearrange, or shuffle, the rows of the interleaver (16).

    TURBO CODE INTERLEAVER USING LINEAR CONGRUENTIAL SEQUENCES

    公开(公告)号:CA2353455A1

    公开(公告)日:2000-06-15

    申请号:CA2353455

    申请日:1999-12-03

    Applicant: QUALCOMM INC

    Abstract: A turbo code interleaver (100) using linear congruential sequences may be employed as a two-dimensional interleaver (16) in a turbo coder (10) that al so includes first and second constituent encoders (12, 14). The interleaver (16 ) and the first encoder (12) are each configured to receive input bits. The first encoder (12) produces output symbols (22, 24) therefrom. The interleav er (16) receives the input bits (20) sequentially by row. A linear congruential sequence recursion algorithm within the interleaver (16) serves to pseudo- randomly rearrange, or shuffle, the bits within each row of the interleaver (16). The bits (26) are then output from the interleaver sequentially by column. The second encoder (14) is configured to receive the interleaved bit s from the interleaver. The second encoder (14) produces output symbols (28) therefrom. The two streams of output symbols (22, 24) are multiplexed together, with appropriate puncturing. If desired, the linear congruential recursion sequence can be generated in reverse. Also if desired, a bit reversal technique can be used in the interleaver (16) to rearrange, or shuffle, the rows of the interleaver (16).

Patent Agency Ranking