# Patent

## Title
Joint source channel decoding using parameter domain correlation

## Abstract

Methods, systems, and apparatuses are provided for performing joint source channel decoding in a manner that exploits parameter domain correlation. Redundancy in speech coding and packet field parameters is exploited to generate conditional probabilities that a decoder utilizes to perform joint source channel decoding. The conditional probabilities are based upon correlations of parameters of a current frame with parameters of the same or other frames or historical parameter data. Parameter domain correlation provides significant channel decoding improvement over prior bit domain solutions. Also provided are methods, systems, and apparatuses for utilizing received statistics of monitored data bits from which conditional probabilities are generated to perform channel decoding. The techniques described may be implemented at the decoder side and thus do not interfere with transmission standards.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation of U.S. patent application Ser. No. 13/925,616, filed Jun. 24, 2013, U.S. patent application Ser. No. 13/925,616 claims priority to U.S. Provisional Patent Application No. 61/835,944, filed Jun. 17, 2013, and is a continuation in part of U.S. patent application Ser. No. 13/748,904, filed on Jan. 24, 2013. U.S. patent application Ser. No. 13/784,904 claims priority to the following provisional applications: U.S. Provisional Patent Application No. 61/590,015, filed Jan. 24, 2012, U.S. Provisional Patent Application No. 61/706,328, filed Sep. 27, 2012, and U.S. Provisional Patent Application No. 61/752,320, filed Jan. 14, 2013. Each of the above-referenced applications is incorporated by reference herein in its entirety.
This application is also related to the following U.S. patent applications, each of which also claims the benefit of U.S. Provisional Patent Application Nos. 61/590,015 and 61/706,328, and each of which is incorporated by reference herein in its entirety:
U.S. patent application Ser. No. 13/749,064, filed on Jan. 24, 2013;
U.S. patent application Ser. No. 13/749,187, filed on Jan. 24, 2013; and
U.S. patent application Ser. No. 13/748,949, filed on Jan. 24, 2013.


BACKGROUND
1. Technical Field
The subject matter described herein relates to systems and methods for performing joint source channel decoding.
2. Background Art
The concept of channel capacity was introduced in C. E. Shannon, “A Mathematical Theory of Communication,” Bell System Technical Journal, vol. 27, pp. 379-423 and 623-656, July and October, 1948. In this work, Shannon stated that a source with entropy H can be reliably transmitted over a channel with capacity C as long as H<=C. Shannon also introduced the Separation Theorem which stated that the maximum capacity is achievable by treating the source and channel independently. In accordance with this model, and referring to FIG. 1, a source coder is first applied to reduce the rate down to H, and a channel code is subsequently applied (e.g., in a system 102). At the receiver, the channel decoder is unaware of the type of source and outputs the most probable codeword (e.g., in system 102). The source decoder then reconstructs the source without any knowledge of the source statistics (e.g., in system 102).
However, Shannon's Separation Theorem only holds true in the case of infinite complexity and delay, as well as a non time varying (AWGN) channel. When operating with finite complexity and delay on a channel that may vary in time (fading), better performance is generally achievable by jointly optimizing the source and channel coder. In Joint Source-Channel Coding (JSCC), the source and channel are jointly encoded, while in Joint Source-Channel Decoding (JSCD), the source and channel are jointly decoded. These cases are depicted in FIG. 1 as systems 104 and 106, respectively. Of course, a system may also employ both JSCC and JSCD. However, most communications systems employed to date employ little JSCC or no JSCC. Significant gains can still be achieved in these systems by incorporating JSCD.
BRIEF SUMMARY
Methods, systems, and apparatuses are described for performing joint source channel decoding in a manner that exploits parameter domain correlation, substantially as shown in and/or described herein in connection with at least one of the figures, as set forth more completely in the claims.



BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES
The accompanying drawings, which are incorporated herein and form a part of the specification, illustrate embodiments and, together with the description, further serve to explain the principles of the embodiments and to enable a person skilled in the pertinent art to make and use the embodiments.
FIG. 1 is a systems block diagram of various encoding and decoding implementations.
FIG. 2 is a block diagram of a portion of a long term evolution standard receiver architecture, according to an exemplary embodiment.
FIG. 3 is a block diagram of a portion of a jitter buffer enhanced JSCD implementation, according to another exemplary embodiment.
FIG. 4A is a flowchart of a method for performing jitter buffer enhanced joint source channel decoding, according to an exemplary embodiment.
FIG. 4B is a flowchart of a method for performing jitter buffer enhanced joint source channel decoding, according to an exemplary embodiment.
FIG. 5 is a block diagram of a portion of a JSCD implementation, according to an exemplary embodiment.
FIG. 6 is a flowchart of a method for performing joint source channel decoding using parameter-based correlation, according to an exemplary embodiment.
FIG. 7 is a flowchart of a method for performing joint source channel decoding using parameter-based correlation, according to an exemplary embodiment.
FIG. 8 is a flowchart of a method for performing joint source channel decoding using parameter-based correlation, according to an exemplary embodiment.
FIG. 9 is a block diagram of a computer system, according to an exemplary embodiment.



