Abstract: A method is provided for facilitating multicast service. The method may include receiving data multicast to members of a multicast group. The method may further include determining, based at least in part on an indication received during multicast of the data, that a late joining device has joined the multicast group subsequent to initiation of the multicast. The method may additionally include marking, based at least in part on the received indication, a point at which the late joining device began to participate in the multicast. A corresponding apparatus and computer program product are also provided.

Abstract: An approach is provided for relaying signals. A signal is received over a communication link and demodulated. Soft symbols are estimated based on probability information corresponding to the demodulated signal. The demodulated signal is remodulated based on the soft symbols. A relay signal is output based on the remodulated signal.

Abstract: The specification and drawings present a new method, apparatus and software related product (e.g., computer readable memory) for implementing a device-to-device communication of cellular, e.g., LTE, wireless devices on a shared band (e.g., ISM 2.4 GHz band), including the signaling and procedure design for contending or coordinating with the already existing radio systems (e.g., WLAN systems).

Abstract: More than one radio-access technology is supported in an apparatus, and channel-coding functions in the apparatus are shared between at least two of said more than one radio-access technology.

Abstract: The specification and drawings present a new method, apparatus and software related product (e.g., computer readable memory) for implementing a device-to-device communication of cellular, e.g., LTE, wireless devices on a shared band (e.g., ISM 2.4 GHz band), including the signaling and procedure design for contending or coordinating with the already existing radio systems (e.g., WLAN systems).

Abstract: There is provided a mechanism for controlling a transmission of data in a fragmentation transmission mode. When fragments are transmitted in a fragmentation transmission mode, it is determined whether the fragment frame is received successfully or whether an acknowledgment message for confirming a successful transmission of the fragment frame is received. In case the acknowledgment for the successful transmission of the one fragment frame is not received, or the fragment is frame is not successfully received, the fragmentation transmission mode is maintained and a retransmission of the fragment frame is initiated.

Abstract: A method is provided for facilitating multicast service. The method may include receiving data multicast to members of a multicast group. The method may further include determining, based at least in part on an indication received during multicast of the data, that a late joining device has joined the multicast group subsequent to initiation of the multicast. The method may additionally include marking, based at least in part on the received indication, a point at which the late joining device began to participate in the multicast. A corresponding apparatus and computer program product are also provided.

Abstract: An apparatus for trellis-based detection in a communication system including a processor and memory having computer program code configured to construct a trellis representing a transmitted signal formed from a plurality of symbols, each having a constellation size, transmitted by a number of transmit antennas, and form a log likelihood ratio at nodes of the trellis as a log-sum of a number of exponential terms corresponding to a hypothesized transmitted bit value of the plurality of symbols. The number of exponential terms is limited by a number of most likely paths of the trellis extending from each node of the trellis and the constellation size. The processor and memory including computer program code are further configured to form a list at each node of the trellis of a size limited to the number of the most likely paths of the trellis extending from each node of the trellis.

Abstract: An apparatus and method for bit remapping at a relay node in a communication system. In one embodiment, an apparatus includes a processor configured to remap an order of bits of a received signal from a source node to a different order of bits for a transmitted signal to a destination node when the transmitted signal is constructed with a modulation scheme different from the received signal.

Abstract: An apparatus for trellis-based detection in a communication system including a processor and memory having computer program code configured to construct a trellis representing a transmitted signal formed from a plurality of symbols, each having a constellation size, transmitted by a number of transmit antennas, and form a log likelihood ratio at nodes of the trellis as a log-sum of a number of exponential terms including a priori information corresponding to a hypothesized transmitted bit value of the plurality of symbols. The number of exponential terms is limited by a number of most likely paths of the trellis extending from each node of the trellis and the constellation size. The processor and memory including computer program code are configured to form a list at each node of the trellis of a size limited to the number of the most likely paths of the trellis extending from each node.

Abstract: There is provided a mechanism for controlling a transmission of data in a fragmentation transmission mode. When fragments are transmitted in a fragmentation transmission mode, it is determined whether the fragment frame is received successfully or whether an acknowledgment message for confirming a successful transmission of the fragment frame is received. In case the acknowledgment for the successful transmission of the one fragment frame is not received, or the fragment is frame is not successfully received, the fragmentation transmission mode is maintained and a retransmission of the fragment frame is initiated.

