Abstract: Techniques for secure public exposure of digital data include extracting first digital data comprising one or more batches, each batch comprising a plurality of no more than a number T of packets, each packet containing a plurality of a number n of bits. A random binary matrix CK consisting of T rows and n columns is generated. For a first batch, a first random n-bit temporary key is generated and positions of the nT elements of matrix CK are randomized to produce matrix CK(RP). For a packet in the first batch, a first packet vector key is generated based on non-overlapping pairs of bit positions for both the temporary key and for a first packet-corresponding row of matrix CK(RP). An encrypted packet is generated for the packet based on the packet and the first packet vector key. The encrypted packet is exposed publicly.

Abstract: Techniques for secure public exposure of digital data include extracting first digital data comprising one or more batches, each batch comprising a plurality of no more than a number T of packets, each packet containing a plurality of a number n of bits. A random binary matrix A consisting of T rows and n columns is generated. For a first batch, a first random n-bit temporary key is generated. For a packet in the first batch, a first packet vector key is generated based on random non-overlapping pairs of bit positions for both the temporary key and for a first packet-corresponding row of matrix A. An encrypted packet is generated for the packet based on the packet and the first packet vector key. The encrypted packet is exposed publicly.

Abstract: Techniques for secure public exposure of digital data include extracting n chunks, each containing Q bits, n=2(Q+1). A random mapping of each chunk to only one batch of M numbered batches is determined and stored securely. A bit based on a random key is combined at a location based on batch number with each of the chunks in the batch to produce a batch of enhanced chunks, each containing Q+1 bits. This is repeated with each non-overlapping batch of chunks, each enhanced chunk of the batch having one bit based on a different bit from the key. A unique set of the enhanced chunks is combined with a XOR to produce an encoded chunk, every bit of which is based on a bit from the key. An encoding vector B that indicates the unique set is stored securely. The encoded chunk can be safely exposed publically.

Abstract: Techniques for secure public exposure of digital data include extracting first digital data comprising one or more batches, each batch comprising a plurality of no more than a number T of packets, each packet containing a plurality of a number n of bits. A random binary matrix CK consisting of T rows and n columns is generated. For a first batch, a first random n-bit temporary key is generated and positions of the nT elements of matrix CK are randomized to produce matrix CK(RP). For a packet in the first batch, a first packet vector key is generated based on non-overlapping pairs of bit positions for both the temporary key and for a first packet-corresponding row of matrix CK(RP). An encrypted packet is generated for the packet based on the packet and the first packet vector key. The encrypted packet is exposed publicly.

Abstract: Techniques for secure public exposure of digital data include extracting n chunks, each containing Q bits, n=2(Q+1). A random mapping of each chunk to only one batch of M numbered batches is determined and stored securely. A bit based on a random key is combined at a location based on batch number with each of the chunks in the batch to produce a batch of enhanced chunks, each containing Q+1 bits. This is repeated with each non-overlapping batch of chunks, each enhanced chunk of the batch having one bit based on a different bit from the key. A unique set of the enhanced chunks is combined with a XOR to produce an encoded chunk, every bit of which is based on a bit from the key. An encoding vector B that indicates the unique set is stored securely. The encoded chunk can be safely exposed publically.

Abstract: Techniques for secure public exposure of digital data include extracting first digital data comprising one or more batches, each batch comprising a plurality of no more than a number T of packets, each packet containing a plurality of a number n of bits. A random binary matrix A consisting of T rows and n columns is generated. For a first batch, a first random n-bit temporary key is generated. For a packet in the first batch, a first packet vector key is generated based on random non-overlapping pairs of bit positions for both the temporary key and for a first packet-corresponding row of matrix A. An encrypted packet is generated for the packet based on the packet and the first packet vector key. The encrypted packet is exposed publicly.

Abstract: A wireless base station having K antennas communicates with M mobile devices using multiuser diversity scheme with opportunistic interference management. The base station transmits K distinct pilot signals from K corresponding antennas and receives feedback from mobile devices. The feedback from each device indicates a strong pilot signal and a weak pilot signal received from the K distinct pilot signals. Using these indications, the base station assigns each of the K antennas to a mobile device. The base station then transmits distinct data streams to the mobile devices using the corresponding antennas assigned to the corresponding mobile devices. The transmission may include multiplying the transmitted distinct data streams by a vector V orthogonal to a vector U, thereby allowing mobile devices not assigned to an antenna to cancel the transmitted distinct data streams.

