Abstract: An assembly of simultaneously transmitted electrically generated signals, which contains a subset of binary spreading-code sequences that are members of a large set of binary spreading-code sequences available to a particular node of a multi-node communication network. All sequences in the set of spreading-code sequences available to the particular node of the network can be generated by the same configurations of two linear feedback binary shift registers, where feedback taps of the two linear-feedback binary shift registers correspond to primitive polynomials of the same degree over GF(2), the field of two elements.

Abstract: An assembly of simultaneously transmitted electrically generated signals, which contains a subset of binary spreading-code sequences that are members of a larger set of binary spreading-code sequences available to a particular node of a multi-node communication network. All sequences in the set of spreading-code sequences available to the particular node of the network can be generated by the same configuration of two linear-feedback binary shift registers, where feedback taps of the two linear-feedback binary shift registers correspond to primative polynomials of the same degree over GF(2), the field of two elements.

Abstract: An assembly of simultaneously transmitted electrically generated signals, which contains a subset of binary spreading-code sequences that are members of a larger set of binary spreading-code sequences available to a particular node of a multi-node communication network. All sequences in the set of spreading-code sequences available to the particular node of the network can be generated by the same configuration of two linear-feedback binary shift registers, where feedback taps of the two linear-feedback binary shift registers correspond to primative polynomials of the same degree over GF(2), the field of two elements.

Abstract: An assembly of simultaneously transmitted electrically generated signals, which contains a subset of binary spreading-code sequences that are members of a larger set of binary spreading-code sequences available to a particular node of a multi-node communication network. All sequences in the set of spreading-code sequences available to the particular node of the network can be generated by the same configuration of two linear-feedback binary shift registers, where feedback taps of the two linear-feedback binary shift registers correspond to primitive polynomials of the same degree over GF(2), the field of two elements.

Abstract: An assembly of simultaneously transmitted electrically generated signals, which contains a subset of binary spreading-code sequences that are members of a large set of binary spreading-code sequences available to a particular node of a multi-node communication network. All sequences in the set of spreading-code sequences available to the particular node of the network can be generated by the same configurations of two linear feedback binary shift registers, where feedback taps of the two linear-feedback binary shift registers correspond to primitive polynomials of the same degree GF(2), the field of two elements.

Abstract: An assembly of simultaneously transmitted electrically generated signals is disclosed, which contains a subset of binary spreading-code sequences that are members of a larger set of binary spreading-code sequences available to a particular node of a multi-node communication network. All sequences in the set of spreading-code sequences available to the particular node of the network can be generated by the same configuration of two linear-feedback binary shift registers, where feedback taps of the two linear-feedback binary shift registers correspond to primative polynomials of the same degree over GF(2), the field of two elements.

Abstract: An assembly of simultaneously transmitted electrically generated signals, which contains a subset of binary spreading-code sequences that are members of a larger set of binary spreading-code sequences available to a particular node of a multi-node communication network. All sequences in the set of spreading-code sequences available to the particular node of the network can be generated by the same configuration of two linear-feedback binary shift registers, where feedback taps of the two linear-feedback binary shift registers correspond to primative polynomials of the same degree over GF(2), the field of two elements.

Abstract: A method and apparatus for electrically generating sets of binary spreading-code sequences for use in a multi-node communication network. Also, a method for assigning disjoint sets of binary spreading-code sequences to different nodes of such a network. Each set of binary spreading-code sequences consists of multiple sequences, which are generated using two binary shift registers. The sequences can be generated simultaneously, or sequence segments can be generated sequentially. To generate sequences simultaneously, the contents of multiple pairs of stages of two linear-feedback binary shift registers are combined by modulo-2 addition, where each pair of stages consists of one stage from each of the two binary shift registers.

Abstract: A method and apparatus for electrically generating sets of binary spreading-code sequences for use in a multi-node communication network. Also, a method for assigning disjoint sets of binary spreading-code sequences to different nodes of such a network. Each set of binary spreading-code sequences consists of multiple sequences, which are generated using two binary shift registers. The sequences can be generated simultaneously, or sequence segments can be generated sequentially. To generate sequences simultaneously, the contents of multiple pairs of stages of two linear-feedback binary shift registers are combined by modulo-2 addition, where each pair of stages consists of one stage from each of the two binary shift registers.

Abstract: An original signal, different portions of which are captured by two or more different receivers, is reconstructed from the outputs of the various receivers. In a first embodiment, signal reconstruction is achieved by first converting the analog receiver outputs into digital signals and then shifting the frequency of at least one of the digital signals such that a frequency difference is introduced between at least two of the digital signals. Thereafter, each digital signal is processed through a corresponding filter (38, 40) to derive filtered signals. These filtered signals are combined to derive a primary output signal which is a representation of the original signal. After the primary output signal is derived, it is passed on to an error determiner (44) where an error component is computed. This error component is used to adjust the parameters of the filters (38, 40) in such a manner as to reduce the error component.

Abstract: A detector of a multiple-sequence spread spectrum signal uses a Hadamard transform (106) to simultaneously correlate a received signal comprising two sequences (64) with a plurality of candidate sequences. The received signal is stripped of the first sequence (65, 66), and the signal is permuted (via a table lookup) (104). A Hadamard transform is performed on the permuted data and the candidate sequences (106). After transformation, the data is permuted again (112 ) to determine the symbol (sequence) transmitted. Alternatively, Fast Fourier Transforms (FFTs) (FIG. 3), Winograd Fourier Transform Algorithms (WFTA), or other cyclic correlation algorithms (FIG. 5) may be used to compute the transformation. In a preferred embodiment, a "pilot" signal is transmitted in quadrature (90 degrees phase offset) with an information-bearing signal. And, a block error correcting code (150) (e.g., a modified Reed-Solomon code) is transmitted with the information-bearing signal a(t).

Abstract: A method and apparatus for electrically generating sets of binary spreading-code sequences for use in a multi-node communication network are disclosed. A method for assigning disjoint sets of binary spreading-code sequences to different nodes of such a network is also disclosed. Each set of binary spreading-code sequences consists of multiple sequences, which are generated using two binary shift registers. The sequences can be generated simultaneously, or sequence segments can be generated sequentially. To generate sequences simultaneously, the contents of multiple pairs of stages of two linear-feedback binary shift registers are combined by modulo-2 addition, where each pair of stages consists of one stage from each of the two binary shift registers.

Abstract: A method and apparatus for communication in a spread spectrum network are disclosed. Blocks of bits embodying information are assigned to corresponding subsets of binary spreading code sequences and at least one of the subsets of binary spreading code sequences contains more than one binary spreading code sequence. Selected subsets of the binary spreading code sequences are then simultaneously transmitted from a transmitting node to a receiving node.