Patent Application
20150208082
Not Applicable
The present disclosure relates to encoding used in devices such as video encoders/decoders.
Video encoding has become an important issue for modern video processing devices. Robust encoding algorithms allow video signals to be transmitted with reduced bandwidth and stored in less memory. However, the accuracy of these encoding methods face the scrutiny of users that are becoming accustomed to greater resolution and higher picture quality. Standards have been promulgated for many encoding methods including the H.264 standard that is also referred to as MPEG-4, part 10 or Advanced Video Coding, (AVC). While this standard sets forth many powerful techniques, further improvements are possible to improve the performance and speed of implementation of such methods. The video signal encoded by these encoding methods must be similarly decoded for playback on most video display devices.
Efficient and fast encoding and decoding of video signals is important to the implementation of many video devices, particularly video devices that are destined for home use. Motion estimation can be important to video encoding. A block of reference data may be referenced either directly or indirectly by many subsequent pictures. Accurate motion estimation saves bits in encoding and can also be important for encoding quality, especially at high quantization levels.
In an embodiment of the present disclosure, the received signal 98 is a broadcast video signal, such as a television signal, high definition television signal, enhanced definition television signal or other broadcast video signal that has been transmitted over a wireless medium, either directly or through one or more satellites or other relay stations or through a cable network, optical network or other transmission network. In addition, received signal 98 can be generated from a stored video file, played back from a recording medium such as a magnetic tape, magnetic disk or optical disk, and can include a streaming video signal that is transmitted over a public or private network such as a local area network, wide area network, metropolitan area network or the Internet.
Video signal 110 can include an analog video signal that is formatted in any of a number of video formats including National Television Systems Committee (NTSC), Phase Alternating Line (PAL) or Sequentiel Couleur Avec Memoire (SECAM).
Processed video signal 112 can include a digital video signal complying with a digital video codec standard such as H.264, MPEG-4 Part 10 Advanced Video Coding (AVC) or another digital format such as a Motion Picture Experts Group (MPEG) format (such as MPEG1, MPEG2 or MPEG4), QuickTime format, Real Media format, Windows Media Video (WMV) or Audio Video Interleave (AVI), etc.
Video display devices 104 can include a television, monitor, computer, handheld device or other video display device that creates an optical image stream either directly or indirectly, such as by projection, based on decoding the processed video signal 112 either as a streaming video signal or by playback of a stored digital video file.
The video encoder/decoder 102 includes a processing module 200 that can be implemented using a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, co-processors, a micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on operational instructions that are stored in a memory, such as memory module 202. Memory module 202 may be a single memory device or a plurality of memory devices. Such a memory device can include a hard disk drive or other disk drive, read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that when the processing module implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry.
Processing module 200, and memory module 202 are coupled, via bus 221, to the signal interface 198 and a plurality of other modules, such as motion search module 204, motion refinement module 206, direct mode module 208, intra-prediction module 210, mode decision module 212, reconstruction module 214, entropy coding/reorder module 216, neighbor management module 218, forward transform and quantization module 220, deblocking filter module 222, scene detection module 230 and reference picture prediction module 232. In an embodiment of the present disclosure, the modules of video encoder/decoder 102 can be implemented via an XCODE processing device sold by VIXS Systems, Inc. along with software or firmware. Alternatively, one or more of these modules can be implemented using other hardware, such as another processor or a hardware engine that includes a state machine, analog circuitry, digital circuitry, and/or logic circuitry, and that operates either independently or under the control and/or direction of processing module 200 or one or more of the other modules, depending on the particular implementation. It should also be noted that the software implementations of the present disclosure can be stored on a non-transitory tangible storage medium such as a magnetic or optical disk, read-only memory or random access memory and also be produced as an article of manufacture.
While a particular bus architecture is shown, alternative architectures using direct connectivity between one or more modules and/or additional busses can likewise be implemented in accordance with the present disclosure. Further, while reference picture prediction module 232 and scene detection module 230 are shown separately from motion compensation module 150, the reference picture prediction module 232 and/or scene detection module 230 can each be optionally implemented in conjunction with the motion compensation module 150 as a submodule.
Video encoder/decoder 102 can operate in various modes of operation that include an encoding mode and a decoding mode that is set by the value of a mode selection signal that may be a user defined parameter, user input, register value, memory value or other signal. In addition, in video encoder/decoder 102, the particular standard used by the encoding or decoding mode to encode or decode the input signal can be determined by a standard selection signal that also may be a user defined parameter, user input, register value, memory value or other signal. In an embodiment of the present disclosure, the operation of the encoding mode utilizes a plurality of modules that each perform a specific encoding function. The operation of decoding also utilizes at least one of these plurality of modules to perform a similar function in decoding. In this fashion, modules such as the motion refinement module 206 and more particularly an interpolation filter used therein, and intra-prediction module 210, can be used in both the encoding and decoding process to save on architectural real estate when video encoder/decoder 102 is implemented on an integrated circuit or to achieve other efficiencies. In addition, some or all of the components of the direct mode module 208, mode decision module 212, reconstruction module 214, transformation and quantization module 220, deblocking filter module 222 or other function specific modules can be used in both the encoding and decoding process for similar purposes.
Motion compensation module 150 includes a motion search module 204 that processes pictures from the video signal 110 based on a segmentation into blocks or macroblocks of pixel values, such as of 64 pixels by 64 pixels, 32 pixels by 32 pixels, 16 pixels by 16 pixels or some other size, from the columns and rows of a frame and/or field of the video signal 110. In an embodiment of the present disclosure, the motion search module determines, for each block, macroblock or macroblock pair of a field and/or frame of the video signal, one or more motion vectors that represents the displacement of the block, macroblock (or subblock) from a reference frame or reference field of the video signal to a current frame or field. In operation, the motion search module 204 operates within a search range to locate a block, macroblock (or subblock) in the current frame or field to an integer pixel level accuracy such as to a resolution of 1-pixel. Candidate locations are evaluated based on a cost formulation to determine the location and corresponding motion vector that have a most favorable (such as lowest) cost.
While motion search module 204 has been described above in conjunction with full resolution search, motion search module 204 can operate to determine candidate motion search motion vectors partly based on scaled or reduced resolution pictures. In particular, motion search module 204 can operate by downscaling incoming pictures and reference pictures to generate a plurality of downscaled pictures. The motion search module 204 then generates a plurality of motion vector candidates at a downscaled resolution, based on the downscaled pictures. The motion search module 204 operates on full-scale pictures to generate motion search motion vectors at full resolution, based on the motion vector candidates. In another embodiment, the motion search module 204 can generate motion search motion vectors for later refinement by motion refinement module 206, based entirely on pictures at downscaled resolution.
A motion refinement module 206 generates a refined motion vector for each macroblock of the plurality of macroblocks, based on the motion search motion vector. In an embodiment of the present disclosure, the motion refinement module determines, for each macroblock or macroblock pair of a field and/or frame of the video signal 110, a refined motion vector that represents the displacement of the macroblock from a reference frame or reference field of the video signal to a current frame or field.
Based on the pixels and interpolated pixels, the motion refinement module 206 refines the location of the macroblock in the current frame or field to a greater pixel level accuracy such as to a resolution of ¼-pixel or other sub-pixel resolution. Candidate locations are also evaluated based on a cost formulation to determine the location and refined motion vector that have a most favorable (such as lowest) cost. As in the case with the motion search module 204, a cost formulation can be based on the Sum of Absolute Difference (SAD) between the reference macroblock and candidate macroblock pixel values and a weighted rate term that represents the number of bits required to be spent on coding the difference between the candidate motion vector and either a predicted motion vector (PMV) that is based on the neighboring macroblock to the right of the current macroblock and on motion vectors from neighboring current macroblocks of a prior row of the video signal or an estimated predicted motion vector that is determined based on motion vectors from neighboring current macroblocks of a prior row of the video signal. In an embodiment of the present disclosure, the cost calculation avoids the use of neighboring subblocks within the current macroblock. In this fashion, motion refinement module 206 is able to operate on a macroblock to contemporaneously determine the motion search motion vector for each subblock of the macroblock.
When estimated predicted motion vectors are used, the cost formulation avoids the use of motion vectors from the current row and both the motion search module 204 and the motion refinement module 206 can operate in parallel on an entire row of video signal 110, to contemporaneously determine the refined motion vector for each macroblock in the row.
A direct mode module 208 generates a direct mode motion vector for each macroblock, based on macroblocks that neighbor the macroblock. In an embodiment of the present disclosure, the direct mode module 208 operates to determine the direct mode motion vector and the cost associated with the direct mode motion vector based on the cost for candidate direct mode motion vectors for the B slices of video signal 110, such as in a fashion defined by the H.264 standard.
While the prior modules have focused on inter-prediction of the motion vector, intra-prediction module 210 generates a best intra prediction mode for each macroblock of the plurality of macroblocks. In an embodiment of the present disclosure, intra-prediction module 210 operates as defined by the H.264 standard, however, other intra-prediction techniques can likewise be employed. In particular, intra-prediction module 210 operates to evaluate a plurality of intra prediction modes such as an Intra-4×4 or Intra-16×16, which are luma prediction modes, chroma prediction (8×8) or other intra coding, based on motion vectors determined from neighboring macroblocks to determine the best intra prediction mode and the associated cost.
A mode decision module 212 determines a final macroblock cost for each macroblock of the plurality of macroblocks based on costs associated with the refined motion vector, the direct mode motion vector, and the best intra prediction mode, and in particular, the method that yields the most favorable (lowest) cost, or an otherwise acceptable cost. A reconstruction module 214 completes the motion compensation by generating residual luma and/or chroma pixel values for each macroblock of the plurality of macroblocks.
A forward transform and quantization module 220 of video encoder/decoder 102 generates processed video signal 112 by transforming coding and quantizing the residual pixel values into quantized transformed coefficients that can be further coded, such as by entropy coding in entropy coding module 216, filtered by de-blocking filter module 222. In an embodiment of the present disclosure, further formatting and/or buffering can optionally be performed by signal interface 198 and the processed video signal 112 can be represented as being output therefrom.
In an embodiment, coding parameters, such as a quantization parameter QP that indicates the fineness or coarseness of quantization applied to blocks of picture data, or other quantization or coding parameters are adaptive based on block prediction data that indicates how often a block is referenced by later pictures. Finer quantization, more coding bits and/or other parameters that indicate higher fidelity coding, can be applied to blocks that are referenced more times, or more often, than other blocks in a reference picture. This can improve the overall coding efficiency, accuracy and improve picture quality. The reference picture prediction module 232 operates to generate the block prediction data to be used for such adaptive encoding.
Further details regarding the operation of reference picture prediction module 232 including several optional functions and features are described in conjunction with
As discussed above, many of the modules of motion compensation module 150 operate based on motion vectors determined for neighboring macroblocks. Neighbor management module 218 generates and stores neighbor data for at least one macroblock of the plurality of macroblocks for retrieval by at least one of the motion search module 204, the motion refinement module 206, the direct mode module 208, intra-prediction module 210, entropy coding module 216 and deblocking filter module 222, when operating on at least one neighboring macroblock of the plurality of macroblocks. In an embodiment of the present disclosure, a data structure, such as a linked list, array or one or more registers are used to associate and store neighbor data for each macroblock in a buffer, cache, shared memory or other memory structure. Neighbor data includes motion vectors, reference indices, quantization parameters, coded-block patterns, macroblock types, intra/inter prediction module types neighboring pixel values and or other data from neighboring macroblocks and/or subblocks used by one or more of the modules or procedures of the present disclosure to calculate results for a current macroblock. For example, in order to determine the predicted motion vector for the motion search module 204 and motion refinement module 206, both the motion vectors and reference index of neighbors are required. In addition to this data, the direct mode module 208 requires the motion vectors of the co-located macroblock of previous reference pictures. The deblocking filter module 222 operates according to a set of filtering strengths determined by using the neighbors' motion vectors, quantization parameters, reference index, and coded-block-patterns, etc. For entropy coding in entropy coding module 216, the motion vector differences (MVD), macroblock types, quantization parameter delta, inter predication type, etc. are required.
Consider the example where a particular macroblock MB(x,y) requires neighbor data from macroblocks MB(x−1, y−1), MB(x, y−1), MB (x+1,y−1) and MB(x−1,y). In prior art codecs, the preparation of the neighbor data needs to calculate the location of the relevant neighbor sub-blocks. However, the calculation is not as straightforward as it was in conventional video coding standards. For example, in H.264 coding, the support of multiple partition types make the size and shape for the subblocks vary significantly. Furthermore, the support of the macroblock adaptive frame and field (MBAFF) coding allows the macroblocks to be either in frame or in field mode. For each mode, one neighbor derivation method is defined in H.264. So the calculation needs to consider each mode accordingly. In addition, in order to get all of the neighbor data required, the derivation needs to be invoked four times since there are four neighbors involved—MB(x−1, y−1), MB(x, y−1), MB(x+1, y−1), and MB(x−1, y). So the encoding of the current macroblock MB(x, y) cannot start not until the location of the four neighbors has been determined and their data have been fetched from memory.
In an embodiment of the present disclosure, when each macroblock is processed and final motion vectors and encoded data are determined, neighbor data is stored in data structures for each neighboring macroblock that will need this data. Since the neighbor data is prepared in advance, the current macroblock MB(x,y) can start right away when it is ready to be processed. The burden of pinpointing neighbors is virtually re-allocated to its preceding macroblocks. The encoding of macroblocks can therefore be more streamlined and faster. In other words, when the final motion vectors are determined for MB(x−1,y−1), neighbor data is stored for each neighboring macroblock that is yet to be processed, including MB(x,y) and also other neighboring macroblocks such as MB(x, y−1), MB(x−2,y) MB(x−1,y). Similarly, when the final motion vectors are determined for MB(x,y−1), MB (x+1,y−1) and MB(x−1,y) neighbor data is stored for each neighboring macroblock corresponding to each of these macroblocks that are yet to be processed, including MB(x,y). In this fashion, when MB(x,y) is ready to be processed, the neighbor data is already stored in a data structure that corresponds to this macroblock for fast retrieval.
The motion compensation can then proceed using the retrieved data. In particular, the motion search module 204 and/or the motion refinement module 206, can generate at least one predicted motion vector (such as a standard PMV or estimated predicted motion vector) for each macroblock of the plurality of macroblocks using retrieved neighbor data. Further, the direct mode module 208 can generate at least one direct mode motion vector for each macroblock of the plurality of macroblocks using retrieved neighbor data and the intra-prediction module 210 can generate the best intra prediction mode for each macroblock of the plurality of macroblocks using retrieved neighbor data, and the coding module 216 can use retrieved neighbor data in entropy coding, each as set forth in the HEVC standard, H.264 standard, the MPEG-4 standard, VC-1 (SMPTE standard 421M) or by other standard or other means.
Scene detection module 230 detects scene changes in the video signal 110 based, for example on motion detection in the video signal 110. In an embodiment of the present disclosure, scene detection module 230 generates a motion identification signal for each picture of video signal 110. The motion in each picture, such as a video field (or frame if it is progressive-scan video source), can be represented by a parameter called Global Motion (GM). The value of GM quantifies the change of the field compared to the previous same-parity field. In terms of each macroblock pair, the top field is compared to the top field, bottom field compared to bottom field, etc. The value of GM can be computed as the sum of Pixel Motion (PM) over all pixels in the field or frame, where the value of PM is calculated for each pixel in the field or frame.
The parameter GM can be used to detect a scene change in the video signal 110. When scene happens on a field, the field will generate considerably higher GM value compared to “normal” fields. A scene change can be detected by analyzing the GM pattern along consecutive fields, for example by detecting an increase or decrease in GM in consecutive fields that exceeds a scene detection threshold. Once a scene change is detected that corresponds to a particular image, encoding parameters of encoder/decoder 102 can be adjusted to achieve better results. For example, the detection of a scene change can be used to trigger the start of a new group of pictures (GOP). In another example, the encoder/decoder 102 responds to a scene change detection by further adjusting the values of QP to compensate for the scene change, by enabling or disabling video filters or by adjusting or adapting other parameters of the encoding, decoding, transcoding or other processing by encoder/decoder 102.
While not expressly shown, video encoder/decoder 102 can include a memory cache, shared memory, a memory management module, a comb filter or other video filter, and/or other module to support the encoding of video signal 110 into processed video signal 112. Further details of general encoding and decoding processes will be described in greater detail in conjunction with
Reconstruction module 214 generates residual pixel values corresponding to the final motion vector for each macroblock of the plurality of macroblocks by subtraction from the pixel values of the current frame/field 260 by difference circuit 282 and generates unfiltered reconstructed frames/fields by re-adding residual pixel values (processed through transform and quantization module 220) using adding circuit 284. The transform and quantization module 220 transforms and quantizes the residual pixel values in transform module 270 and quantization module 272 and re-forms residual pixel values by inverse transforming and dequantization in inverse transform module 276 and dequantization module 274. In addition, the quantized and transformed residual pixel values are reordered by reordering module 278 and entropy encoded by entropy encoding module 280 of entropy coding/reordering module 216 to form network abstraction layer output 281.
Deblocking filter module 222 forms the current reconstructed frames/fields 264 from the unfiltered reconstructed frames/fields. It should also be noted that current reconstructed frames/fields 264 can be buffered to generate reference frames/fields 262 for future current frames/fields 260.
As discussed in conjunction with
In an embodiment, reference picture prediction module 232 operates, before a picture is actually coded, to only perform motion search and inter prediction on the following M pictures (with M less than K) and use the results to predict the motion and reference behavior of N further future pictures. This way, how often each block of a picture is to be referenced by later pictures can be determined with only a limited encoding delay (of M pictures). The value of M can be as small as 1, however, predictions can be applied to N additional pictures to estimate the number of future pictures that will reference the block.
In general terms, the reference picture prediction module 232 operates to determine how a block Ba is referenced by later pictures. Using Ra to represent this value,
Ra=f1(P1,P2, . . . ,PM)+f2(P1,P2, . . . ,PN)
Where P1, P2, . . . , PM represent the following M pictures in the sequence of pictures after a reference picture; f1 represents the reference behavior of Block Ba by pictures P1, P2, . . . , PM, determined, for example, by performing some form of motion search and inter prediction on pictures P1, P2, . . . , PM; f2 represents the reference behavior of Block Ba by a further N future pictures beyond Picture PM, determined, for example, by extrapolating using the results for Picture P1, P2, . . . , PM. The sign “+” means some kind of combination of f1 and f2, not necessarily means simple addition operation.
In an example of operation, the reference picture prediction module 232 receives reference pictures such as reference frames/fields 262 and other picture data in the sequence of pictures such as current frame/field data 260. The reference picture prediction module 232 is configured to process block motion data for M pictures subsequent to the reference picture in the sequence of pictures to generate a calculated block motion trajectory data corresponding to motion of a block from the reference picture through the M pictures. The reference picture prediction module 232 then generates extrapolated block motion trajectory data corresponding to a prediction through an additional N pictures of sequence of pictures that are subsequent to the M pictures in the sequence of pictures, based on the calculated block motion trajectory. The reference picture prediction module 232 generates the block prediction data 255 that estimates a number pictures after the reference picture that will reference the block, based on the extrapolated block motion trajectory data.
In the embodiment shown, the transform and quantization module 220, selects a quantization parameter based on the block prediction data 255. The transform and quantization module 220 proceeds to transform and quantize residual pixel values based on the motion vector data from the mode decision module 212 for each block based on the quantization parameter, as part of an encoding of the sequence of pictures.
In this fashion, the transform and quantization module 220 adapts a quantization parameter QP that indicates the fineness or coarseness of quantization applied to blocks of picture data based on block prediction data that indicates how often a block is referenced by later pictures. Finer quantization, and more coding bits can be applied to blocks that are referenced more often than other blocks in a reference picture. While the forgoing has focused on adaptation of a quantization parameter QP, other quantization and transform parameters, other coding parameters and/or other parameters that indicate higher fidelity coding can be applied to blocks that are referenced more often than other blocks in a reference picture. In particular, mode decision parameters, the selection of a rate distortion optimization parameter such as is a Lagrange multiplier λ, differing cost calculations, decision threshold values and/or other parameters can be adapted based on the block prediction data. This can improve the overall coding efficiency, accuracy and improve picture quality.
As discussed in conjunction with
While the reuse of modules, such as particular function specific hardware engines, has been described in conjunction with the specific encoding and decoding operations of
The function f2 can be determined based on the extrapolated block motion trajectory in the horizontal and vertical dimensions and the current position (Curr_x, Curr_y) of the block 326 with reference to the horizontal and vertical boundaries of the picture.
Considering further the examples shown in
While described above in conjunction with the example where M=1, larger values of M can be employed. In an embodiment, the extrapolated block motion trajectory used to determine f2 can be generated based on only the result of the last picture PM. Considering that a Block Ba is directly or indirectly referenced by a block (with pixel position (Curr_x, Curr_y)) on Picture PM and the motion vector being (MVx, MVy) into a reference picture. The reference picture can simply be the picture PM−1 immediately before Picture PM, but it can be any picture from P1 through PM−1. Consider the temporal distance between the reference picture and PM as DM.
In this way, the extrapolated block motion trajectory 334 and function f2 can be generated from uniform motion acceleration and/or nonlinear motion in the further future pictures, predicted using differences between two different velocities by curve fitting of the motion or via other estimation techniques. In general, the extrapolated block motion trajectory 334 and function f2 could be estimated using motion vectors of any combinations of P1, P2, . . . , Pm, either linearly or non-linearly.
In an embodiment, the block prediction data is generated based on a comparison of the extrapolated block motion trajectory data to at least one picture boundary. The at least one picture boundary includes at least one horizontal picture boundary and/or at least one vertical picture boundary.
In an embodiment, M=1 and the calculated block motion trajectory can be a linear trajectory. In the alternative, M can be greater than 1 and the calculated block motion trajectory can be a nonlinear trajectory. The method can further include generating the motion vector data for M+N pictures subsequent to the reference picture in the sequence of pictures, after generating the block prediction data for the M+N pictures. The calculated block motion trajectory can includes a block motion velocity and/or a block motion acceleration.
As previously discussed, while the forgoing has focused on adaptation of a quantization parameter, other coding parameters and/or other parameters that indicate higher fidelity coding can be applied to blocks that are referenced more often than other blocks in a reference picture.
The transmission path 122 can include a wireless path that operates in accordance with a wireless local area network protocol such as an 802.11 protocol, a WIMAX protocol, a Bluetooth protocol, etc. Further, the transmission path can include a wired path that operates in accordance with a wired protocol such as a Universal Serial Bus protocol, an Ethernet protocol or other high speed protocol.
As may be used herein, the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences. As may also be used herein, the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As may further be used herein, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two items in the same manner as “coupled to”. As may even further be used herein, the term “configured to”, “operable to”, “coupled to”, or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items. As may still further be used herein, the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item.
As may be used herein, the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1.
As may also be used herein, the terms “processing module”, “processing circuit”, “processor”, and/or “processing unit” may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions. The processing module, module, processing circuit, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, and/or processing unit. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that if the processing module, module, processing circuit, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry. Still further note that, the memory element may store, and the processing module, module, processing circuit, and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures. Such a memory device or memory element can be included in an article of manufacture.
One or more embodiments have been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claims. Further, the boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality. To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claims. One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.
The one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples. A physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein. Further, from figure to figure, the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.
Unless specifically stated to the contra, signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential. For instance, if a signal path is shown as a single-ended path, it also represents a differential signal path. Similarly, if a signal path is shown as a differential path, it also represents a single-ended signal path. While one or more particular architectures are described herein, other architectures can likewise be implemented that use one or more data buses not expressly shown, direct connectivity between elements, and/or indirect coupling between other elements as recognized by one of average skill in the art.
The term “module” is used in the description of one or more of the embodiments. A module includes a processing module, a processor, a functional block, hardware, and/or memory that stores operational instructions for performing one or more functions as may be described herein. Note that, if the module is implemented via hardware, the hardware may operate independently and/or in conjunction with software and/or firmware. As also used herein, a module may contain one or more sub-modules, each of which may be one or more modules.
While particular combinations of various functions and features of the one or more embodiments have been expressly described herein, other combinations of these features and functions are likewise possible. The present disclosure is not limited by the particular examples disclosed herein and expressly incorporates these other combinations.