Embodiments will now be described with reference to the accompanying drawings. In the drawings, like reference numbers indicate identical or functionally similar elements. The left-most digit(s) of a reference number identifies the drawing in which the reference number first appears.
DETAILED DESCRIPTION
1. Introduction
The present specification discloses numerous example embodiments. The scope of the present patent application is not limited to the disclosed embodiments, but also encompasses combinations of disclosed embodiments, as well as modifications to disclosed embodiments.
References in the specification to “one embodiment,” “an embodiment,” “an example embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.
Furthermore, terminology used herein to refer to decoder decisions and other information as “hard” refers to whether the decision or information represents actual, perceived data bits (e.g., a ‘1’ (logical high signal value) or a ‘0’ (logical low signal value)). The “hard” values are the actual data bits and/or what a decoder has determined the actual data bits to be. Terminology used herein to refer to decoder decisions and other information as “soft” refers to whether the decision or information are representations of the probability (e.g., conditional probability) and/or the likelihood of a given bit in the data stream being a ‘1’ or a ‘0’. “Soft bits,” for example, may be represented as a decimal number with a theoretical range between 0 and 1 (e.g., 0.2138 or 0.9853) for a probability, where a value less than 0.5 indicates a likelihood of the actual data bit (i.e., “hard bit”) being a ‘0’, while a value greater than 0.5 indicates a likelihood of the actual data bit (i.e., “hard bit”) being a ‘1’ (a value of 0.5 indicates an equal probability of ‘0’ or ‘1’). Similarly, a “soft bit” value may theoretically range from −∞ (negative infinity) to +∞ (positive infinity) for a log likelihood ratio (LLR), where a value less than zero indicates a likelihood of a ‘0’, a value greater than zero indicates a likelihood of a ‘1’, and a value of zero indicates an equal likelihood of a ‘0’ or a ‘1’. For probabilities and LLRs, the probabilities and likelihoods are stronger for a given data stream bit value (a ‘1’ or a ‘0’) as a probability or LLR approaches the theoretical limits (high or low) of their respective ranges. Still further, references in the specification to “extrinsics,” “extrinsic data,” or “extrinsic information” refer to information derived from redundant information in the code (e.g., data and parity bits, and/or the like). “Extrinsic information” is used by decoders to facilitate channel decoding, as described herein. Still further, terminology used herein such as “about,” “approximately,” and “substantially” have equivalent meanings and may be used interchangeably.
Numerous exemplary embodiments are now described. Any section/subsection headings provided herein are not intended to be limiting. Embodiments are described throughout this document, and any type of embodiment may be included under any section/subsection. Furthermore, disclosed embodiments may be combined with each other in any manner.
2. Example Embodiments
The examples described herein may be adapted to various types of wired and wireless communications systems, computing systems, communication devices, and/or the like, which include encoders and/or decoders. Furthermore, additional structural and operational embodiments, including modifications/alterations, will become apparent to persons skilled in the relevant art(s) from the teachings herein.
In embodiments, communication systems may be based on the Long Term Evolution (LTE) IP-based standard for wireless data communications. LTE provides high access rates, low latencies, reduced data delivery costs, and simplification of network architecture. LTE is a packet-based network as opposed to a circuit-switched based network in 2nd Generation and 3rd Generation systems. As a result, packets incur delay and jitter, arriving with varying amounts of delay and potentially out of order. To combat this, LTE receivers employ a jitter buffer, similar to Voice over Internet Protocol (VoIP) based telephony. The jitter buffer holds received, channel decoded packets for an adjustable amount of time before playback. Packets arriving late but within the jitter buffer holding time are played back, and out-of-order packets can be re-ordered. The penalty associated with this is increased delay incurred by the jitter buffer. Typically, the jitter buffer delay is slowly adjusted according to the jitter recently observed in incoming packets.
Embodiments may also provide Voice over LTE (VoLTE) services that are implemented as VoIP, which is supported by the IP Multimedia Subsystem (IMS) with specific profiles for control and media planes of voice service defined by Global System for Mobile Communications Association (GSMA) in Permanent Reference Document (PRD) IR.92 titled “IMS Profile for Voice and SMS” (v4.0, Mar. 22, 2011) (hereinafter “IR.92”).
Communication system bandwidth used by data applications may in many cases be greater than the bandwidth for voice calls, but voice applications remain an important part of communication system utilization. It follows then that voice quality will remain a very important metric to consumers and companies which provide services and products. The embodiments described herein (e.g., for VoLTE) provide improved voice quality, decreased packet loss rates, and reduced channel noise for communication systems without undue decreases in network capacity and/or increased power consumption.
LTE communication systems may encode and decode data that is transmitted on communication channels using turbo coding. Example embodiments described herein based on turbo coding in LTE take advantage of jitter buffer enhanced joint source channel decoding (JSCD) as well as redundancies and correlations present in VoLTE. For example, data may be encoded using joint source channel coding (JSCC). This particular type of encoder may be paired with a jitter buffer enhanced JSCD turbo decoder for decoding purposes. In JSCC, the source (e.g., speech related data) and channel (e.g., packet related data) are jointly encoded. In JSCD, the source and channel are jointly decoded. Embodiments described herein may implement JSCD even without JSCC. JSCD as described in the example embodiments may allow for an optimized channel capacity while providing joint decoding benefits such as improved communication efficiency, data integrity, and performance as well as adherence to VoLTE standards.
Turbo decoding generates a soft bit decision representation of the data bits in a data stream that represents the likelihood of a given bit in the data being a logical “1” or a logical “0”. These likelihoods may be presented as a ratio of probabilities, as will be discussed in further detail below. In example embodiments, a turbo decoder may include two or more decoders which work cooperatively in order to refine and improve the estimate of the original data bits over one or more iterations until the soft decisions converge on a stable set of values or until the preset maximum number of iterations is reached. The decoders may be based on the MAP (maximum a-posteriori probability) algorithm and may output the soft decision information determined from received data and corresponding parity bits. The converged soft decisions may then be used to recover the original binary data sequence. The recovered data sequences may be stored as hard bits in a jitter buffer before being processed by a speech decoder.
Embodiments presented herein improve JSCD by exploiting parameter-based (parameter domain) correlation. The embodiments presented herein may exploit parameter domain correlation with respect to various types of parameters in voice data packets, such as, but not limited to speech coding parameters and packet header parameters.
Embodiments presented herein also improve JSCD by exploiting delay in the jitter buffer. The embodiments presented herein may exploit jitter buffer delay by delaying the performance of JSCD for data packets that have failed a previous channel decoding operation and allowing additional frames (including future frames) to arrive and be used for JSCD. The embodiments presented herein may also exploit jitter buffer delay through techniques used in JSCD to derive extrinsics from a-priori information in a source signal. For instance, the techniques described herein are applicable to source signals such as speech, streaming video, gaming, and/or other applications where the source is predictable from past and future information. Indeed, the described jitter buffer enhanced techniques may be applied to all traffic if header information is considered. The techniques described herein may be used in conjunction with correlation of bits and/or parameters in source signals. In some exemplary embodiments, jitter buffer delay may be exploited in conjunction with correlation of various types of parameters in voice data packets, such as, but not limited to, speech coding parameters and packet header parameters. While, for illustrative purposes, various embodiments described herein refer to parameter-based correlation techniques, contemplated implementations of jitter buffer enhanced JSCD described herein are not so limited. As an illustrative example of jitter buffer enhanced JSCD, consider a series of frames in which JSCD with parameter domain correlation for pitch is utilized. In a sample where the speech signal goes from a noisy unpredictable waveform (e.g., unvoiced speech) to periodic (e.g., voiced speech), the pitch in the unvoiced section is random and uncorrelated with the pitch in the voiced speech. At the onset of the voiced signal, using only past speech will lead to a very poor prediction of the pitch. If future frames were available using jitter buffer enhanced JSCD, the pitch could be more accurately predicted. In another example, consider a voiced section of speech with a pitch contour of {40, 40, 44, 48, . . . }. In the case where the frame with pitch=44 is lost, using only past pitch values gives no indication that the pitch is increasing and will likely result in a pitch prediction of around ‘40’. However, if a future frame value (e.g., ‘48’) is available, using simple interpolation would predict the exact pitch value of ‘44’.
In a case of predicting the contents of a packet header, various headers in the LTE protocol stack contain a sequence number (SN). For example, the PDCP layer contains a 7-bit SN and the RLC layer contains a 5-bit SN. While in most cases a previous packet with SN=n allows for the prediction of the next packet be SN=n+1, as previously mentioned, packets in an IP network may arrive out of order. If all previous packets are accounted for, the next packet may have SN=n+m, where m>0 and the probability of each m depends on the current jitter statistics in the network. For simplicity in this example, assume that m>2 is highly unlikely. Hence, packets are out of order by at most one packet. If packets arrive out of order, observing packet SN=n+1 in the jitter buffer indicates with high likelihood that the current packet is SN=n+2.
While prediction of the sequence number with an error of 1 may not be an overly complex concept, the equivalent binary prediction illuminates complicating subtleties. For the RLC layer case, the SN has a range of 0-31. Once 31 is reached, the SN goes back to 0. In the worst case, the out of sequence error occurs when SN=31. In this case, predicting that SN=31 is problematic because it is equal to SN=0. In binary, ‘31’=11111 and ‘0’=00000. An error of a single value results in the incorrect prediction of all five binary values. Likewise, four bits will be incorrectly predicted at ‘15,’ three bits at ‘7,’ and two bits at ‘3’. Similar prediction issues exist with other header fields where knowledge of the future and the past values greatly improves the prediction confidence of the current packet. Likewise, speech parameters in addition to pitch also benefit from knowledge of both past and future values. The techniques described herein provide for such improvements in prediction.
For instance, methods, systems, and apparatuses are provided for jitter buffer enhanced joint source channel decoding. In an example aspect, a method is disclosed. The method includes storing a plurality of hard bits in a first memory buffer. The method also includes storing a plurality of soft bits in a second memory buffer. The method further includes performing joint source channel decoding on a first subset of the plurality of soft bits based upon one or more of at least a portion of the plurality of hard bits and a second subset of the plurality of soft bits. The first subset is associated with a first segment of an audio signal, and the one or more of at least a portion of the plurality of hard bits and the second subset are associated with a second segment of the audio signal that was generated subsequent to the first segment.
In another example aspect, a method is disclosed. The method includes storing a plurality of hard bits in a first memory buffer, and also includes storing a plurality of soft bits in a second memory buffer, the plurality of soft bits comprising two or more subsets of soft bits. The method further includes performing joint source channel decoding on each of the two or more subsets based upon at least a portion of the plurality of hard bits and each other subset. A first subset of the two or more subsets is associated with a first segment of an audio signal. One or more of the at least a portion of the plurality of hard bits and a second subset of the two or more subsets are associated with a second segment of the audio signal that was generated subsequent to the first segment.
In yet another example aspect, a system is disclosed that includes a first memory buffer, a second memory buffer, and a channel decoder. The first memory buffer is configured to store a plurality of hard bits. The second memory buffer is configured to store a plurality of soft bits. The channel decoder is configured to perform joint source channel decoding on a first subset of the plurality of soft bits based upon one or more of at least a portion of the plurality of hard bits and a second subset of the plurality of soft bits. The first subset is associated with a first segment of an audio signal, and the one or more of at least a portion of the plurality of hard bits and the second subset of the plurality of soft bits are associated with a second segment of the audio signal that was generated subsequent to the first segment.
In yet another example aspect, a method for performing joint source channel decoding in a communication device is disclosed. The method includes receiving a first plurality of soft bits representative of a first parameter included in a frame, each soft bit of the first plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one, the first parameter comprising a plurality of bits in the frame. The method also includes generating a second plurality of soft bits representative of the first parameter based on the first plurality of soft bits and at least one conditional probability based at least on a correlation of the first parameter and one or more other parameters included in the first frame and/or one or more parameters included in other frames, each soft bit of the second plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one. The method further includes providing the second plurality of soft bits to a first channel decoder.
In yet another example aspect, a system is disclosed. The system includes a first channel decoder and a packet redundancy analyzer. The packet redundancy analyzer is configured to receive a first plurality of soft bits representative of a first parameter included in a frame, each soft bit of the first plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one, the first parameter comprising a plurality of bits in the frame. The packet redundancy analyzer is further configured to generate a second plurality of soft bits representative of the first parameter based on the first plurality of soft bits and at least one conditional probability based at least on a correlation of the first parameter and one or more other parameters included in the first frame and/or one or more parameters included in other frames, each soft bit of the second plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one, and provide the second plurality of soft bits to the first channel decoder.
In yet another example aspect, a method for performing joint source channel decoding is disclosed. The method includes monitoring first data bits received over a channel and generating one or more received statistics based on the monitored first data bits. The method also includes generating a conditional probability based exclusively on the one or more received statistics. The method further includes utilizing the conditional probability to perform channel decoding of second data bits received over the channel
Various example embodiments are described in the following subsections. In particular, an example LTE architecture embodiment is described, followed by example embodiments for JSCD and jitter buffer enhanced JSCD. Jitter buffer enhanced JSCD embodiments that exploit speech coding parameter correlation and packet header parameter correlation are subsequently described. This is followed by a description of further example jitter buffer enhanced JSCD advantages and embodiments. A description of JSCD embodiments for parameter domain correlation are subsequently described. Next, example operational embodiments are described. Finally, an example computer-implemented embodiment is described.
3. Example LTE Architecture Embodiment
An LTE receiver, e.g., an LTE modem, in a communication system may be configured in various ways to decode received data streams utilizing JSCD, in embodiments. For example, FIG. 2 shows a block diagram of an LTE modem architecture (hereinafter “LTE architecture”) 200, according to an embodiment. LTE architecture 200 includes circuitry corresponding to the layers associated with the LTE protocol. The layers include a physical (PHY) layer 202, a medium access control (MAC) layer 204, a radio link control (RLC) layer 206, a packet data convergence protocol (PDCP) layer 208, a robust header compression (RoHC) layer 210, and an application (APL) layer 212. LTE architecture 200 also includes a first turbo decoder 214 in PHY layer 202, a JSCD block (channel decoder) 216 in APL layer 212 as shown, an adaptive multi-rate speech decoder (hereinafter, “AMR”) 218 in APL layer 212, and an antenna 220. LTE architecture 200 and each of the components included therein may include functionality and connectivity beyond what is shown in FIG. 2, as would be apparent to persons skilled in relevant art(s). However, such additional functionality is not shown in FIG. 2 for the sake of brevity.
As shown in FIG. 2, an arrow 222 indicates the general flow of the progression of data through the LTE protocol stack from PHY layer 202 to APL layer 212. It should be noted that the progression of data may deviate from the flow indicated by arrow 222 and that the LTE protocol stack may include fewer layers or additional layers (not shown).
The PHY layer 202 includes channel coding, error detection, modulation/demodulation, and/or other procedures to handle power control, multi-antenna operation, and/or the like. PHY layer 202 is based on orthogonal frequency division multiple access (OFDMA) for downlink communications and single carrier frequency division multiple access (SC-FDMA) for uplink communications. As shown, PHY layer 202 includes a demodulator 226, a Hybrid Automatic Repeat Request (HARQ) block 230, and first turbo decoder 214. Antenna 220 receives incoming data signals on a data channel 228 and transmits the received data signal to demodulator 226 via a line 224. Demodulator 226 demodulates the received data signal and transmits the demodulated data to HARQ block 230 via a line 232. HARQ block 230 may request a retransmission of a data packet if an error is detected in the data packet. If retransmission is completed or not required, the channel data is then transmitted to first turbo decoder 214 via a line 234. First turbo decoder 214 decodes the channel data (which is encrypted data) to generate soft bits and transmits the encrypted soft bits to APL layer 212 via a line 236. First turbo decoder 214 also decodes the channel data to generate hard bits (the decoded channel data bits received via the data stream, i.e., the logical “1” or logical “0” that the decoder has determined to be the actual data bits) and transmits the hard bits to MAC layer 204 via a line 238.
MAC layer 204 functions include the mapping and multiplexing of logical channels to transport channels. MAC layer 204 also handles the physical layer retransmissions (e.g., performed via HARQ block 230) which are applied to voice due to the low delay associated with voice packets. As shown, HARQ block 230 overlaps with MAC layer 204 as well as with PHY layer 202. That is, MAC layer 204 may control, in full or in part, the actual physical retransmission that occurs in PHY layer 202. Scheduling is also implemented in MAC layer 204 with priority handling to ensure a sufficient level of Quality of Service. RLC layer 206 handles retransmissions and segmentation. As shown, RLC layer 206 includes reordering and duplicate detection block 240 which corrects out of order packet sequences and duplicate packets (e.g., caused during handoffs). Data is transmitted from RLC layer 206 to PDCP layer 208 via a line 242. PDCP layer 208 handles ciphering and decryption. As shown, PDCP layer 208 includes a decryption block 244 and a cipher stream block 248. Decryption block 244 uses a cipher to decode encrypted data passed from the lower layers and transmit the decoded data to RoHC layer 210 via a line 246. Cipher stream block 248 provides the cipher to APL layer 212, via a line 250, in order to allow applications and/or circuitry in APL layer 212 to properly decrypt encrypted data (e.g., encrypted soft bits provided to APL layer 212 via line 236). RoHC layer 210 supports robust header compression as specified in 3rd Generation Partnership Project Technical Specification (3GPP TS) 36.323, Internet Engineering Task Force (IETF) Request for Comments (RFC) 3095, and IETF RFC 4815. As shown, RoHC layer 210 includes a decompression block 252 which decompresses Internet Protocol (IP) packet headers for transmission to APL layer 212 via a line 254.
APL layer 212 supports applications and services such as data buffering and speech decoding. As shown, APL layer 212 includes a jitter buffer 256, JSCD block 216, AMR 218, and a memory 270. Jitter buffer 256 buffers voice data for delivery of the voice data via a line 258 to AMR 218 to allow for smooth output of decoded speech by AMR 218. Jitter buffer 256 may also provide voice data to JSCD block 216 and/or PRAB(s) 264 via a line 268. Further jitter buffer embodiments are described in detail below. In embodiments, AMR 218 may be a narrowband multi-rate speech decoder (AMR-NB). AMR 218 outputs decoded speech via a line 260.
JSCD block 216 includes a second turbo decoder 262 and a Packet Redundancy Analysis Block (PRABs) 264 (i.e., packet redundancy analyzer). JSCD block 216 also includes modules, blocks, circuitry, and/or applications for data storage (not shown), for encrypting and/or decrypting data (not shown), for performing data transformations on soft bits to pass between encrypted and decrypted domains (not shown), and for routing received soft bits within the JSCD block 216 based upon an indication of whether errors are present in a data packet or not (not shown). JSCD block 216 receives encrypted soft bits via line 236, and second turbo decoder 262 performs its decoding operations based on the received encrypted soft bits and based on extrinsic data inputs received from one or more PRAB sub-block modules in PRAB 264, discussed in further detail below.
The resulting decoded data based on the hard decision of second turbo decoder 262 is decrypted in JSCD block 216 and transmitted to decompression block 252 where the decrypted, decoded data is re-inserted into the data stream. It should be noted, however, that in various embodiments, the hard decision data output by turbo decoder 262 may be provided to different elements and/or layers depicted in LTE architecture 200.
Second turbo decoder 262 provides for an additional turbo decoder that runs in APL layer 212 (in addition to turbo decoder 214 that runs in PHY layer 202). Running in APL layer 212 allows the additional turbo decoder to be configurable and flexible in application without modifying or affecting performance of first turbo decoder 214 in PHY layer 202. For example, first turbo decoder 214 is agnostic with respect to source signal information within a given packet, but second turbo decoder 262 may be configured in APL layer 212 to utilize packet information to improve channel decoding. That is, first turbo decoder 214 performs conventional channel decoding operations, while second turbo decoder 262 is configured to perform JSCD utilizing packet information. LTE architecture 200 also provides for transparent layers through which soft bits generated by first turbo decoder 214 can be passed to APL layer 212 for use by JSCD block 216 and the elements therein. For example, if it is determined that a data packet is “good” (e.g., no errors), the soft bits may be provided to a Packet Redundancy Analysis Block(s) (PRABs) to update PRAB states, whereas if it is determined that a data packet is “bad” (e.g., has errors), the soft bits may be provided to perform JSCD in APL layer 212. Likewise, cipher stream block 248 can provide a cipher stream for use by JSCD block 216 in APL layer 212.
Memory 270 may receive hard bits, probability density functions (PDFs), and/or other information via line 268 from jitter buffer 256 and/or via a line 272 from JSCD block 216. Memory 270 may store such received data for use by JSCD block 216. The received data may include data related to past, present, and/or future frames. JSCD block 216 receives data stored in memory 270 via line 272 and receives data from jitter buffer 256 via line 268. Memory 270 may be any type of memory or buffer (i.e., memory buffer). Memory 270 may be sized to store any amount of information/data, and the size of memory 270 may be dynamically configured. While shown as a single, separate block in FIG. 2, memory 270 may be included within JSCD block 216 or any other component described herein (e.g., any component of LTE architecture 200), and memory 270 may comprise one or more physical and/or logical partitions, as would be understood by persons of skill in the relevant art(s) having the benefit of this disclosure.
LTE architecture 200 and each of the elements included therein may be implemented in hardware, or a combination of hardware and software and/or firmware. Further details concerning an example modem architecture that supports JSCD, such as that shown in FIG. 2 or alternative implementations thereof, may be found in commonly-owned co-pending U.S. patent application Ser. No. 13/749,064, entitled “Modem Architecture for Joint Source Channel Decoding” and filed on Jan. 24, 2013, the entirety of which is incorporated by reference as if fully set forth herein.
4. Example Joint Source Channel Decoder Embodiments
As noted in the above-described LTE architecture 200, a receiver may be configured in ways to perform joint source channel decoding (JSCD). For example, a joint source channel decoding embodiment using the Long Term Evolution (LTE) standard and turbo decoding is described in this section. For instance, a JSCD block (e.g., JSCD block 216) may be adapted to perform joint source channel decoding as described herein, according to embodiments.
JSCD block 216 functions by injecting a-priori information into each of a first Maximum A-posteriori (MAP) decoder (non-interleaved) and a second MAP decoder (interleaved) of a modified turbo decoder. The first and second MAP decoders perform decoding to converge on a hard decision (representing the determination of the decoders of the actual data bits in a data packet) or until a predetermined number of iterations are performed. Some previous solutions perform JSCD by injecting a-priori information into only a non-interleaved MAP decoder. JSCD block 216 avoids positive feedback of source statistics from one MAP decoder to the other by subtracting out extrinsic data of the source from the soft bit outputs of the MAP decoder (e.g., log likelihood ratios (LLRs) representing the “soft decision” of a MAP decoder with respect to whether a given bit in a data stream is likely to be a “1” or a “0”). In embodiments, the source statistics may be one or more probabilities that incoming data bits are ones or zeroes based upon the received data bits. The soft bits resulting from this subtraction are input to a Packet Redundancy Analysis Block which generates extrinsic information to be provided to the companion MAP decoder along with extrinsic information from the first MAP decoder. Accordingly, JSCD block 216 performs JSCD by injecting a-priori information into both the first and second MAP decoders without feedback of source statistics. It has been observed that this doubles an improvement achievable when injecting a-priori information into only a non-interleaved MAP decoder. JSCD block 216 and each of the elements included therein may be implemented in hardware, or a combination of hardware and software and/or firmware. Further details concerning example JSCD blocks with modified turbo decoder architectures that support JSCD, such as that described above or alternative implementations thereof, may be found in commonly-owned co-pending U.S. patent application Ser. No. 13/749,187, entitled “Modified Joint Source Channel Turbo Decoder” and in commonly-owned co-pending U.S. patent application Ser. No. 13/748,904, entitled “Joint Source Channel Decoding Using Parameter Domain Correlation” each filed on Jan. 24, 2013, and each of which is incorporated by reference in its entirety as if fully set forth herein.
The next section describes JSCD embodiments in the context of JSCD block 216 as described above, in which jitter buffer enhanced JSCD is utilized to improve channel decoding. However, the JSCD techniques that will be described are not limited to that embodiment.
5. Example Embodiments for Jitter Buffer Enhanced Joint Source Channel Decoding
As noted above, in Joint Source Channel Decoding (JSCD), the source and channel are jointly decoded. JSCD may be performed in accordance with the embodiments described above. In accordance with embodiments described in this section, JSCD performance is enhanced using a jitter buffer implementation, unlike previous solutions which only utilized jitter buffers for storing channel decoded hard bits. In embodiments, a second jitter buffer is utilized in addition to jitter buffer 256. The second jitter buffer is configured to store the soft information (e.g., soft bits) of the packets that fail initial or previous channel decoding attempts. This initial or previous channel decoding includes the PHY layer 202 decoding (e.g., by first turbo decoder 214), and potentially a first-pass APL layer 212 decoding (e.g., by an optional JSCD block as described below). The hard bits of a packet that passes an initial or previous decoding are routed to jitter buffer 256. The soft bits of packets that fail decoding are routed to the second jitter buffer.
For example, FIG. 3 shows a block diagram of a jitter buffer implementation 300, according to an embodiment. Jitter buffer implementation 300 may be a further embodiment of a portion of LTE architecture 200, shown in FIG. 2. Jitter buffer implementation 300 includes jitter buffer 256, first turbo decoder 214, JSCD block 216, and AMR 218, as previously shown in FIG. 2. Jitter buffer 256 may be any buffer or memory (i.e., a memory buffer) that is configured to store a plurality of hard bits and may be sized to store any plurality of hard bits or subsets thereof. As shown in FIG. 3, jitter buffer implementation 300 also includes a secondary jitter buffer 302 and an optional JSCD block 304. Secondary jitter buffer 302 may be any buffer or memory (i.e., a memory buffer) that is configured to store a plurality of soft bits and may be sized to store any plurality of soft bits or subsets thereof. The size of secondary jitter buffer 302 may be dynamically configured. While shown as a single, separate block in FIG. 3, secondary jitter buffer 302 may be included within jitter buffer 256, JSCD block 216 or any other component described herein (e.g., any component of LTE architecture 200 or jitter buffer implementation 300), and may comprise one or more physical and/or logical partitions. Jitter buffer implementation 300 and each component included therein may include functionality and connectivity beyond what is shown in FIG. 3, as would be apparent to persons skilled in relevant art(s). However, such additional functionality is not shown in FIG. 3 for the sake of brevity.
As shown in FIG. 3, first turbo decoder 214 decodes channel data to generate hard bits (if the channel data is properly decoded, i.e., passes decode) which are transmitted to jitter buffer 256. Jitter buffer 256 may provide stored hard bits to AMR 218 and/or to memory 270. As shown in FIG. 3, the position of frame n in jitter buffer 256 is referred to as the “play-out position” (i.e., the position in jitter buffer 256 from which hard bits are transmitted to AMR 218 for speech decoding, also referred to as the ultimate position). First turbo decoder 214 also generates soft bits from the channel data and transmits the soft bits to APL layer 212. The soft bits are transmitted to JSCD block 216 if properly decoded (i.e., pass), and are transmitted to secondary jitter buffer 302 if not properly decoded (i.e., fail). The determination of whether the soft bits are associated with proper or improper channel decoding may be made by turbo decoder 214, by JSCD block 216, or by logic/circuitry not shown for the sake of brevity.
In some embodiments, first turbo decoder 214 may transmit generated soft bits to an optional JSCD block 304. Optional JSCD block 304 may be configured similarly to JSCD block 216, in embodiments. Optional JSCD block 304 may decode channel data in the form of the received soft bits, and if properly decoded (i.e., pass), optional JSCD block 304 transmits hard bits to jitter buffer 256. If not properly decoded (i.e., fail), optional JSCD block 304 transmits resulting soft bits to secondary jitter buffer 302.
The soft bits transmitted to secondary jitter buffer 302 are buffered or stored for use by JSCD block 216. Accordingly, secondary jitter buffer 302 is configured to store a plurality of soft bits corresponding to one or more subsets of soft bits, each being associated with a frame. In embodiments, JSCD block 216 may take one or more of the stored subsets as inputs to perform JSCD on one or more of the stored subsets to generate corresponding hard bits. It should be noted that even though subsets of soft bits stored in secondary jitter buffer 302 are associated with frames that were decoded with errors, neighboring frames may be significantly correlated and their use in JSCD provides an increased potential for proper channel decoding. JSCD block 216 may also take hard bits stored in jitter buffer 256, including future frames, as well as past frame information and/or hard bits/information stored in memory 270 as inputs to perform JSCD on the one or more subsets of soft bits stored in secondary jitter buffer 302. As shown in FIG. 3 and according to embodiments, a delayed jitter buffer approach is implemented. JSCD block 216 may wait (or be delayed) in performing JSCD on a subset of soft bits associated with a frame that was improperly channel decoded until the frame position immediately precedes the play-out position (i.e., when the frame position corresponds to the penultimate position in jitter buffer 256). By waiting to perform JSCD, additional frames may arrive prior to performing channel decoding, and thus provide additional information that may be used during JSCD to increase efficacy (e.g., allowing for significantly better prediction of values by exploiting information in future frames and additional past frames). In embodiments, the delayed jitter buffer approach may be extended to include an iterative mechanism in which JSCD is performed for one or more subsets of soft bits associated with frames that were improperly channel decoded as each of the frames traverse each position in jitter buffer 256. Each approach is discussed in detail below.
In the embodiment shown, hard bits from first turbo decoder 214 or optional JSCD block 304 that are buffered/stored in jitter buffer 256 enter at position n+5 and traverse jitter buffer 256 to play-out position n. For instance, hard bits of the frame in position n+2 will be shifted (physically or logically) to position n+1 when hard bits of the frame at position n are played out to AMR 218. Hard bits from JSCD block 216 and out of order hard bits from first turbo decoder 214 or optional JSCD block 304 may enter at their corresponding position in jitter buffer 256. For example, when JSCD block 216 properly decodes soft bits corresponding to frame n+1 in secondary jitter buffer 302, the corresponding hard bits enter jitter buffer 256 at position n+1 (physically or logically). Jitter buffer 256 may be sized to buffer or store a plurality of hard bits that corresponds to one or more frames that have been properly channel decoded. For instance, as shown in FIG. 3, jitter buffer 256 is configured to store hard bits for six frames corresponding to the current play-out position at time n, as well as at time n+1, time n+2, time n+3, time n+4, and time n+5. Times greater than n, e.g., n+1, n+2, etc., denote future frame times as referred to herein. It is contemplated that jitter buffer 256 may be configured to store hard bits for more or fewer frames, and/or may dynamically change in size. As shown, hard bits associated with frame n (at the current play-out position, i.e., at the ultimate position of jitter buffer 256) and frame n+2 are stored in jitter buffer 256. In the depicted embodiment, frames n+1, n+3, n+4, and n+5 do not have corresponding hard bits stored in jitter buffer 256, but are shown in parentheses “( )” for illustration of their place in the frame sequence. Frames n+1, n+3, and n+5 are denoted with asterisks “*” to illustrate these frames have not been properly decoded, and frame n+4 is denoted with a caret “^” to illustrate an out of order frame that has not yet arrived.
In the embodiment shown, soft bits from first turbo decoder 214 or optional JSCD block 304 that are buffered/stored in secondary jitter buffer 302 enter at position occupied by soft bits of frame n+5 and traverse secondary jitter buffer 302 to the position occupied by soft bits of frame n+1. The buffered/stored soft bits may be arranged sequentially and/or chronologically by physical and/or logical organization. For instance, soft bits of the frame in position n+3 will be shifted (physically or logically) to position occupied by frame n+1 when soft bits of the frame at position n+1 successfully decoded by JSCD block 216. Out of order soft bits from first turbo decoder 214 or optional JSCD block 304 may enter secondary jitter buffer 302 at their respective sequential positions. Secondary jitter buffer 302 may be sized to buffer/store one or more subsets of soft bits associated frames that have not been properly decoded. For example, secondary jitter buffer 302 as shown stores three subsets of soft bits corresponding to three frames n+1, n+3, and n+5. It is contemplated that secondary jitter buffer 302 may be configured to store soft bits for more of fewer frames, and/or may dynamically change in size.
In various embodiments, JSCD block 216 may perform JSCD at a position other than the penultimate position in jitter buffer 256. It should also be noted that in various embodiments, the soft bits stored in secondary jitter buffer 302 and/or the hard bits stored in memory 270 may be stored in jitter buffer 256. Jitter buffer 256 may comprise one or more physical partitions and/or one or more logical partitions according to the embodiments described herein. In such embodiments, frame position n may still be considered the play-out position or the ultimate position even though additional hard bits of past frames may be stored in jitter buffer 256.
Exemplary jitter buffer enhanced JSCD operations will now be described.
A. Example Embodiments for Delayed Jitter Buffer Enhanced Joint Source Channel Decoding
As described above and shown FIG. 3, frames n+1, n+3, and n+5 contain soft bits associated with frames that have not been properly decoded, e.g., by first turbo decoder 214. JSCD block 216 is configured to perform JSCD on the soft bits associated with the frame corresponding to the penultimate position in jitter buffer 256. As shown, the soft bits of frame n+1 are stored in the ultimate position of secondary jitter buffer 302, and frame n+1 corresponds to the penultimate position in jitter buffer 256. Accordingly, JSCD block 216 takes the soft bits associated with frame n+1 as inputs and performs JSCD. Additionally, and as illustrated in FIG. 3, one or more additional subsets of soft bits in secondary jitter buffer 302, one or more subsets of hard bits in jitter buffer 256, and/or one or more subsets of hard bits in memory 270 may be taken as additional inputs by JSCD block 216 to perform JSCD on the soft bits associated with frame n+1. In embodiments, a parameter correlation between certain packet header fields or certain encoded speech parameters associated with the additional inputs and the soft bits associated with frame n+1 may be utilized by JSCD block 216 in performing the JSCD. It is contemplated that one or more parameters described herein, alone or in various combinations, may be utilized to perform JSCD in accordance with the present techniques and embodiments, such as, but without limitation, parameters described below in Sections 7 and 8 (e.g., pitch, Line Spectral Pairs (LSPs), pitch gain, fixed codebook gain, packet sequence numbers, etc.). Using delayed jitter buffer enhanced JSCD, channel decoding of soft bits (e.g., for frame n+1) may exploit contents/information of frames with soft bits stored in secondary jitter buffer 302, as well as contents/information in jitter buffer 256 (e.g., past frame n and/or future frame n+2) and/or memory 270 from frames that were properly channel decoded (e.g., frames n−3, n−2, and/or n−1).
Frame n+4, as described above, is out of order and has not yet arrived for channel decoding. When out of order frame n+4 arrives for channel decoding, hard bits associated with this frame are stored in jitter buffer 256 if the frame is properly channel decoded by first turbo decoder 214 or optional JSCD block 304, as generally described above. If not properly channel decoded, soft bits associated with this frame are stored in secondary jitter buffer 302 and JSCD is performed by JSCD block 216, as generally described above. However, unlike prior solutions that utilize jitter buffers, delayed jitter buffer enhanced JSCD allows utilization of soft bits stored in secondary jitter buffer 302 as well as other frame information stored in jitter buffer 256 (including future frames) to perform JSCD on soft bits associated with out of order frames. For instance, in an example where JSCD block 216 properly decodes frames n+1, n+3, and n+5 and frame n+4 has just arrived, delayed jitter buffer enhanced JSCD allows JSCD block 216 to utilize information (e.g., hard bits) associated with each frame that is stored in jitter buffer 256 (including future frame n+5) to perform channel decoding for soft bits of frame n+4 if this frame was previously improperly channel decoded. Prior solutions have not exploited hard bits stored in a jitter buffer, especially for future frames, to perform JSCD on out of order packets.
B. Example Embodiments for Iterative Jitter Buffer Enhanced Joint Source Channel Decoding
In embodiments, the delayed jitter buffer approach may be extended to include an iterative mechanism in which JSCD is performed for one or more subsets of soft bits associated with frames that were improperly channel decoded as each of the frames traverse each position in jitter buffer 256. Frames that have arrived and been channel decoded with errors in advance of the play-out position shown in jitter buffer 256 may each be channel decoded using JSCD by JSCD block 216 at each time position of jitter buffer 256, not just at the penultimate position preceding the play-out position, using the past and future information (e.g., hard bits, soft bits, PDFs, etc.) available to it at that time. In the case of the above-described embodiments related to FIG. 3, during an earlier frame pass, frame n+4 may be correctly decoded, in which case frame n+4 is available for channel decoding of frame n+3 before it reaches the play-out position or penultimate position. In this way, packets that have arrived may be maximally exploited by the JSCD at every frame time.
6. Example Embodiments for Jitter Buffer Enhanced Joint Source Channel Decoding Using Parameter Domain Correlation
Jitter buffer enhanced Joint Source Channel Decoding (JSCD) may be performed in accordance with the embodiments described above. In accordance with embodiments described in this section, jitter buffer enhanced JSCD is performed using correlation of parameters within and associated with the data to improve decoding. Correlation in the parameter domain is used to generate models (e.g., probability density functions (PDFs)) for parameters and/or parameter combinations. These models are then applied to update the soft bit values obtained for each parameter during channel decoding.
Sources of redundancy in Voice over LTE (VoLTE) data packets may be generally described as follows. A residual redundancy incurred by encoding pT may be shown as:

ρT=R−Hx  (1)

where R represents an encoding rate (in bits/symbol), and where Hx represents the minimum rate (in bits/symbol) at which the process can be encoded without incurring distortion. For redundancy in the AMR-NB (Adaptive Multi-Rate Narrowband) speech codec used in VoLTE, a stationary, first-order Markov chain may provide a probabilistic model. The total redundancy may be broken into two terms:

ρT=ρD+ρM  (2)

where ρD represents redundancy due to the non-uniform distribution of the parameter, and where μM represents redundancy due to the parameter correlation in consecutive frames.

Parameters that may be exploited for correlation purposes may include, but are not limited to, speech coding parameters and packet header parameters. The concept of parameter correlation, however, is generally applicable to any multi-bit source parameter. The correlations may be between two or more parameters and may be between parameters of a current frame, or between one or more parameters of a current frame and one or more parameters of a past or future frame.
Parameter domain correlation and probabilities are now described in further detail. Correlation in the parameter domain may be described in terms of probabilities and log likelihood ratios (LLRs) (e.g., soft bits), as noted above. For example, as referenced herein, the vector term x0={x0(0), x0(1)}, . . . , x0 (M−1) is the M-bit coded representation of a parameter with x0(m)ε{0,1}, m=0, 1, . . . , M−1. Hence, there are 2M such vectors with x0i being the ith vector. The complete received vector of indices for the last frame is denoted by Ŷ—1, and all bit locations except the mth bit in x0 is denoted by x0\m. To find the probability that the transmitted vector was x0i, the past history of received indices is used (e.g., one or more previous frames may be used) along with all bit locations within x0 except the bit for which the bit probability is currently determining, hence x0\m. Assuming only the previous frame is used for illustrative simplicity, the probability that the transmitted vector (parameter representation) was x0i considering the mth bit is given by:




  
    
      
        
          
            P
            m
          
          ⁡
          
            (
            
              
                
                  
                    x
                    _
                  
                  0
                  i
                
                |
                
                  
                    
                      Y
                      ^
                    
                    _
                  
                  
                    -
                    1
                  
                
              
              ,
              
                
                  
                    x
                    _
                  
                  0
                
                ⁢
                \
                ⁢
                m
              
            
            )
          
        
        =
        
          
            
              
                P
                ⁡
                
                  (
                  
                    
                      
                        x
                        _
                      
                      0
                      i
                    
                    |
                    
                      
                        
                          Y
                          ^
                        
                        _
                      
                      
                        -
                        1
                      
                    
                  
                  )
                
              
              ·
              
                
                  P
                  m
                
                ⁡
                
                  (
                  
                    
                      
                        x
                        _
                      
                      0
                      i
                    
                    |
                    
                      
                        
                          x
                          _
                        
                        0
                      
                      ⁢
                      \
                      ⁢
                      m
                    
                  
                  )
                
              
            
            
              
                ∑
                
                  j
                  =
                  0
                
                
                  2
                  
                    M
                    
                      -
                      1
                    
                  
                
              
              ⁢
              
                
                  
                    P
                    m
                  
                  ⁡
                  
                    (
                    
                      
                        
                          x
                          _
                        
                        0
                        j
                      
                      |
                      
                        
                          
                            Y
                            ^
                          
                          _
                        
                        
                          -
                          1
                        
                      
                    
                    )
                  
                
                ·
                
                  
                    P
                    m
                  
                  ⁡
                  
                    (
                    
                      
                        
                          x
                          _
                        
                        0
                        j
                      
                      |
                      
                        
                          
                            x
                            _
                          
                          0
                        
                        ⁢
                        \
                        ⁢
                        m
                      
                    
                    )
                  
                
              
            
          
          .
        
      
    
    
      
        (
        3
        )
      
    
  