Abstract: The present invention provides a method, data modulator, modem, computer readable medium and system for allocating bits to sub-carriers of data channel frequencies for spectrally efficient full-duplex transmission. Bits are allocated successively to a plurality of sub-carriers for a data channel based on minimal power consumption, a power mask for each sub-carrier, a bit capacity of each sub-carrier, and a predetermined data rate. Allocation of bits is ceased when at least one of: a predetermined total power budget has been substantially exhausted, power masks for the plurality of sub-carriers have been substantially exhausted, bit capacities for the plurality of sub-carriers have been substantially exhausted, and the predetermined data rate has been reached.

Abstract: A wireless base station having K antennas communicates with M mobile devices using multiuser diversity scheme with opportunistic interference management. The base station transmits K distinct pilot signals from K corresponding antennas and receives feedback from mobile devices. The feedback from each device indicates a strong pilot signal and a weak pilot signal received from the K distinct pilot signals. Using these indications, the base station assigns each of the K antennas to a mobile device. The base station then transmits distinct data streams to the mobile devices using the corresponding antennas assigned to the corresponding mobile devices. The transmission may include multiplying the transmitted distinct data streams by a vector V orthogonal to a vector U, thereby allowing mobile devices not assigned to an antenna to cancel the transmitted distinct data streams.

Abstract: The present invention provides a method, data modulator, modem, computer readable medium and system for allocating bits to sub-carriers of data channel frequencies for spectrally efficient full-duplex transmission. Bits are allocated successively to a plurality of sub-carriers for a data channel based on minimal power consumption, a power mask for each sub-carrier, a bit capacity of each sub-carrier, and a predetermined data rate. Allocation of bits is ceased when at least one of: a predetermined total power budget has been substantially exhausted, power masks for the plurality of sub-carriers have been substantially exhausted, bit capacities for the plurality of sub-carriers have been substantially exhausted, and the predetermined data rate has been reached.

Abstract: The present invention provides a method, data modulator, modem, computer readable medium and system for allocating bits to sub-carriers of data channel frequencies for spectrally efficient full-duplex transmission. Bits are allocated successively to a plurality of sub-carriers for a data channel based on minimal power consumption, a power mask for each sub-carrier, a bit capacity of each sub-carrier, and a predetermined data rate. Allocation of bits is ceased when at least one of: a predetermined total power budget has been substantially exhausted, power masks for the plurality of sub-carriers have been substantially exhausted, bit capacities for the plurality of sub-carriers have been substantially exhausted, and the predetermined data rate has been reached.

Abstract: A method and apparatus to transmit turbo-encoded data in a multitone channel assigns the original data and selected parity bits across multitone subchannels allowing transmission of an entire turbo-encoded block withing one or few symbol time frame. Parity bits are selected by a procedure using data derived by optimization using simulation of a single-channel system. The optimization determines, for a specified bit error rate, for each possible number of information bits per symbol, the code rate corresponding to the lowest signal-to-noise ratio. Alternatively, in the simulation non-identical integer values may be applied to the channels to approximate non-integer values of code rate and information bits-per-channel in the aggregate. The optimized data are used to determine an optimal code rate and SNR for each channel.

Abstract: The present invention provides a method, data modulator, modem, computer readable medium and system for allocating bits to sub-carriers of data channel frequencies for spectrally efficient full-duplex transmission. Bits are allocated successively to a plurality of sub-carriers for a data channel based on minimal power consumption, a power mask for each sub-carrier, a bit capacity of each sub-carrier, and a predetermined data rate. Allocation of bits is ceased when at least one of: a predetermined total power budget has been substantially exhausted, power masks for the plurality of sub-carriers have been substantially exhausted, bit capacities for the plurality of sub-carriers have been substantially exhausted, and the predetermined data rate has been reached.

