Abstract: A data communication method for puncturing of parity bits defining all parity data for a minimum code rate generated by an encoder is disclosed. The method initializes an accumulator associated with the parity bits to an initial value, and for each parity bit increments the accumulator by a increment value and determines if the accumulator has overflowed. If the accumulator overflows, at least one of the parity bits is selected for transmission.

Abstract: A data communication method for puncturing of parity bits defining all parity data for a minimum code rate generated by an encoder is disclosed. The method initializes an accumulator associated with the parity bits to an initial value, and for each parity bit increments the accumulator by a increment value and determines if the accumulator has overflowed. If the accumulator overflows, at least one of the parity bits is selected for transmission.

Abstract: A data communication method for puncturing of parity bits defining all parity data for a minimum code rate generated by an encoder is disclosed. The method initializes an accumulator associated with the parity bits to an initial value, and for each parity bit increments the accumulator by a increment value and determines if the accumulator has overflowed. If the accumulator overflows, at least one of the parity bits is selected for transmission.

Abstract: A communication structure and method which allows connection-like and connectionless communications to be provided on a multiplexed link is provided. The structure and method can make efficient use of available transmission capacity and/or network resources while providing for both types of communication. Connection-like communications can be provided by a channel having allocated bandwidth dedicated to the communication while connectionless communication can be provided by a shared channel through which data can be transmitted to subscribers. In an embodiment, the shared channel transmits frames of packets addressed to one or more of the subscribers. The frames can have a robustly packaged header that can be received by all subscriber stations serviced by the base station while payload data in the frame can be packaged with a level of robustness appropriate for the intended subscriber station. Different packagings can include different encoding and/or modulation of the payload data.

Abstract: A communication structure and method which allows connection-like and connectionless communications to be provided on a multiplexed link is provided. The structure and method can make efficient use of available transmission capacity and/or network resources while providing for both types of communication. Connection-like communications can be provided by a channel having allocated bandwidth dedicated to the communication while connectionless communication can be provided by a shared channel through which data can be transmitted to subscribers. In an embodiment, the shared channel transmits frames of packets addressed to one or more of the subscribers. The frames can have a robustly packaged header that can be received by all subscriber stations serviced by the base station while payload data in the frame can be packaged with a level of robustness appropriate for the intended subscriber station. Different packagings can include different encoding and/or modulation of the payload data.

Abstract: A data communication method for puncturing of parity bits defining all parity data for a minimum code rate generated by an encoder is disclosed. The method initializes an accumulator associated with the parity bits to an initial value, and for each parity bit increments the accumulator by a increment value and determines if the accumulator has overflowed. If the accumulator overflows, at least one of the parity bits is selected for transmission.

Abstract: A data communication method and system for uniform arbitrary puncturing of parity bits generated by an encoder. The parity bits are stored in a buffer, and an a-bit accumulator is incremented to a predetermined initial value. For each parity bit in the buffer, the following steps are performed: the accumulator is incremented by a predetermined increment value, and if the accumulator overflows, the parity bit is selected for transmission. The predetermined initial value and the predetermined increment value are selected to achieve a desired amount of puncturing. In a further hybrid automatic repeat request (HARQ) communication method and system, the parity bits are generated by a low density parity check (LDPC) coder.

Abstract: A communication structure and method which allows connection-like and connectionless communications to be provided on a multiplexed link is provided. The structure and method can make efficient use of available transmission capacity and/or network resources while providing both types of communication and hybrids. Connection-like communications can be provided by a channel having allocated transmission capacity dedicated to the communication while connectionless communication can be provided by a shared channel through which data can be transmitted to subscribers. In an embodiment, the shared channel transmits frames of packets addressed to one or more of the subscribers. The allocation of transmission capacity between the dedicated channels and the shared channel can be fixed, or can be managed to meet network or network operator requirements. The structure and method can also be managed by the network operator to permit prioritization of some communications over others.

Abstract: A method of, and system for applying frequency-domain equalization in a DS-CDMA system, either by augmenting the transmitted data block before it is scrambled by appending a prefix and a suffix known to or knowable by the receiver or by augmenting the transmitted data block after it is scrambled but prior to transmission so that it has a scrambled cyclic prefix. In the former case, the receiver synthesizes one of the prefix, the data block, or the suffix that would have been received if the augmented transmitted data block after scrambling had had a cyclic prefix.

Abstract: A data communication method and system for uniform arbitrary puncturing of parity bits generated by an encoder. The parity bits are stored in a buffer, and an a-bit accumulator is incremented to a predetermined initial value. For each parity bit in the buffer, the following steps are performed: the accumulator is incremented by a predetermined increment value, and if the accumulator overflows, the parity bit is selected for transmission. The predetermined initial value and the predetermined increment value are selected to achieve a desired amount of puncturing. In a further hybrid automatic repeat request (HARQ) communication method and system, the parity bits are generated by a low density parity check (LDPC) coder.

Abstract: A method and system for decoding is provided. In an aspect of the invention, an iterative method for decoding that utilizes a transformation of probability messages back and forth between formats that allow for the probability messages to be updated using only summation operations, rather than a combination of summation and product operations, thereby offering the ability to reduce the amount of hardware and/or software resources for decoding.