The probability shown by Equation 3 is computed for each possible value of the vector (i.e., the parameter representation) for each bit m of the M bits in the vector. For a given parameter having M bits, Equation 3 is performed 2M×M times to determine the probability of each possible vector value when considering each bit in the vector. Once the probability of each index x0i is computed, the probability for the mth bit is then simply the sum of the probabilities of each index x0i for which the mth bit is equal to x0(m):





  
    
      
        
          
            
              P
              p
            
            ⁡
            
              (
              
                
                  
                    
                      x
                      0
                    
                    ⁡
                    
                      (
                      m
                      )
                    
                  
                  |
                  
                    
                      
                        Y
                        _
                      
                      ^
                    
                    
                      -
                      1
                    
                  
                
                ,
                
                  
                    x
                    _
                  
                  0
                
              
              )
            
          
          =
          
            
              ∑
              
                {
                
                  
                    i
                    |
                    
                      
                        x
                        0
                      
                      ⁡
                      
                        (
                        m
                        )
                      
                    
                  
                  =
                  
                    
                      
                        x
                        _
                      
                      0
                      i
                    
                    ⁡
                    
                      (
                      m
                      )
                    
                  
                
                }
              
            
            ⁢
            
              
                P
                m
              
              ⁡
              
                (
                
                  
                    
                      
                        x
                        _
                      
                      0
                      i
                    
                    |
                    
                      
                        
                          Y
                          _
                        
                        ^
                      
                      
                        -
                        1
                      
                    
                  
                  ,
                  
                    
                      
                        x
                        _
                      
                      0
                    
                    ⁢
                    \
                    ⁢
                    m
                  
                
                )
              
            
          
        
        ,
      
    
    
      
        (
        4
        )
      
    
  




as described in further detail in an exemplary embodiment below.

In embodiments, information received not only in the previous frame, Ŷ—1, but also in even older frames, future frames, and the current frame, may also be exploited. This is denoted simply by Ŷ. The a-priori probability density function (PDF), P(x0i|Ŷ—1), may be assumed, in one approach, as a Markov-0 model. This may be appropriate if there is no correlation between the parameter of interest and any current or previously received parameters. The a-priori PDF may also be used to weight and/or offset probabilities associated with data in the current frame, as shown in Equation 3 above. In this case,

P(x0i|{circumflex over (Y)}—1)=P(x0i).  (5)

The PDF, P(x0i), is obtained by training over a large speech database to determine the probability of occurrence of each index. Such a PDF may be referred to as a reference PDF or reference data. Often, a parameter may have a different distribution (PDF) depending on the speech type, e.g., voiced or non-voiced speech. In these cases, different PDFs for each speech type may be used.

In embodiments, a conditional PDF may be used based on parameters received in previous or future frames. A parameter index that was decoded in a previous frame may be represented by z—j, and may be the same or a different parameter than x. If J total parameters are used, then




  
    
      
        
          
            
              
                P
                ⁡
                
                  (
                  
                    
                      
                        x
                        _
                      
                      0
                      i
                    
                    |
                    
                      
                        Y
                        ^
                      
                      _
                    
                  
                  )
                
              
              =
              
              ⁢
              
                P
                ⁡
                
                  (
                  
                    
                      
                        x
                        _
                      
                      0
                      i
                    
                    |
                    
                      
                        
                          Y
                          ^
                        
                        _
                      
                      
                        -
                        1
                      
                    
                  
                  )
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                P
                ⁡
                
                  (
                  
                    
                      
                        
                          x
                          _
                        
                        0
                        i
                      
                      |
                      
                        
                          z
                          _
                        
                        -
                        1
                      
                    
                    ,
                    
                      
                        z
                        _
                      
                      -
                      2
                    
                    ,
                    ...
                    ⁢
                    
                      
                    
                    ,
                    
                      
                        z
                        _
                      
                      -
                      J
                    
                  
                  )
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ∑
                  
                    
                      n
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                    =
                    0
                  
                  
                    
                      N
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                    -
                    1
                  
                
                ⁢
                
                  
                    ∑
                    
                      
                        n
                        ⁢
                        
                          
                        
                        ⁢
                        2
                      
                      =
                      0
                    
                    
                      
                        N
                        ⁢
                        
                          
                        
                        ⁢
                        2
                      
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    ...
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          nJ
                          =
                          0
                        
                        
                          NJ
                          -
                          1
                        
                      
                      ⁢
                      
                        P
                        (
                        
                          
                            
                              
                                x
                                _
                              
                              0
                            
                            =
                            
                              
                                i
                                |
                                
                                  
                                    z
                                    _
                                  
                                  -
                                  1
                                
                              
                              =
                              
                                
                                  n
                                  ⁢
                                  
                                    
                                  
                                  ⁢
                                  1
                                
                                _
                              
                            
                          
                          ,
                        
                      
                    
                  
                
              
            
          
        
        
          
            
              
                
                ⁢
                
                  
                    
                      
                        z
                        _
                      
                      -
                      2
                    
                    =
                    
                      
                        
                          n
                          ⁢
                          
                            
                          
                          ⁢
                          2
                        
                        _
                      
                      ⁢
                      
                        
                      
                      ⁢
                      ...
                    
                  
                  ⁢
                  
                    
                  
                  ,
                  
                    
                      
                        z
                        _
                      
                      -
                      J
                    
                    =
                    
                      nJ
                      _
                    
                  
                
                )
              
              ·
            
          
        
        
          
            
              
              ⁢
              
                
                  P
                  ⁡
                  
                    (
                    
                      
                        
                          
                            z
                            _
                          
                          -
                          1
                        
                        =
                        
                          
                            n
                            ⁢
                            
                              
                            
                            ⁢
                            1
                          
                          _
                        
                      
                      ,
                      
                        
                          
                            z
                            _
                          
                          -
                          2
                        
                        =
                        
                          
                            
                              n
                              ⁢
                              
                                
                              
                              ⁢
                              2
                            
                            _
                          
                          ⁢
                          
                            
                          
                          ⁢
                          ...
                        
                      
                      ⁢
                      
                        
                      
                      ,
                      
                        
                          
                            z
                            _
                          
                          -
                          J
                        
                        =
                        
                          nJ
                          _
                        
                      
                    
                    )
                  
                
                .
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




If the solution is constrained to use only previous frames and/or future frames parameters when those frames were correctly decoded, then the value of the z—j's are known, and Equation 6 may be simplified to:

P(x0i|{circumflex over (Y)})=P(x0=i|z—1=n1,z—2=n2 . . . , z—J=nJ).  (7)

The above can be extended to include parameters in the current frame. However, in that case, simplification (as in Equation 7) may not be possible because the current frame is still being decoded, and it is not yet known if errors exist.

Referring again to FIG. 2, parameter correlation is utilized in a first PRAB sub-block and in second PRAB sub-block of PRAB(s) 264 to generate conditional probabilities, according to embodiments (e.g., as described above in Section 4). In embodiments where a value xk represents a data bit, and where y′ represents one or more received data bits and corresponding parity bits, the soft bits (LLRs) generated by a first MAP decoder may be represented by Lmapd1s2(xk), and the soft bits (LLRs) generated by a second MAP decoder may be represented by Lmapd2s1(xk). The extrinsic information computed by a first PRAB sub-block may be represented by Les1(xk), and the extrinsic information computed by a second PRAB sub-block may be represented by Les2(xk). Thus, the soft bits (LLR information) input to the first PRAB sub-block may be shown as:

Lmapd1(xk)=Lmapd1s2(xk)−Les2(xk)  (8)

and the soft bits (LLR information) input into the second PRAB sub-block may be shown as:

Lmapd2(xk)=Lmapd2s1(xk)−Les1(xk)  (9)

This soft bit LLR information is used by the first and second PRAB sub-blocks along with the a-priori knowledge to derive the prediction probabilities Pp (as described above in this section) from which the predicted log likelihood ratios are computed:




  
    
      
        
          
            
              L
              e
              si
            
            ⁡
            
              (
              
                x
                k
              
              )
            
          
          =
          
            
              
                log
                ⁡
                
                  [
                  
                    
                      Pp
                      ⁡
                      
                        (
                        
                          
                            x
                            k
                          
                          =
                          
                            1
                            |
                            
                              y
                              ′
                            
                          
                        
                        )
                      
                    
                    
                      Pp
                      ⁡
                      
                        (
                        
                          
                            x
                            k
                          
                          =
                          
                            0
                            |
                            
                              y
                              ′
                            
                          
                        
                        )
                      
                    
                  
                  ]
                
              
              ⁢
              
                
              
              ⁢
              i
            
            =
            1
          
        
        ,
        2
        ,
      
    
    
      
        (
        10
        )
      
    
  




where Pp is a probability that may be obtained by incorporating intra-frame and/or inter-frame a-priori knowledge.