Abstract: First and second frames are received by a wireless receiver. Modulation symbols in the first frame are determined and stored. If a cyclic redundancy check failure is determined for the first frame, the frame is not passed to medium access control. Modulation symbols in the second frame are determined and stored and a correlation factor is computed between the at least two modulation symbols from the first frame and the at least two modulation symbols from the second frame. If the receiver determines that the correlation factor exceeds a predefined threshold, it performs maximum ratio combining for modulation symbols from the first frame and modulation symbols from the second frame in order to obtain a combined frame. The combined frame is demodulated and cyclic redundancy check success is determined for the combined frame.

Abstract: Thus, the exemplary embodiments of the invention describe methods, computer program products and apparatus that provide improved quantization, as may be useful within the context of a communication system (e.g., a wireless communication system) that has a relay node. In one non-limiting, exemplary embodiment, a method includes: receiving a transmission having source data from an information source; determining an estimate of the source data using a quantization technique based on maximizing data throughput; and transmitting a message including the determined estimate towards an information destination.

Abstract: An apparatus for trellis-based detection in a communication system including a processor and memory having computer program code configured to construct a trellis representing a transmitted signal formed from a plurality of symbols, each having a constellation size, transmitted by a number of transmit antennas, and form a log likelihood ratio at nodes of the trellis as a log-sum of a number of exponential terms including a priori information corresponding to a hypothesized transmitted bit value of the plurality of symbols. The number of exponential terms is limited by a number of most likely paths of the trellis extending from each node of the trellis and the constellation size. The processor and memory including computer program code are configured to form a list at each node of the trellis of a size limited to the number of the most likely paths of the trellis extending from each node.

Abstract: An apparatus for trellis-based detection in a communication system including a processor and memory having computer program code configured to construct a trellis representing a transmitted signal formed from a plurality of symbols, each having a constellation size, transmitted by a number of transmit antennas, and form a log likelihood ratio at nodes of the trellis as a log-sum of a number of exponential terms corresponding to a hypothesized transmitted bit value of the plurality of symbols. The number of exponential terms is limited by a number of most likely paths of the trellis extending from each node of the trellis and the constellation size. The processor and memory including computer program code are further configured to form a list at each node of the trellis of a size limited to the number of the most likely paths of the trellis extending from each node of the trellis.

Abstract: An approach is provided for relaying signals. A signal is received over a communication link and demodulated. Soft symbols are estimated based on probability information corresponding to the demodulated signal. The demodulated signal is remodulated based on the soft symbols. A relay signal is output based on the remodulated signal.

Abstract: More than one radio-access technology is supported in an apparatus, and channel-coding functions in the apparatus are shared between at least two of said more than one radio-access technology.

Abstract: A QRD-M decomposition includes a first and a sequential second stage, at least. In the first stage, M branches are selected from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated. In the second stage, more than M branches are selected from among those branches entering the second stage as survive branches from which multiple decompositions are calculated. The symbol of the received signal is decided from a branch that is a survive branch of both the first and second stages. The second stage may be within a window that may include additional stages at which the pruning decision down to M survive branches is delayed. One or more windows may be used in a single QRD-M decomposition. In an embodiment, all branches entering the second stage are survive branches. It is shown that the marginal increased computational load increases accuracy.

Abstract: An apparatus and method for bit remapping at a relay node in a communication system. In one embodiment, an apparatus includes a processor configured to remap an order of bits of a received signal from a source node to a different order of bits for a transmitted signal to a destination node when the transmitted signal is constructed with a modulation scheme different from the received signal.

Abstract: A method and transceiver for wireless multicarrier communications. At the transmitter side, conventional OFDM symbols, after inverse fast Fourier Transform, are scrambled in time domain and then guard-interval (GI) inserted, up-converted at the carrier frequency for transmission. At the receiver side, after GI removal and frequency domain channel equalization, the received signal is transformed into time-domain by inverse fast Fourier Transform. The time-domain equalized signal is descrambled in time domain and then transformed back to the frequency domain before it is rate-matched, demodulated and decoded. This time-domain scrambling and descrambling method can be used in a wireless OFDM system such as WLAN, cellular OFDM, and MC-CDMA.