Abstract: A method and apparatus to transmit turbo-encoded data in a multitone channel assigns the original data and selected parity bits across multitone subchannels allowing transmission of an entire turbo-encoded block withing one or few symbol time frame. Parity bits are selected by a procedure using data derived by optimization using simulation of a single-channel system. The optimization determines, for a specified bit error rate, for each possible number of information bits per symbol, the code rate corresponding to the lowest signal-to-noise ratio. Alternatively, in the simulation non-identical integer values may be applied to the channels to approximate non-integer values of code rate and information bits-per-channel in the aggregate. The optimized data are used to determine an optimal code rate and SNR for each channel. In assigning the respective bits to the channels, the number of parity bits in each channel are shared.

Abstract: A method and apparatus to transmit turbo-encoded data in a multitone channel assigns the original data and selected parity bits across multitone subchannels allowing transmission of an entire turbo-encoded block withing one or few symbol time frame. Parity bits are selected by a procedure using data derived by optimization using simulation of a single-channel system. The optimization determines, for a specified bit error rate, for each possible number of information bits per symbol, the code rate corresponding to the lowest signal-to-noise ratio. Alternatively, in the simulation non-identical integer values may be applied to the channels to approximate non-integer values of code rate and information bits-per-channel in the aggregate. The optimized data are used to determine an optimal code rate and SNR for each channel.

Abstract: The present invention provides a method, a computer medium, and a device for a two stage S_Random interleaver that is constructed based on two optimization criteria. The distance spectrum properties of the code are maximized by designing an interleaver that increases the minimum effective free distance of the code. In addition, the interleaver is designed to reduce the correlation properties of the extrinsic information that is fed into the next stage decoder. Thus, the present invention utilizes the reduced correlation properties to provide a more efficient S-random interleaver with increased iterations, thus maximizing the bit error rate (BER) performance of the code with respect to iterative decoding.

Abstract: A method and apparatus to transmit turbo-encoded data in a multitone channel assigns the original data and selected parity bits across multitone subchannels allowing transmission of an entire turbo-encoded block within one or few symbol time frame. Parity bits are selected by a procedure using data derived by optimization using simulation of a single-channel system. The optimization determines, for a specified bit error rate, for each possible number of information bits per symbol, the code rate corresponding to the lowest signal-to-noise ratio. Alternatively, in the simulation non-identical integer values may be applied to the channels to approximate non-integer values of code rate and information bits-per-channel in the aggregate. The optimized data are used to determine an optimal code rate and SNR for each channel.

Abstract: In a discrete multi-tone modem, a method of minimizing cross talk over a twisted pair of a twisted pair cable binder in which discrete multi-tone data transmission is utilized comprises the steps of one of jointly minimizing near end cross talk while maximizing total data rate, jointly minimizing an arbitrary function of total power while maximizing total data rate and minimizing total near end cross talk for a given data rate, selecting a function to be optimized and performing a bit and power allocation algorithm responsive to the selected function. The process may be combined with known optimization functions such as jointly minimizing an average bit error rate while maximizing the data rate. As a result, the process is considerably more flexible and adaptable to changing parameters such as environmental parameters impacting data transmission performance in the presence of cross talk.

Abstract: In a discrete multi-tone modem, a method of minimizing cross talk over a twisted pair of a twisted pair cable binder in which discrete multi-tone data transmission is utilized comprises the steps of one of jointly minimizing near end cross talk while maximizing total data rate, jointly minimizing an arbitrary function of total power while maximizing total data rate and minimizing total near end cross talk for a given data rate, selecting a function to be optimized and performing a bit and power allocation algorithm responsive to the selected function. The process may be combined with known optimization functions such as jointly minimizing an average bit error rate while maximizing the data rate. As a result, the process is considerably more flexible and adaptable to changing parameters such as environmental parameters impacting data transmission performance in the presence of cross talk.

Abstract: A method and apparatus to transmit turbo-encoded data in a multitone channel assigns the original data and selected parity bits across multitone subchannels allowing transmission of an entire turbo-encoded block withing one or few symbol time frame. Parity bits are selected by a procedure using data derived by optimization using simulation of a single-channel system The optimization determines, for a specified bit error rate, for each possible number of information bits per symbol, the code rate corresponding to the lowest signal-to-noise ratio. Alternatively, in the simulation non-identical integer values may be applied to the channels to approximate non-integer values of code rate and information bits-per-channel in the aggregate. The optimized data are used to determine an optimal code rate and SNR for each channel. In assigning the respective bits to the channels, the number of parity bits in each channel are shared.