The next section describes jitter buffer enhanced JSCD embodiments, with respect to jitter buffer implementation 300 and JSCD block 216 as described above, in which parameter domain correlation of speech information is utilized to improve channel decoding.
7. Example Jitter Buffer Enhanced Joint Source Channel Decoding Embodiments that Exploit Speech Coding Parameter Correlation
An A-priori Speech Statistics Algorithm (ASSA) is now described that uses a-priori speech information to facilitate jitter buffer enhanced joint source channel decoding (JSCD). In particular, the correlation of certain source-encoded speech parameters is used to facilitate joint source channel decoding. For the AMR-NB (Adaptive Multi-Rate Narrowband) speech codec used in VoLTE (Voice over LTE), the parameters that may be focused on include, but are not limited to, pitch, Line Spectral Pairs (LSPs), pitch gain, and fixed codebook gain. Models (e.g., conditional probability density functions (PDFs)) are obtained for each of the parameters and are applied to update the soft bit values that are obtained for each parameter during channel decoding (turbo decoding in VoLTE). The models applied may vary depending upon whether the speech is classified as voiced or unvoiced, transition, or background noise. For example, in the case of an AMR-NB speech codec operating at 12.2 Kb/s, voiced speech may include up to 23 bits, or more, of total signal redundancy, and unvoiced speech may include up to 16 bits, or more, of total signal redundancy. However, frame classification based on only past speech and the currently decoded frame may be difficult, especially during speech transitions (voiced to unvoiced, etc.). This is because the current frame may contain errors. For example, a large change in the pitch period may be due to bit errors in the current frame, or may be due to a transition from voiced to unvoiced speech. If a future frame is known, this provides significant insight into the classification of the current frame. Continuing with the pitch period example, if a future frame has been decoded without errors and the pitch period is close to that in the previous frame, then a large change in the current frame is more likely to be due to bit errors. However, if the pitch period in the future frame also has a large delta compared to the previous frame, then this suggests that the current frame may be a transitional frame and low correlation with the previous pitch is more likely. Similar improvements can be made for the spectrum (e.g., LSPs) and the gain. Combined together, a very reliable frame classification can be made that can then be used to both train separate PDFs based on these classifications, and then select the appropriate PDFs during the decoding process. For example, separate PDFs for the pitch could be used for voiced, unvoiced, and transitional frames.
Speech redundancy may be utilized with the parameter-based probability equations noted in the previous section (e.g., Equations 3, 6, and 7). To apply parameter based probability, one or more a-priori probability density functions (PDFs) are generated based on known speech data. For example, the probability of a given vector (e.g., parameter) based on a given frame (e.g., a previous or future frame) may be shown as:

P(x0i|{circumflex over (Y)}—1) or more generally, P(x0i|Y)  (11)

as noted above. Generated a-priori PDFs may be stored in a memory, e.g., memory 270, for use in decoding. In embodiments, the ASSA may be utilized with any given speech coding parameter, such as, but not limited to, pitch, line spectral pairs (LSPs), pitch gain, fixed codebook gain, etc.

Pitch and pitch period are now described in detail. The pitch distribution for voiced and unvoiced speech is significantly different. To better exploit the pitch redundancy, a voiced/unvoiced classifier is employed at the joint source channel decoder (e.g., JSCD block 216), and separate PDFs are used for each classification.
The correlation of pitch parameters may be performed with respect to the pitch in sub-frames of a given frame, past frames, and/or future frames. For voiced speech, the pitch is highly correlated in time. To exploit this, the pitch for the current sub-frame is predicted based on the pitch history. The probability density function (PDF) of the difference between the index of the quantized predicted pitch and the index of the actual pitch is obtained over a large database offline. Then during online processing, the PDF is centered about the index of the quantized predicted pitch to obtain the term (x0i|Ŷ—1). The performance of this approach is dependent upon the accuracy of the predicted pitch. Having a future frame available would greatly improve accuracy. For example, in the case where the previous and future frames are correctly decoded, the pitch can be obtained through interpolation. In addition, processing and/or logic may be implemented in the case of pitch halving/doubling. In one approach to interpolation for the case of an AMR 12.2 codec with four sub-frame pitch values, the decoded pitch in the 4th sub-frame of the last frame, p4(n−1), and the pitch in the 1st sub-frame of the future frame, p1 (n+1), are used to predict the pitch in the current frame:

{circumflex over (p)}i(n)=p4(n−1)+0.2·i·(p1(n+1)−p4(n−1)), where i=1 . . . 4.  (12)

In the case where the current frame is classified as a transitional frame, care must be taken in the pitch prediction. In general, the predicted pitch should be set to the pitch of the neighboring frame that was classified as voiced speech. In the case that frame n+1 is classified as voiced:

{circumflex over (p)}i(n)=p1(n+1), where i=1 . . . 4.  (13)

In the case that frame n−1 is classified as voiced:

{circumflex over (p)}i(n)=p4(n+1), where i=1 . . . 4.  (14)

Alternatively, a joint PDF approach may be used. The index of the quantized pitch in p4(n−1) and p1(n+1) may be used to index the joint PDF.

LSPs are next described in detail. Generally speaking, LSPs provide a representation of the spectrum of speech on a frame by frame basis. LSPs are derived from the linear prediction coefficients (LPCs) and are used in place of LPCs because they have better quantization properties. The LSPs are highly correlated with neighboring frames and thus also benefit from having future frame information. Several approaches may be used to exploit this. In one approach, a joint PDF may be used. In this case, the indices representing the LSPs in the previous frame and the future frame may be used in the joint PDF and be based on the quantization scheme of the LSP vector.
Alternatively, the LSP vector in the current frame may be predicted from the past and/or future frames. The manner in which the future frame is used in the prediction is dependent upon the quantization scheme used. In the case of an AMR 12.2 codec, a 1st order moving average prediction is used where the decoded LSPs in the future frame are dependent on the quantization residual of the current frame, however several approaches are possible. In one approach, the prediction residual is interpolated instead of the LSPs themselves. In another approach, the previous frame is used to predict the value of the LSPs in the current frame from which the estimated prediction residual can be derived. This estimated residual for the current frame is then used to decode the LSPs in the future frame. Interpolation is then performed in the LSP domain to obtain an estimate of the LSPs in the current frame. Still other approaches may also be used.
It should be noted that if there are too many error frames in the history buffer, the predicted LSP vectors may be unreliable. In this case, the PDF of the codebook indices is used directly. Using the PDF of the codebook indices does not exploit the temporal redundancy remaining in the indices after moving average prediction, but provides better performance in high packet loss rate conditions. In either case, separate PDFs are used for voiced and unvoiced speech.
Pitch gain is next described in detail. Pitch gain is highly correlated from frame to frame. A joint PDF approach may also be used to exploit the correlation with neighboring sub-frames. However, within the current frame, bit-errors may be present due to the fact that the turbo decoder has yet to converge. If a future frame has been decoded correctly, better performance may be achieved by using the error-free index of the first sub-frame of the future frame instead. Alternatively, an interpolation scheme similar to that used for the pitch could be used, as described above. The pitch gain is predicted based on the past and future frame. The PDF of the index error between the actual pitch gain and the quantized predicted pitch gain may be used. Separate PDFs are used for voiced and unvoiced speech.
The fixed codebook gain is also highly correlated from frame to frame. Similar approaches to those listed above can be used, with the exact approach dependent on the quantization scheme used for the gain.
The next section describes jitter buffer enhanced JSCD embodiments, with respect to jitter buffer implementation 300 and JSCD block 216 as described above, in which parameter domain correlation of packet headers is utilized to improve channel decoding.
8. Example Jitter Buffer Enhanced Joint Source Channel Decoding Embodiments that Exploit Packet Field Redundancy
A Packet Header Statistics Algorithm (PHSA) is described that uses a priori knowledge of a protocol stack (e.g., the LTE protocol stack) to facilitate joint source channel decoding. Models of each protocol layer are developed which predict the values of the headers in future frames. In particular, models (e.g., probability density functions (PDFs)) are obtained for certain header elements and are applied to update the soft bit values that are obtained for each element as part of a joint source channel decoding process. Because of the significant redundancy introduced in the headers by the protocol stack, the PHSA used in conjunction with a joint source channel turbo decoder provides significant improvement in decoding performance. It should be noted that while the PHSA is described in terms of “packet headers” and “packet header redundancy,” other packet fields may be utilized with the PHSA embodiments described herein. As such, the term “packet field redundancy” may be used interchangeably with “packet header redundancy.” It should also be noted that at lower operating rates, the percentage of signal redundancy with respect to packet headers increases, thus offering even greater benefits.
Packet header redundancy may be utilized with the parameter-based probability equations noted in the sections above (e.g., Equations 3, 6, and 7). To apply parameter based probability, one or more a-priori probability density functions (PDFs) are generated based on known and/or previous header information. For example, the probability of a given vector (e.g., header field) based on a given frame (e.g., a previous or a future frame) may be shown using Equation 11:

P(x0i|{circumflex over (Y)}—1) or more generally, P(x0i|{circumflex over (Y)}),  (11)

as noted above. Generated a-priori PDFs may be stored in a memory (e.g., memory 270) for use in decoding. In embodiments, the PHSA may be utilized with any packet header parameters, such as headers associated with, but not limited to, a MAC layer, an RLC layer, a PDCP layer, and an RoHC layer, as well as an RTP payload, transport block padding, and/or the like. Examples of redundancy in these parameters are discussed below.

The availability of future frames increases the benefits described above. For example, network layers in the LTE protocol stack may contain a sequence number. The PDF of a sequence number can be derived from observing the sequence number of arriving packets. The availability of future packets can be used in computing the associated likelihoods. Assume the PDF indicates that the probability that a packet arrives out of sequence by one packet is 1%, and the probability that it arrives out of sequence by two packets is 0.1%, and the probability that it arrives out of sequence by more than two packets is 0.0%. If no future frames are available, then the probability that the current packet n is in sequence is 98.9%. However, if packet n+1 is in the jitter buffer (e.g., jitter buffer 256) or soft bits associated with packet n+1 are in a second jitter buffer (e.g., secondary jitter buffer 302), the probability that the current packet is in sequence may be 99.9%.
In some embodiments, the probability of a packet arriving out of sequence by ‘n’ packets (where n=−N1, −N1+1, −N1+2, . . . , 0, 1, 2, . . . , N2) is determined by observing the past history of received packets which were correctly decoded. This can be done in a number of ways. For example, a sliding window of length ‘M’ packets can be used. The number of times a packet arrives out of sequence by n is maintained. If ni is the number observed in the last M packets for when n=i′, then the probability that the packet is out of sequence by I packets is given by




  
    n
    i
  
  M




(ni divided by M). In some embodiments, a running average approach can be used with a forgetting factor α. The probability of each n is initialized to an estimate, which may be predefined or determined on a case-by-case basis. If it is observed that the last packet arrived out of sequence by ‘j’ packets, then if the probability estimate of n=i at time T is denoted P(n=i)t, the probabilities are updated by:

P(n=j)t+1=[P(n=j)t×α]+[1−α]  (15), and

P(n=i)t+1=P(n=i)t×α, for i≠j.  (16)

In either method, the value of M or a can be determined or adjusted based on the expected network conditions. It is contemplated that other methods can be used to estimate the probabilities and will be equally applicable to the embodiments and techniques described herein.

Next, the PDF for each possible sequence number is obtained. If the last sequence number SN(t)=sn, and the sequence number is of length ‘B’ bits, then:

P(SN(t+1)=(sn+1+v)% B)=P(n=v)t+1,  (17)

where ‘v’ is the number of packets by which sn is out of order and where ‘%’ denotes the modulus operator. Once the PDF is built according to Equation 17, the determination of probabilities described above with respect to Equations 3 and 4 may be used. Generally speaking, the approach described with respect to Equations 15, 16, and 17 can be extended to monitoring received bits, estimating their probabilities, and applying this a-priori knowledge to improve channel decoding.

The RLC header includes a five-bit sequence number. The sequence number increments by one in each subsequent packet. The starting value of the sequence number can be obtained by observing the sequence number in the first correctly received packet while setting the corresponding bit probabilities to 0.5. After obtaining the sequence number, the sequence number for the next packet is predicted by incrementing the value by 1. Because of the possibility of duplicate and out-of-sequence packets, the LSBs of the sequence number are less predictable than the MSBs. The probabilities can be obtained based on the past history of received packets. A “forgetting factor” is used to ensure that the statistics adapt to changing network behavior.
The PDCP header includes a seven-bit sequence number. The sequence number increments by one in each subsequent packet. The PDCP header sequence number may be treated similarly to the RLC header sequence number described above.
A four-bit codec mode request (CMR) field occupies the four MSBs of the RTP payload. Changes in CMR values are infrequent. In one embodiment, prior and/or future CMR values are used to predict the current CMR value. Because a change in CMR is unpredictable, the probabilities would have to be reduced substantially to correctly decode a packet with a change in CMR, but this would dramatically reduce the improvement obtained from the correct CMR prediction for the vast majority of the frames. To help alleviate this concern, a tradeoff may be made in which the possible values of the CMR field can be reduced by considering the negotiated codec mode set that is determined during call setup, as specified in IR.92. Thus, in one embodiment, probabilities may be increased while still allowing for properly decoded packets.
A six-bit table of contents (ToC) field occupies the next six MSBs of the RTP payload. The ToC filed may be handled similarly to the CMR field.
Additional considerations are contemplated for parameters that correspond to sequence numbers. That is, PRAB elements (e.g., PRAB sub-blocks) may contain logic and/or decision blocks/modules to improve correlation of sequence numbers such as the “forgetting factor” described herein. It is contemplated that for instances of sequence number “roll over,” especially concerning the most significant bits in the value, the embodiments described herein account for such possibilities to enable proper parameter domain correlation.
The next section describes further example embodiments and advantages for jitter buffer enhanced joint source channel decoding.
9. Further Example Embodiments and Advantages for Jitter Buffer Enhanced Joint Source Channel Decoding
The embodiments described herein enable jitter buffer enhanced JSCD. Jitter buffer enhanced JSCD may be further extended to use parameter domain correlation. Embodiments provide delayed and iterative jitter buffer approaches to improve channel decoding. It is contemplated, however, that the jitter buffer enhanced JSCD embodiments described may be applicable to decoding strategies and implementations other than those explicitly set forth herein. For example, decoders in addition to turbo decoders may be used to exploit the benefits of jitter buffer enhanced decoding. Likewise, other jitter buffer implementations may be used to improve jitter buffer enhanced JSCD. For example and without limitation, additional jitter buffers may be used, different jitter buffer partitioning may be used, additional channel decoders may be used, etc. Further, protocols other than LTE and VoLTE may also benefit from jitter buffer enhanced JSCD as described above. Still further, alternative probability determination strategies are also contemplated as being applicable in jitter buffer enhanced JSCD implementations.
It will be recognized that the systems, their respective components, and/or the techniques described herein may be implemented in hardware, software, firmware, or any combination thereof, and/or may be implemented as hardware logic/electrical circuitry. The disclosed technologies can be put into practice using software, firmware, and/or hardware implementations other than those described herein. Any software, firmware, and hardware implementations suitable for performing the functions described herein can be used, such as those described below.
10. Further Example Embodiments for Joint Source Channel Decoding using Parameter Domain Correlation
As noted in the above-described LTE architecture 200, a receiver may be configured in ways to perform joint source channel decoding (JSCD). For example, a joint source channel decoding embodiment using the Long Term Evolution (LTE) standard and turbo decoding is described in this section. For instance, FIG. 5 shows a block diagram of a portion of a JSCD block 500 adapted to perform joint source channel decoding as described herein, according to embodiments. JSCD block 500 may be a further embodiment of JSCD block 216 described with respect to FIG. 2 above.
JSCD block 500 functions by injecting a-priori information into each of a first Maximum A-posteriori (MAP) decoder (non-interleaved) and a second MAP decoder (interleaved) of a modified turbo decoder. The first and second MAP decoders perform decoding to converge on a hard decision (representing the determination of the decoders of the actual data bits in a data packet) or until a predetermined number of iterations are performed. Some previous solutions perform JSCD by injecting a-priori information into only a non-interleaved MAP decoder. JSCD block 500 avoids positive feedback of source statistics from one MAP decoder to the other by subtracting out extrinsic data of the source from the soft bit outputs of the MAP decoder (e.g., log likelihood ratios (LLRs) representing the “soft decision” of a MAP decoder with respect to whether a given bit in a data stream is likely to be a “1” or a “0”). In embodiments, the source statistics may be one or more probabilities that incoming data bits are ones or zeroes based upon the received data bits. The soft bits resulting from this subtraction are input to a Packet Redundancy Analysis Block which generates extrinsic information to be provided to the companion MAP decoder along with extrinsic information from the first MAP decoder. Accordingly, JSCD block 500 performs JSCD by injecting a-priori information into both the first and second MAP decoders without feedback of source statistics. It has been observed that this doubles an improvement achievable when injecting a-priori information into only a non-interleaved MAP decoder. As illustrated in FIG. 5, JSCD block 500 includes a turbo decoder 552 (shown with a dashed outline for illustrative purposes), a first Packet Redundancy Analysis Block (PRAB) 506, and a second PRAB 508. Turbo decoder 552 includes a first MAP decoder 502 and a second MAP decoder 504. Turbo decoder 552 also includes an interleaver block 518, and interleaver block 540, a de-interleaver block 542, an adder block 544, and adder block 546, a subtractor block 548, and a subtractor block 550. First PRAB 506 includes a first A-priori Speech Statistics Algorithm (ASSA) block 530 and a first Packet Header Statistics Algorithm (PHSA) block 532. Second PRAB 508 includes a second ASSA block 534 and a second PHSA block 536.
Turbo decoder 552 receives inputs including soft data bits and soft parity bits (e.g., from first turbo decoder 214 in PHY layer 202, as shown in FIG. 2) and extrinsic information from first and second PRABs 506/508. For example, first MAP decoder 502 receives soft data bits on line 510 and soft parity bits on line 512, while second MAP decoder 504 receives interleaved soft data bits on line 514 via interleaver block 518 (which interleaves the data) and soft parity bits on line 512. Turbo decoder 552 also receives extrinsic information as inputs from first PRAB 506 and second PRAB 508 via lines 562 and 564, respectively. Turbo decoder 552 provides, as output signals, soft bits (e.g., LLRs or soft decisions) to first PRAB 506 and second PRAB 508 via lines 566 and 538, respectively. First PRAB 506 and second PRAB 508 also receive soft bits as inputs (e.g., from first turbo decoder 214 in PHY layer 202, as shown in FIG. 2) via lines 554 and 556 respectively. First PRAB 506 and second PRAB 508 also receive, via lines 558 and 560 respectively, and/or store (e.g., in a memory (not shown) that is local to and/or external to JSCD block 500) a-priori probability information (e.g., reference data) and information from past, current, or future frames relating to parameter values.
In embodiments, first MAP decoder 502 provides first MAP soft bits (e.g., LLRs or soft decisions) via line 524 to subtractor block 548. Subtractor block 548 receives extrinsic information from second PRAB 508 via line 562 and subtracts the extrinsic information from the first MAP soft bits. The output of subtractor block 548 is provided to first PRAB 506 via line 566 as described above. Second MAP decoder 504 provides second MAP soft bits (e.g., LLRs or soft decisions) via line 526 and de-interleaver block 542 (which de-interleaves the data) to second PRAB 508 in a similar manner as first MAP decoder 502. That is, when second MAP decoder 504 provides the second MAP soft bits to second PRAB 508, the first PRAB extrinsic data is removed from the second MAP soft bit output at subtractor block 550, which also uses line 564 as an input, and the output of subtractor block 550 is provided to second PRAB 508 via line 538. Additionally, first MAP decoder 502 and second MAP decoder 504 provide their own respectively generated extrinsic data to each other as inputs. First MAP decoder 502 outputs extrinsic data via line 528 to adder block 546. Adder block 546 also takes extrinsic data from first PRAB 506 as an input via line 564. Adder block 546 outputs the combined extrinsic data to second MAP decoder 504 on line 522 via interleaver block 540 (which interleaves the data). Similarly, second MAP decoder 504 outputs extrinsic data, via line 530 and de-interleaver block 542 (which de-interleaves the data), to adder block 544. Adder block 544 also takes extrinsic data from second PRAB 508 as an input via line 562. Adder block 544 outputs the combined extrinsic data to first MAP decoder 502 on line 520. In this way, turbo decoder 552 prevents improper and/or premature convergence for its hard bit decisions.
In embodiments, first PRAB 506 and/or second PRAB 508, including their respective sub-components, may monitor incoming data bits received in one or more frames over a channel. The incoming data bits may be monitored in real-time or substantially in real-time in embodiments. First PRAB 506 and/or second PRAB 508, including their respective sub-components, may generate one or more received statistics based on the monitored data bits and may generate a conditional probability based exclusively on the received statistics. In embodiments, the received statistics may be one or more probabilities that incoming data bits are ones or zeroes based upon the received data bits. The generated conditional probability may be utilized (e.g., when provided to a decoder such as turbo decoder 552) to perform channel decoding of future bits received over the channel.
JSCD block 500 and each of the elements included therein may be implemented in hardware, or a combination of hardware and software and/or firmware. Further details concerning example JSCD blocks with modified turbo decoder architectures that support JSCD, such as that described above or alternative implementations thereof, may be found in commonly-owned co-pending U.S. patent application Ser. No. 13/749,187, entitled “Modified Joint Source Channel Turbo Decoder” and in commonly-owned co-pending U.S. patent application Ser. No. 13/748,904, entitled “Joint Source Channel Decoding Using Parameter Domain Correlation” each filed on Jan. 24, 2013, and each of which is incorporated by reference in its entirety as if fully set forth herein.
JSCD may be performed in accordance with the embodiments described above. In accordance with embodiments described in this section, JSCD is performed using correlation of parameters within and associated with the data to improve decoding. Furthermore, the parameter correlation embodiments described in the above sections with respect to the Equations provided herein is also applicable to embodiments described in this section.
Because parameter correlation may implemented on the decoder side in embodiments, interoperability with other LTE equipment (e.g., encoders and related circuitry) will not be affected. Furthermore, parameter domain correlation significantly out-performs bit domain correlation in JSCD. As an illustrative reference, consider an exemplary parameter index with a value of 256 which in binary is ‘100000000’. If the next index in time (e.g., in the next transmission frame) is 257 (binary ‘100000001’), there is a high degree of correlation in the bit domain. However, if the next parameter index is 255 (binary ‘011111111’), there is a very low degree of correlation in the bit domain, even though the parameter value varied only slightly from one frame to the next. It should be noted that this lack of correlation becomes more pronounced from MSBs to LSBs. However, if correlation in the parameter domain is used, the shortcomings of bit domain correlation are alleviated and/or overcome as, for example, values of 255, 256, and 257 have a strong correlation when viewed as parameters instead of individual bits.
Still further, the above approaches can also be extended to include parameters in future frames. For example, if a future frame has already been decoded successfully, the formulation could again be simplified in those cases.
Referring again to FIG. 5, parameter correlation is utilized in first PRAB 506 and in second PRAB 508 to generate conditional probabilities, according to embodiments. As described above, first PRAB 506 receives as an input soft bits (e.g., LLRs or soft decisions) that are generated by first MAP decoder 502. Any extrinsic information from second PRAB 508 is removed before being input into first PRAB 506. First PRAB 506 then provides its generated extrinsic information as an input to second MAP decoder 504. Second MAP decoder 504 provides its generated soft bits to second PRAB 508 as an input, and any extrinsic information from first PRAB 506 is removed before being input into second PRAB 508. Second PRAB 508 then provides its generated extrinsic information as an input to first MAP decoder 502. The process continues until a specified number of iterations have been reached or a solution has been converged upon.
An example of parameter domain correlation is now described with reference to FIG. 5 and Equation 3. First PRAB 506 may receive soft bit LLR information from turbo decoder 552 (e.g., from first MAP decoder 502). The soft bit LLR information includes the soft decisions of turbo decoder 552, i.e., LLRs or the likelihood that each bit in a received data packet is a ‘1’ or a ‘0’. Certain values of the bit likelihoods may correspond to one or more parameters associated with the data packet. For instance, an exemplary parameter having 5 data bits may correspond to three consecutive soft bits in the LLR domain (i.e., LLRs or LLR information). The soft bit LLR information indicates whether turbo decoder 552 has determined the given 3 data bits are likely to be ones (‘1’) or zeroes (‘0’). In the instant example, consider the soft bit LLR information from turbo decoder 552 to comprise the values {−2.509, +11.301, −0.988} indicating a likelihood that the 3-bit vector value is ‘010’.
For a given parameter having M bits, Equation 3 is performed 2M×M times (in the instant example, 2M×M=23×3=8×3=24 times), where 2M is the number of parameter values possible (e.g., 8 possible bit combinations for a 3-bit value). That is, when considering bit m=0 (e.g., the LSB), the probability of vectors ‘000’, ‘001’, ‘010’, ‘011’ . . . ‘111’ are each computed as described above in Equation 3. Similarly, the parameter-based probability of vectors ‘000’, ‘001’, ‘010’, ‘011’ . . . ′111′ are each determined when considering bits m=1 and m=2 of the vector. This approach yields probabilities for each bit in the parameter using a parameter-based correlation. In a 3-bit vector with 8 possible values, the possible vector values include 4 instances of ‘0’ and 4 instances of ‘1’ for each bit m as shown in the following table (Table 1).







TABLE 1







Table 1: Exemplary 3-Bit Parameter














m = 2
m = 1
m = 0
Pm=2
Pm=1
Pm=0

















x01
0
0
0
0.05
0.1
0.2


x02
0
0
1
0.2
0.05
0.1


x03
0
1
0
0.35
0.2
0.3


x04
0
1
1
0.05
0.2
0.05


x05
1
0
0
0.05
0.1
0.1


x06
1
0
1
0.1
0.2
0.05


x07
1
1
0
0.1
0.1
0.1


x08
1
1
1
0.1
0.05
0.05









As shown in Table 2, Pm=0 is the probability that the example parameter is x0i when considering bit m=0, Pm=i is the probability that the example parameter is x0i when considering bit m=1, and Pm=2 is the probability that the example parameter is x0i when considering bit m=2.

The resulting probabilities from Equation 3 for a given vector representation of a parameter, considering each bit in turn, may be combined to give an overall probability that each bit in the parameter is a 1′ or a ‘0’ as provided in the soft bits from turbo decoder 552. For instance, consider the example parameter above and the example soft bit LLR information {−2.509, +11.301, −0.988} from turbo decoder 552 (indicating a likelihood that the 3-bit vector value is ‘010’). Referencing Table 1, the probabilities from column Pm=0 for each instance where the vector value is ‘0’ for bit m=0 are added to determine the overall probability that the parameter value is ‘0’ for bit m=0. Hence, the values for m=0 of rows x01, x03, x05, and x07 are added: 0.2+0.3+0.1+0.1=0.7. In this example, the probability for bit m=0 that the parameter bit value is ‘0’ is 0.7, and the probability of a ‘1’ is 0.3. The probabilities from column Pm=j for each instance where the vector value is ‘1’ for bit m=1 are added to determine the overall probability that the parameter value is ‘1’ for bit m=1. Hence, the values for m=1 of rows x03, x04, x07, and x08 are added: 0.2+0.2+0.1+0.05=0.55. In this example, the probability for bit m=1 that the parameter value is ‘1’ is 0.55, and the probability of a ‘0’ is 0.45. The probabilities from column Pm=2 for each instance where the vector value is ‘0’ for bit m=2 are added to determine the overall probability that the parameter bit value is ‘0’ for bit m=2. Hence, the values for m=2 of rows x01, x02, x03, and x04 are added: 0.05+0.2+0.35+0.05=0.65. In this example, the probability for bit m=2 that the parameter bit value is ‘0’ is 0.65, and the probability of a ‘1’ is 0.35.
Given that the example soft bit LLR information from turbo decoder 552 indicated a parameter value of ‘010’, the exemplary overall probabilities determined by first PRAB 506 in this case agree with the soft decision of turbo decoder 552 (e.g., from first MAP decoder 506). The exemplary overall probabilities are used to compute soft bits or LLR information (as shown in Equation 10 above) that are provided from first PRAB 506 to turbo decoder 552 (e.g., to second MAP decoder 504). For example, the three soft bits of the LLR information computed by first PRAB 506 are determined as:



  
    
      
        L
        ⁡
        
          (
          
            x
            k
          
          )
        
      
      =
      
        
          
            log
            ⁢
            
              
            
            [
            
              0.3
              0.7
            
            ]
          
          ⁢
          
            
          
          ⁢
          for
          ⁢
          
            
          
          ⁢
          bit
          ⁢
          
            
          
          ⁢
          parameter
          ⁢
          
            
          
          ⁢
          bit
          ⁢
          
            
          
          ⁢
          m
        
        =
        0
      
    
    ,
    
      

    
    ⁢
    
      
        L
        ⁡
        
          (
          
            x
            k
          
          )
        
      
      =
      
        
          
            log
            ⁢
            
              
            
            [
            
              0.55
              0.45
            
            ]
          
          ⁢
          
            
          
          ⁢
          for
          ⁢
          
            
          
          ⁢
          bit
          ⁢
          
            
          
          ⁢
          parameter
          ⁢
          
            
          
          ⁢
          bit
          ⁢
          
            
          
          ⁢
          m
        
        =
        1
      
    
    ,
    and
  




  
    
      L
      ⁡
      
        (
        
          x
          k
        
        )
      
    
    =
    
      
        
          log
          ⁢
          
            
          
          [
          
            0.35
            0.65
          
          ]
        
        ⁢
        
          
        
        ⁢
        for
        ⁢
        
          
        
        ⁢
        bit
        ⁢
        
          
        
        ⁢
        parameter
        ⁢
        
          
        
        ⁢
        bit
        ⁢
        
          
        
        ⁢
        m
      
      =
      2.
    
  



Second MAP decoder 504 may use this input to compute its own soft bits (LLRs) which may in turn be provided by turbo decoder 552 to second PRAB 508, and the exemplary process described above may be repeated by then using second PRAB 508 to provide soft bits (LLRs) to first PRAB 506, and so on.
It should be noted that while a 3-bit parameter is described in the example above, different sized parameters are contemplated, and that the soft bits (LLRs) provided and received by the elements of FIG. 5 described in the example above may include soft bit likelihood representations of each bit in a data packet, but only a 3-bit parameter is described for the sake brevity and clarity of illustration.
11. Example Operational Embodiments
The embodiments described herein may perform their functions in various ways. For example, FIG. 4A shows a flowchart 400A providing example for jitter buffer enhanced JSCD, according to an exemplary embodiment. In one embodiment, flowchart 400A shows for delayed jitter buffer enhanced JSCD. LTE architecture 200 of FIG. 2, JSCD block 216, and JSCD block 500 of FIGS. 2, 3, and 5, respectively, jitter buffer implementation 300 of FIG. 3, computer 900 of FIG. 9, and/or any of their respective components/circuits may each operate according to flowchart 400A, in embodiments. Other structural and operational embodiments will be apparent to persons skilled in the relevant art(s) based on the discussion regarding flowchart 400A. Flowchart 400A is described as follows.
Flowchart 400A may begin with 402. In 402, a plurality of hard bits may be stored in a first memory buffer. The plurality of hard bits may be representative of one or more subsets of hard bits associated with properly channel decoded frames. Referring back to FIG. 3, jitter buffer 256 may receive and store a plurality of hard bits from first turbo decoder 214, optional JSCD block 304, and/or JSCD block 216.
In 404, a plurality of soft bits may be stored in a second memory buffer. The plurality of soft bits may be representative of one or more subsets of soft bits associated with improperly channel decoded frames. Referring again to FIG. 3, secondary jitter buffer 256 may receive and store a plurality of soft bits from first turbo decoder 214 and/or optional JSCD block 304.
In 406, joint source channel decoding may be performed on a first subset of the plurality of soft bits based upon one or more of at least a portion of the plurality of hard bits and a second subset of the plurality of soft bits. The first subset may be associated with a first segment of an audio signal, and the one or more of at least a portion of the plurality of hard bits and the second subset may be associated with a second segment of the audio signal that was generated subsequent to the first segment. For example, JSCD block 216 of FIG. 3 may receive the first subset, and at least a portion of the plurality of hard bits and/or a second subset of the plurality of soft bits, and use the received information to perform JSCD on the first subset.
In some example embodiments, one or more 402, 404, and/or 406 of flowchart 400A may not be performed. Moreover, operations in addition to or in lieu of 402, 404, and/or 406 may be performed. Further, in some example embodiments, one or more of 402, 404, and/or 406 may be performed out of order, in an alternate sequence, or partially (or completely) concurrently with each other.
FIG. 4B shows a flowchart 400B providing example for jitter buffer enhanced JSCD, according to an exemplary embodiment. In one embodiment, flowchart 400B shows iterative jitter buffer enhanced JSCD. LTE architecture 200 of FIG. 2, JSCD block 216 of FIGS. 2 & 3, jitter buffer implementation 300 of FIG. 3, computer 600 of FIG. 6, and/or any of their respective components/circuits may each operate according to flowchart 400B, in embodiments. Other structural and operational embodiments will be apparent to persons skilled in the relevant art(s) based on the discussion regarding flowchart 400B. Flowchart 400B is described as follows.
Flowchart 400B may begin with 408. In 408, a plurality of hard bits may be stored in a first memory buffer. The plurality of hard bits may be representative of one or more subsets of hard bits associated with properly channel decoded frames. Referring back to FIG. 3, jitter buffer 256 may receive and store a plurality of hard bits from first turbo decoder 214, optional JSCD block 304, and/or JSCD block 216.
In 410, a plurality of soft bits may be stored in a second memory buffer. The plurality of soft bits may comprises two or more subsets of soft bits. The plurality of soft bits may be representative of two or more subsets of soft bits associated with improperly channel decoded frames. Referring again to FIG. 3, secondary jitter buffer 256 may receive and store a plurality of soft bits from first turbo decoder 214 and/or optional JSCD block 304.
In 412, joint source channel decoding may be performed on each of the two or more subsets based upon at least a portion of the plurality of hard bits and each other subset. The first subset of the two or more subsets may be associated with a first segment of an audio signal, and one or more of the at least a portion of the plurality of hard bits and a second subset of the two or more subsets may be associated with a second segment of the audio signal that was generated subsequent to the first segment. For example, JSCD block 216 of FIG. 3 may receive each subset, and at least a portion of the plurality of hard bits and each other subset, and use the received information to perform JSCD on each subset.
In some example embodiments, one or more 408, 410, and/or 412 of flowchart 400B may not be performed. Moreover, operations in addition to or in lieu of 408, 410, and/or 412 may be performed. Further, in some example embodiments, one or more of 408, 410, and/or 412 may be performed out of order, in an alternate sequence, or partially (or completely) concurrently with each other.
FIG. 6 shows a flowchart 600 for using parameter-based correlation in channel decoding, in exemplary embodiments. In some embodiments, flowchart 600 may be a further embodiment those set forth herein, e.g., jitter buffer enhanced JSCD embodiments, and with respect to Equations 3 and 4 described above. LTE architecture 200 of FIG. 2, JSCD block 216, and JSCD block 500 of FIGS. 2, 3, and 5, respectively, jitter buffer implementation 300 of FIG. 3, computer 900 of FIG. 9, and/or any of their respective components/circuits may each operate according to flowchart 600, in embodiments. Further, as describe herein with respect to flowchart 600, a first parameter may comprise one of a predefined set of vectors as shown, for instance, above in the example of parameter domain correlation in Sections 6 and 10. Other structural and operational embodiments will be apparent to persons skilled in the relevant art(s) based on the discussion regarding flowchart 600. Flowchart 600 is described as follows.
Flowchart 600 may begin with 602. In 602, a first plurality of soft bits representative of a first parameter included in a frame is received, each soft bit of the first plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one, the first parameter comprising a plurality of bits in the frame. The first plurality of soft bits may be received at a PRAB, an ASSA block, and/or a PHSA block. For example, referring again to FIG. 5, first PRAB 506 may receive a first plurality of soft bits (e.g., LLRs as described above) from turbo decoder 552 (e.g., from first MAP decoder 502). In some embodiments, the first plurality of soft bits may be received by first PRAB 506 via line 554 from turbo decoder 214 (shown in FIGS. 2 & 5).
In 604, a second plurality of soft bits representative of the first parameter is generated based on the first plurality of soft bits and at least one conditional probability based at least on a correlation of the first parameter and one or more other parameters included in the first frame and/or one or more parameters included in other frames, each soft bit of the second plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one. The second plurality of soft bits (e.g., LLRs) may be may be representative of a second probability that one or more bits of a second parameter in a first frame are each a zero or a one respectively, and may be determined at a PRAB, an ASSA block, and/or a PHSA block. The second plurality of soft bits may be generated based upon a correlation of the first parameter and one or more other parameters included in the first frame and/or one or more parameters included in other frames. For example, referring again to FIG. 5, first PRAB 506 may determine a second plurality of soft bits using first ASSA block 530 (e.g., for a speech parameter) and/or first PHSA block 532 (for a packet header/field parameter). The second plurality of soft bits may be determined, in whole or in part, in accordance with one or more of the Equations described above.
In 606, the second plurality of soft bits is provided to a first channel decoder. For example, first PRAB 506 may provide the determined second plurality of soft bits to turbo decoder 552. In embodiments, second MAP decoder 504 may receive the second plurality of soft bits from first PRAB 506.
It is also contemplated that, while flowchart 600 is described in terms of receiving the first soft bit likelihood at first PRAB 506 from turbo decoder 552 (and first MAP decoder 502) or turbo decoder 214, determining the first plurality of soft bits at first PRAB 506, and providing it to turbo decoder 552 (and second MAP decoder 504), in embodiments, flowchart 600 may be performed in terms of receiving the first plurality of soft bits at second PRAB 508 from turbo decoder 552 (and second MAP decoder 504) or turbo decoder 214, determining the second plurality of soft bits at second PRAB 508, and providing it to turbo decoder 552 (and first MAP decoder 502). Additionally, it is contemplated that several iterations of flowchart 600 may be performed in an exemplary manner as follows (and as described in the sections above): (1) receive the first plurality of soft bits at first PRAB 506 from turbo decoder 552 (and first MAP decoder 506), (2) determine the second plurality of soft bits at first PRAB 506, (3) provide it to turbo decoder 552 (and second MAP decoder 504), (4) receive an additional plurality of soft bits at second PRAB 508 from turbo decoder 552 (and second MAP decoder 504), (5) determine yet another plurality of soft bits at second PRAB 508, and (6) provide it to turbo decoder 552 (and first MAP decoder 502). The exemplary iterative manner of performance just described may be repeated as required by design.
In some example embodiments, one or more of 602, 604, and/or 606 of flowchart 600 may not be performed. Moreover, operations in addition to or in lieu of 602, 604, and/or 606 may be performed. Further, in some example embodiments, one or more of 602, 604, and/or 606 may be performed out of order, in an alternate sequence, or partially (or completely) concurrently with each other.
FIG. 7 shows a flowchart 700 for using parameter-based correlation in channel decoding, in exemplary embodiments. In some embodiments, flowchart 700 may be a further embodiment those set forth herein, e.g., jitter buffer enhanced JSCD embodiments, and with respect to Equations 3 and 4 described above. LTE architecture 200 of FIG. 2, JSCD block 216, and JSCD block 500 of FIGS. 2, 3, and 5, respectively, jitter buffer implementation 300 of FIG. 3, computer 900 of FIG. 9, and/or any of their respective components/circuits may each operate according to flowchart 700, in embodiments. Further, as describe herein with respect to flowchart 700, a first parameter may comprise one of a predefined set of vectors as shown, for instance, above in the example of parameter domain correlation in Sections 6 and 10. Other structural and operational embodiments will be apparent to persons skilled in the relevant art(s) based on the discussion regarding flowchart 700. Flowchart 700 is described as follows.
Flowchart 700 may begin with 702. In 702, the first or next bit in the first parameter are considered. Each bit in the parameter may be considered, as will become apparent in the description of flowchart 700. That is, for each bit in the first parameter, the following may be performed. For example, each bit m of the illustrative M-bit parameter described in the example of parameter domain correlation in Section 6 is considered.
In 704, the first or next vector of the set of vectors is considered. Each vector in the set is be considered for each bit considered in 702, as will become apparent in the description of flowchart 700. That is, for each bit in the first parameter, each vector in the set of vectors is considered. For example, each vector x01 through x07 described in the example of parameter domain correlation in Section 10 and Table 1 is considered for each bit of the parameter. Once a vector is considered, the flowchart proceeds to 706.
In 706, a conditional probability density function (PDF) is applied to determine a first probability that the first parameter is equal to the vector given the value of the one or more other parameters included in the first frame and/or the one or more parameters included in the other frames. In embodiments, the term P(x0i|Ŷ—1) of Equation 3 may correspond to the PDF.
In 708, the first probability is multiplied by a second probability that the first parameter is equal to the vector given the value of the soft bits associated with the other bits in the first parameter. In embodiments, the term Pm (x0i|x0\m) of the numerator of Equation 3 may correspond to the second probability.
In 710, the product of the multiplying (708) is normalized. This normalization may be performed, for example, using the denominator of Equation 3.
In 712, it is determined whether the current considered vector is the last vector of the set of vectors. If not, at 714 the flowchart returns to 704 where the next vector of the set is considered. If so, at 714 the flowchart proceeds to 716.
In 716, the probabilities associated with each vector in the set of vectors for which the bit in the vector is the same value as the bit in the first parameter are summed 716 may be exemplified in embodiments using Equation 4 described above.
At 718, it is determined if the current considered parameter bit is the last bit in the first parameter. If not, at 720 the flowchart returns to 702 where the next bit in the first parameter is considered. If so, from 720 the flowchart ends.
It is contemplated that, while flowchart 700 may be exemplified by in the example of parameter domain correlation in Section 7, the application of flowchart 700 is not so limited.
In some example embodiments, one or more 702, 704, 706, 708, 710, 712, 714, 716, 718, and/or 720 of flowchart 700 may not be performed. Moreover, operations in addition to or in lieu of 702, 704, 706, 708, 710, 712, 714, 716, 718, and/or 720 may be performed. Further, in some example embodiments, one or more of 702, 704, 706, 708, 710, 712, 714, 716, 718, and/or 720 may be performed out of order, in an alternate sequence, or partially (or completely) concurrently with each other.
A further example embodiment of performing functions described herein is presented in FIG. 8. For example, FIG. 8 shows a flowchart 800 for using parameter-based correlation in joint source channel decoding, according to an exemplary embodiment. LTE architecture 200 of FIG. 2, JSCD block 500 of FIG. 5, and computer 900 of FIG. 9 (described below) may each operate according to flowchart 800, in an embodiment. Other structural and operational embodiments will be apparent to persons skilled in the relevant art(s) based on the discussion regarding flowchart 800. Flowchart 800 is described as follows.
Flowchart 800 may begin with 802. In 802, first data bits received over a channel are monitored. The first data bits may be a portion of data bits in a received frame, or a plurality of received frames, and may be monitored by a PRAB, an ASSA block, a PHSA block, and/or other blocks described in the embodiments described herein. For example, referring again to FIG. 5, first PRAB 506 and/or second PRAB 508 may monitor first data bits from turbo decoder 552. Similarly, referring to FIG. 2, PRAB 264 may monitor first data bits from turbo decoder 214.
In 804, one or more received statistics are generated based on the monitored first data bits. The received statistics may be generated by a PRAB, an ASSA block, a PHSA block, and/or other blocks described in the embodiments described herein. In embodiments, the received statistics may be generated for one or more bits in the monitored first data bits (e.g., the first bit, the second bit, the third bit, etc.). For example, monitored first data bits in a given number of received frames (e.g., the past 100 frames) may be used to determine the number of times a certain bit(s) has been a 1 or a 0. In this example, if a given bit (i.e., a bit at a given position in the first data bits) has been a 1 in 90 of the frames and a 0 in 10 of the frames, the received statistics for a bit value of 1 are 90% and for a bit value of 0 are 10%.
In 806, a conditional probability is generated based exclusively on the one or more received statistics. The conditional probability may represent the likelihood that the next bit monitored is a 1 or a 0 based on the received statistics, and may be generated by a PRAB, an ASSA block, a PHSA block, and/or other blocks described in the embodiments described herein. Continuing from the previous example, the 90% and 10% statistics may be used to generate, in accordance with one or more of the Equations, embodiments, and/or examples described above, the conditional probability as: log




  
    log
    ⁢
    
      
    
    [
    
      0.9
      0.1
    
    ]
  
  .




In 808, the conditional probability is utilized to perform channel decoding of second data bits received over the channel. For example, in the case where a PRAB (e.g., first PRAB 506 and/or second PRAB 508 of FIG. 5) are used to generate the conditional probability, the conditional probability may be provide to a channel decoder (e.g., turbo decoder 552 of FIG. 5) to be utilized in performing channel decoding.
In some example embodiments, one or more of 802, 804, 806, and/or 808 of flowchart 800 may not be performed. Moreover, operations in addition to or in lieu of 802, 804, 806, and/or 808 may be performed. Further, in some example embodiments, one or more of 802, 804, 806, and/or 808 may be performed out of order, in an alternate sequence, or partially (or completely) concurrently with each other.
11. Example Computer Embodiments
Exemplary embodiments, systems, components, subcomponents, devices, methods, flowcharts, and/or the like described herein, including but not limited to, JSCD block 216, turbo decoder 262, PRAB(s) 264, AMR 218, jitter buffer 256, decompression block 252, decryption block 244, cypher stream block 248, reordering and duplication detection block 240, turbo decoder 214, HARQ block 230, demodulator block 226, memory 270, jitter buffer implementation 300, secondary jitter buffer 302, optional JSCD block 304, JSCD block 500 (and any of its subcomponents), flowcharts 400A, 400B, 600, 700, and 800, and/or any further systems, sub-systems, and/or components disclosed herein may be implemented in hardware (e.g., hardware logic/electrical circuitry), or any combination of hardware with software (computer program code configured to be executed in one or more processors or processing devices) and/or firmware. The embodiments described herein, including systems, methods/processes, and/or apparatuses, may be implemented using well known processing devices, telephones (smart phones and/or mobile phones), servers, and/or, computers, such as a computer 900 shown in FIG. 9. It should be noted that computer 900 may represent communication devices, processing devices, and/or traditional computers in one or more embodiments. For example, LTE architecture 200, jitter buffer implementation 300, JSCD block 500, and any of the sub-systems or components respectively contained therein may be implemented using one or more computers 900.
Computer 900 can be any commercially available and well known communication device, processing device, and/or computer capable of performing the functions described herein, such as devices/computers available from International Business Machines®, Apple®, Sun®, HP®, Dell®, Cray®, Samsung®, Nokia®, etc. Computer 900 may be any type of computer, including a desktop computer, a server, etc. Computer 900 includes one or more processors (also called central processing units, or CPUs), such as a processor 906. Processor 906 is connected to a communication infrastructure 902, such as a communication bus. In some embodiments, processor 906 can simultaneously operate multiple computing threads. Computer 900 also includes a primary or main memory 908, such as random access memory (RAM). Main memory 908 has stored therein control logic 924 (computer software), and data. Computer 900 also includes one or more secondary storage devices 910. Secondary storage devices 910 include, for example, a hard disk drive 912 and/or a removable storage device or drive 914, as well as other types of storage devices, such as memory cards and memory sticks. For instance, computer 900 may include an industry standard interface, such a universal serial bus (USB) interface for interfacing with devices such as a memory stick. Removable storage drive 914 represents a floppy disk drive, a magnetic tape drive, a compact disk drive, an optical storage device, tape backup, etc.
Removable storage drive 914 interacts with a removable storage unit 916. Removable storage unit 916 includes a computer useable or readable storage medium 918 having stored therein computer software 926 (control logic) and/or data. Removable storage unit 916 represents a floppy disk, magnetic tape, compact disk, DVD, optical storage disk, or any other computer data storage device. Removable storage drive 914 reads from and/or writes to removable storage unit 916 in a well-known manner. Computer 900 also includes input/output/display devices 904, such as touchscreens, LED and LCD displays, monitors, keyboards, pointing devices, etc. Computer 900 further includes a communication or network interface 918. Communication interface 920 enables computer 900 to communicate with remote devices. For example, communication interface 920 allows computer 900 to communicate over communication networks or mediums 922 (representing a form of a computer useable or readable medium), such as LANs, WANs, the Internet, etc. Network interface 920 may interface with remote sites or networks via wired or wireless connections. Control logic 928 may be transmitted to and from computer 900 via the communication medium 922.
Any apparatus or manufacture comprising a computer useable or readable medium having control logic (software) stored therein is referred to herein as a computer program product or program storage device, including but not limited to, computer 900, main memory 908, secondary storage devices 910, and removable storage unit 916. Such computer program products, having control logic stored therein that, when executed by one or more data processing devices, cause such data processing devices to operate as described herein, represent embodiments of the invention. Devices in which embodiments may be implemented may include storage, such as storage drives, memory devices, and further types of computer-readable media. Examples of such computer-readable storage media include a hard disk, a removable magnetic disk, a removable optical disk, flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROM), and the like. As used herein, the terms “computer program medium” and “computer-readable medium” are used to generally refer to the hard disk associated with a hard disk drive, a removable magnetic disk, a removable optical disk (e.g., CDROMs, DVDs, etc.), zip disks, tapes, magnetic storage devices, MEMS (micro-electromechanical systems) storage, nanotechnology-based storage devices, as well as other media such as flash memory cards, digital video discs, RAM devices, ROM devices, and the like. Such computer-readable storage media may store program modules that include computer program logic to implement, for example, embodiments, systems, components, subcomponents, devices, methods, flowcharts, and/or the like described herein (as noted above), and/or further embodiments described herein. Embodiments of the invention are directed to computer program products comprising such logic (e.g., in the form of program code, instructions, or software) stored on any computer useable medium. Such program code, when executed in one or more processors, causes a device to operate as described herein.
Note that such computer-readable storage media are distinguished from and non-overlapping with communication media (do not include communication media). Communication media typically embodies computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wireless media such as acoustic, RF, infrared and other wireless media. Embodiments are also directed to such communication media.
12. Conclusion
While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail can be made therein without departing from the spirit and scope of the embodiments. Thus, the breadth and scope of the embodiments should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

## Claims

1. A method for performing joint source channel decoding in a communication device, comprising:
receiving a first plurality of soft bits representative of a first parameter included in a frame, each soft bit of the first plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one, the first parameter comprising a plurality of bits in the frame;
generating a second plurality of soft bits representative of the first parameter based on the first plurality of soft bits and at least one conditional probability based at least on a correlation of the first parameter and one or more other parameters included in the first frame and/or one or more parameters included in other frames, each soft bit of the second plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one; and
providing the second plurality of soft bits to a first channel decoder.

2. The method of claim 1, wherein receiving the first plurality of soft bits comprises receiving the first plurality of soft bits from a second channel decoder.

3. The method of claim 1, wherein the first parameter comprises a speech parameter.

4. The method of claim 3, wherein the speech parameter comprises at least one of pitch, pitch gain, fixed codebook gain, or linear spectral pairs.

5. The method of claim 1, wherein the first parameter comprises a packet field parameter.

6. The method of claim 5, wherein the packet field parameter comprises at least a portion of one of a media access control (MAC) header, a radio link control (RLC) header, a packet data convergence protocol (PDCP) header, a robust header compression (RoHC) header, a real-time protocol (RTP) header, or transport block padding.

7. The method of claim 1, wherein the first parameter comprises one of a predefined set of vectors and wherein generating the second plurality of soft bits comprises:
for each bit in the first parameter:
determining a probability associated with each vector in the set of vectors by:
applying a probability density function (PDF) to determine a first probability that the first parameter is equal to the vector given the value of the one or more other parameters included in the first frame and/or the one or more parameters included in the other frames;
multiplying the first probability by a second probability that the first parameter is equal to the vector given the value of the soft bits associated with the other bits in the first parameter; and
normalizing the product of the multiplying step; and

summing the probabilities associated with each vector in the set of vectors for which the bit in the vector is the same value as the bit in the first parameter.

8. The method of claim 7, wherein the PDF is a conditional PDF.

9. The method of claim 1, wherein the at least one conditional probability is further based on one or more conditions of a network over which the frame is received.

10. The method of claim 1, wherein the first channel decoder comprises a turbo decoder.

11. A system, comprising:
a first channel decoder; and
a packet redundancy analyzer configured to:
receive a first plurality of soft bits representative of a first parameter included in a frame, each soft bit of the first plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one, the first parameter comprising a plurality of bits in the frame,
generate a second plurality of soft bits representative of the first parameter based on the first plurality of soft bits and at least one conditional probability based at least on a correlation of the first parameter and one or more other parameters included in the first frame and/or one or more parameters included in other frames, each soft bit of the second plurality of soft bits specifying a probability that a corresponding bit of the first parameter is a zero or a one, and
provide the second plurality of soft bits to the first channel decoder.

12. The system of claim 11, further comprising a second channel decoder, wherein the first plurality of soft bits are received from the second channel decoder.

13. The system of claim 11, wherein the packet redundancy analyzer further comprises at least one of:
a speech block configured to generate the second plurality of soft bits, wherein the first parameter comprises a speech parameter, or
a packet field block configured to generate the second plurality of soft bits, wherein the first parameter comprises a packet field parameter.

14. The system of claim 13, wherein the speech parameter comprises at least one of pitch, pitch gain, fixed codebook gain, or linear spectral pairs, and
wherein the packet field parameter comprises at least a portion of one of a media access control (MAC) header, a radio link control (RLC) header, a packet data convergence protocol (PDCP) header, a robust header compression (RoHC) header, a real-time protocol (RTP) header, or transport block padding.

15. The system of claim 11, wherein the first parameter comprises one of a predefined set of vectors, and
wherein the packet redundancy analyzer is configured to generate the second plurality of soft bits by:
for each bit in the first parameter:
determining a probability associated with each vector in the set of vectors by:
applying a probability density function (PDF) to determine a first probability that the first parameter is equal to the vector given the value of the one or more other parameters included in the first frame and/or the one or more parameters included in the other frames;
multiplying the first probability by a second probability that the first parameter is equal to the vector given the value of the soft bits associated with the other bits in the first parameter; and
normalizing the product of the multiplying step; and

summing the probabilities associated with each vector in the set of vectors for which the bit in the vector is the same value as the bit in the first parameter.

16. The system of claim 15, wherein the PDF is a conditional PDF.

17. The system of claim 15, further comprising a memory configured to store the PDF.

18. The system of claim 11, wherein the at least one conditional probability is further based on one or more conditions of a network over which the frame is received.

19. The system of claim 11, wherein the first channel decoder comprises a turbo decoder.

20. A method for performing joint source channel decoding, comprising:
monitoring first data bits received over a channel;
generating one or more received statistics based on the monitored first data bits;
generating a conditional probability based exclusively on the one or more received statistics; and
utilizing the conditional probability to perform channel decoding of second data bits received over the channel.