text:
The encoding/decoding digital data of audio/video signals and devices for their implementation
H04N7/64 - Systems for detection or correction of transmission errors (coding, decoding or code conversion for error detection or error correction in general H03M0013000000)
H03M13 - Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes (error detection or error correction for analogue/digital, digital/analogue or code conversion H03M0001000000-H03M0011000000; specially adapted for digital computers G06F0011080000, for information storage based on relative movement between record carrier and transducer G11B, e.g. G11B0020180000, for static stores G11C)
The invention relates to encoding and decoding digital data divided into blocks of digits, in order of importance digits. The technical result is more accurate data recovery. The encoding method includes the representation of the corresponding digital data to the same specified number of digits and coding digital data represented by the same number, using the specified encoding from the most senior digital sequences to the most Junior digital sequences. Method for decoding digital data coded in order of importance, by assessing the significance of the digits of the digital data includes an analysis of the relevance of the encoded digital data and decoding the analyzed digital data from senior figures to the younger digits using the specified method of decoding. Even if the bit streams are lost or distorted, due to the fact that the first encoded important information, deterioration of sound quality can be reduced. 14 C. and 25 C.p. f-crystals, 10 ill., table 2.
The technical field to which the invention relates
The invention relates to the encoding and decterov the simulation/decoding digital data, divided into blocks of digits, in order of importance digits.
Description of the prior art
Typically, the signal containing the information is essentially a continuous analog signal. For representation of a signal in the form of a digital signal to an analog-to-digital (A/D) conversion.
To perform A/D conversion requires two procedures: sampling procedure for converting a continuous time signal into a discrete signal and the quantization procedure to limit the number of possible amplitudes up to a limited value, that is, to convert the input amplitude x(n) in the element y(n), belonging to a finite set of possible amplitudes at time n.
Because of the quantized signal is simply encoded using pulse-code modulation (PCM), which does not require additional processing, the quantized data is very convenient to use. However, from the point of view of the data module required for storing or transmitting, this simple way of coding is not optimal, even if the input samples are statistically independent. In addition, if the input samples are statistically independent from each other, the encoding method samples the emer statistical coding or specific type of adaptive quantization. Therefore, the coding procedure becomes much more complicated compared to the simple way of storing PCM data.
The bit stream includes the quantized data and the additional information to compress the signals. However, this information forms the bit streams by encoding the quantized data in the block of samples in the data sequence without regard to significance. If the bit streams just remembered, and then restored without any errors, then these bit streams can be generated regardless of the value.
If the bit streams are transmitted via the communication network, the separate parts of the bit streams can be lost depending on the status of the network connection. Also, if during the transmission of bit streams generated error information bit streams, formed after the error is recovered as incorrect information due to a propagating error. If the number of transmitted bit streams as the correct information is reversed only a separate part of the bit streams, the bit streams recovered in the form of correct information, recover more meaningful signals compared to unrestored streams of bits, resulting in p is the set of fixed bit rate, searched optimum condition for a given transmission speed in bits, and then to perform the quantization and encoding, resulting in the formation of the bit streams in accordance with the bit rate. The known method of encoding are formed bit streams having a size suitable for a given transmission rate, without regard to the order of bit streams.
Indeed, if the resulting bit streams are transmitted over a communication network, these bit streams are divided into several segments for transmission. If the transmission channel, there is an overload, or only part of the segments and not all the segments sent from the transmitting end, are at the receiving end due to the narrow band transmission channel, the data cannot be correctly restored. Also, if you are recovering only some of the data streams, the quality is significantly degraded. In the case of digital audio data is reproduced sound unpleasant to the ear. In the case of digital video image that is restored on the screen is greatly distorted.
To resolve the above problems, the aim of the invention is to provide a method for encoding/decoding digital data is the first data recovery data close to the original data, by minimizing the deterioration of some of the data streams.
To achieve this goal, we propose a method of encoding a given quantity of digital data, containing the following steps: (a) representation of the corresponding digital data by the specified number of digits and (b) encoding the digital data represented by the same number of digits from the sequence of the most senior figures of the sequence to sequences youngest digits.
Step (a) is the representation of digital data in the form of binary data having the same number of bits, and the step (b) is the encoding represented in binary form data sequences from the most high bits (MSB-bit) to sequence the most significant bit (LSB bit).
Step encoding is done by combining the bits forming the bit sequence into blocks with a specified number of bits.
According to another aspect of the invention proposes a method of coding a specified number of digital data formed from the data of the sign and level data, containing the following steps: (a) representation of the respective digital data of the same is senior figures-level data, forming represent digital data; (C) coding the data of the character corresponding to the nonzero data from among coded the most senior digital sequences; (d) coding the most senior digital sequences from a number of unencrypted data level digital data; (e) encoding unencrypted data character from among the data of the character corresponding to non-zero data level, from among the digital sequences encoded in step (d); and (f) performing steps (d) and (e) for the respective digits of the digital data.
Step (a) is the representation of digital data in the form of binary data having the same number of bits, and the numbers in steps (b) to (f) are the bits.
The encoding steps (b) through (f) are performed by combining the bits forming the corresponding bit sequence for the data level and the data mark in the blocks with the specified number of bits.
To achieve this goal a device of the coding sequence of a specified number of digital data, comprising: a separation unit bits to represent the corresponding digital data binary data formed from the same specified number of bill divided bit, coming from the separation unit bit, and the subsequent collection and coding bits and the block sealing bits to generate bit streams in order of importance encoded data out of the unit of encoding.
If the digital data formed from the data of the sign and level data, the coding block collects and encodes the data bits having the same significance level from among divided into data bits, encodes a noncoding data character from among the data of the character corresponding to non-zero data level, and the data coding module and the data of the mark is performed sequentially from the MSB bits to lower bits.
When the coding block collects and encodes the bits according to significance, the coding is performed by combining the bits in the block with the specified number of bits.
Also proposes a method of decoding digital data coded in order of importance, by assessing the significance of the digits of the digital data containing the following steps: analysis of the significance of the encoded digital data and decoding the analyzed digital data using a predetermined encoding method from senior figures to the younger digits.
These figures are bits. the x bits to lower bits in the block vectors and recovery is divided into data bits from the data decoded in a block of vectors.
In addition, to achieve the above objective, it is suggested a method of decoding digital data coded in order of importance, by assessing the significance of the digits of the digital data containing the following steps: (a) analysis of the significance of the encoded digital data; (b) decoding the data level of the analyzed digital data in the form specified method of decoding from senior figures to the younger digits and (C) decoding the data of the sign of the analyzed digital data for combining the decoded data of the mark with the decoded data.
These figures are bits. Step (b) includes the steps of: decoding lossless analyzed digital data from bits to lower bits in the block vectors and recovery is divided into data bits from the data decoded in the block vectors.
Also a device decoding digital data coded in order of importance, by assessing the significance of bits of digital data that contains the unit of analysis of the bit stream for analyzing the significance of bits of the bit stream of encoded digital data; a block decoder for decoding the analyzed digital data from senior figures to mladih data the output from the block decode and recover digital data corresponding samples.
The block decoding block contains the decoded level data for decoding the data level of the analyzed digital data using the specified method of decoding from senior figures to the low numbers and the block data is decoded symbol to decode the sign of the analyzed digital data and combining the decoded data of the mark with the decoded data of the module.
The block decoding decodes lossless analyzed digital data in a block of vectors from bits to lower bits and restores divided into bits of data.
According to another aspect of the invention proposes a device for encoding the audio signal containing the display unit time/frequency to convert the input audio signal time domain into a signal of a frequency domain; block quantization to the quantization signal frequency domain for each frequency band; a separation unit bit to separate chantavanich data block bits; block coding for collecting and coding the MSB bit of the number is divided into data bits output from the separation unit bit, and the subsequent collection and to the significance of the bits of the coded data and additional information for the coded data.
The block generating bit streams to generate streams of bits sequentially from low frequency to high frequency.
Also features a method of coding an audio signal, containing the following steps: dividing the audio data quantized for each given frequency band, in units of bits; collection and coding MSB bit of the number is divided into data bits and the subsequent collection and coding bits sequentially from bits and generating bit streams in order of significance bits of the coded data and additional information for the coded data.
The bit streams are generated sequentially from low frequency to high frequency and high bits to lower bits.
In addition, a device decoding bit streams of encoded audio data containing the block of data flow analysis for analyzing the significance of bits forming the data streams; a block decoder for decoding the additional information having at least quantization bits and the step size of quantization and the quantized data from bits to lower bits according to significance analyzed by the analysis block of the bit stream; block of the inverse quantization to restore the decoded step size is obrazovaniya signals, past the inverse quantization signals in the time domain.
According to another aspect of the invention proposes a method of decoding audio data, containing the following steps: analyzing the significance of bits forming the bit streams and decoding the additional information having at least quantization bits and the step size of quantization and the quantized data from bits to lower bits; restore decoded step size of quantization and quantized data into signals having the original levels; and converting the signals passed inverse quantization signals in the time domain.
As a variant, it is proposed a device for encoding video data containing block DCT (discrete cosine transform) for the DCT transform of the input video signal; a block of quantization to quantize the data of the past DCT; block seal bit to separate the additional information and the quantized values into blocks of bits in accordance with the importance of the quantized data and generating bit streams.
Also according to another aspect of the invention proposes a method of coding a video signal, containing the following steps: quantization of the input video signal prettii with the importance of the quantized data and the coding is divided into data bits in order of importance and generating bit streams.
Also according to the invention proposes a device for decoding a video signal for decoding bit streams of encoded video data containing a block of data flow analysis for analyzing the significance of bits forming the bit streams; a block decoder for decoding the additional information having at least quantization bits and the step size of quantization and the quantized data from bits to lower bits according to significance, the analyzing unit to analyze the flows of bits; block of the inverse quantization to restore the decoded step size of quantization and quantized data into signals having the original levels; and block IDCT (inverse discrete cosine transform) to perform the inverse DCT signals passed inverse quantization.
The coding block performs encoding sequentially from low frequency to high frequency.
Method of decoding a video signal for decoding bit streams of encoded video data includes the following steps: analyzing the significance of bits forming the bit streams and decoding the additional information having at least quantization bits and the step size of quantization and the quantized data from starsi the crystals, with the original levels; and performing inverse DCT signals passed inverse quantization.
Brief description of drawings
The above-mentioned objectives and advantages of the invention will become more apparent from the subsequent detailed description of the preferred variant of its embodiment with reference to the drawings, in which:
Fig. 1 is a block diagram of the digital encoding according to the invention;
Fig.2 is a conceptual diagram showing a known procedure digital encoding;
Fig.3 is a conceptual diagram showing the procedure of the digital encoding according to the invention;
Fig.4 is a block diagram of a decoding device according to the invention;
Fig.5 is a block diagram of the device audio encoding according to the invention;
Fig. 6 is a detailed block diagram of block seal bit shown in Fig. 5;
Fig.7 is a block diagram of a decoding device of the sound according to the invention;
Fig. 8 is a block diagram of the encoder of the video signal according to the invention;
Fig.9 shows the procedure for processing the video signal in a device for encoding video and
Fig.10 is a block diagram of a device for decoding a video signal according to the invention.
Description prepac described preferred embodiments of the invention.
First will be described the General concept of the encoder. The input digital signal is generated in the form of bit streams through the encoding device shown in Fig.1. First, for the formation of bit streams are encoded high-order bits. In other words, the priority encoding components of the data to be encoded is determined by the relative importance of the components. Components with a higher priority have precedence over the components with a lower priority. Since the first encoded important information, if the number used to date a bit more or equal to the tolerance on the generation of bits, the encoding at this point, stops, and generating bit streams is completed. If the generation of the bit streams ends in the middle of the encoding process, the data in the process of their recovery in the decoder partially lost, so that the original digital data is distorted. However, since the first encoded more important information, even if the flow bit in the middle of the encoding process is not formed, the entire encoding process can be supported in the same manner as in the known method.
In Fig. 2 shows a known method of coding. According to what should be used only part of the head streams of bits from among all the threads a bit, the information is less important than that which is included in the unused rear threads a bit, largely contained in the head threads.
For this reason, in the invention of the digital data is divided into blocks of bits, as shown in Fig.3. Usually the significance of the 1st MSB (the high bit) is much higher than the significance of 1 LSB (the least significant bit). Thus, since the high-order bits of quantization are considered more important, the coding is performed from the MSB to the LSB.
In Fig.1 shows a block diagram of the encoder of the digital data according to the invention, which includes a separation unit bit 100, the coding block 110 and block seal bit 120. Here, the digital data is formed from the binary data and presented the same number of bits. Digital data that is represented by the same number of bits, is converted so that they were presented the same number of bits. Although in this embodiment, the digital data is limited to binary data, the data can be decimal, hexadecimal, and other, non-binary data. In this case, the digital data is represented by blocks of digits (not bits).
The separation unit bits 100 parts posledovatelya digital data is such, to sign all the data was positive. When the data is taken from the absolute value represented by binary data, as shown in Fig.3, the values corresponding to the respective bits are separated selectively in accordance with the position of corresponding bits, and the data corresponding to the respective bits are going to generate new sequences. For example, if the input digital data are -31, 12, -9, 7, 17, -23, ..., the absolute value of each data is such to receive digital data in the form of 31, 12, 9, 7, 17, 23, ... their subsequent representation in binary 11111, 01100, 01001, 00111, 10111 10001 and respectively.
From among the values represented by binary data is the information for the relevant bits for subsequent consistent data collection, resulting in generating new sequence. First, data are collected for the respective MSB-bits, that is, 1,0,0... for 31,12,9... respectively. Therefore, divided into bits of data corresponding to the respective MSB bits are 1,1,1,0,0,0,.... After this can be obtained sequences corresponding to the respective bits. And finally, posledovatelnostyakh on bits of binary data, the output of the separation unit bit 100, and encodes them. Following this, the coding block 110 collects bits from bits and encodes them. Bits having the highest importance, preferred are the corresponding MSB-bits of the corresponding digital data represented by binary data, and the bits having the lowest value, preferably represent the corresponding LSB bits. The coding is performed using the algorithm of lossless encoding, suitable for storing or transmitting data.
Usually for more efficient data compression data to the MSB bits are collected consistently and few data are combined, forming the vector. MSB bits are formed by the vectors, and these vectors are encoded using the encoding is lossless. Method of lossless encoding can be an arithmetic coding or Huffman coding. Then gather the following most significant bits for subsequent encoding, which represents the coding method is divided into data bits.
If the digital data formed from the data of the sign and level data, the coding block 110 collects every level data for the MSB bit of the data taken from the separation unit bi is x level data. This procedure is performed from the top down to the LSB only Nemirovskii data character to be coded.
In the invention, as are the absolute values for the respective sample values, information for the value of the sign (positive or negative) must be encoded first or later. In this case, the encoding of the sign of the first leads to the fact that the first coding is performed without any information. Because the values quantieme from the MSB to the first high order bit equal to 1 are considered to be zero, the value of the mark have no meaning. In other words, if the quantized value represented by 5 bits 00011 and uses only 3 bits, the quantized value is restored as 00000. Therefore, even if this value is the sign bit, the information is useless. However, if you are using 4 bits 5, the quantized value is 00010. Thus, the value of the sign will have much more sense as a value of 1, which comes first in the leftmost two bits means that the quantized value is decoded to a value other than zero.
When the representation of the corresponding frequency components from the respective MSB-bits if the first Priceline whether the value of the sign or negative.
For example, when encoding MSB first encoded 1010, and then determines whether to encode the sign bit. At the same time, since the first encoded non-zero value in the first and third frequency components, bits of character for these two components are encoded sequentially, and then to encode 0000.
Block seal bit 120 generates bit streams having a desired size, the encoding order of the data coded by the coding block 110, depending on the importance. First, in the form of bit streams generated coded data is divided into data bits to the MSB bit, and then in the manner described above and encoded information for the sign to be added to the streams of bits, which are generated bit streams in General.
The bit streams generated by the encoding procedure, is restored to the original digital data by decoding procedure, as shown in Fig.2. So as to obtain the bit streams in the invention of the first encoded data with greater significance, the decoder interprets the bit streams in order of importance, i.e. in the order of generation, to perform decoding.
In Fig. 4 shows a block diagram of the device 400, the block decoding lossless 410 and block associations bit 420.
The unit of analysis flows bits 400 analyzes the coded data of the number of input bit streams depending on the importance. The bit streams are generated from the data encoded in the encoding device, depending on the value of the data. Thus, in the device decoding the bit streams are analyzed sequentially from the head of the bit stream depending on importance. First of bit streams analyzed the coded data is divided into data bits to the MSB bit, and then in the manner described above and analyzed information for the sign. Analyzed the coded data is transferred to the block decode lossless 410 and block associations bit 420 is passed information about the token for later use in restoring the original signal.
The block decoding lossless 410 decodes divided into bits signals from among the signals output from the block analysis of streams of bits 400, from bits to lower bits. Divided into bits of data can be restored from the encoded data by a reverse procedure of the algorithm, adapted to the encoding device to encode divided into sledovatelno, and few data are combined to form vectors. Then these vectors are encoded using the encoding is lossless. Thus, these vectors are decoded from coded data, and is divided into data bits for the respective samples are recovered from the decoded vectors.
Block associations bit 420 restores the bit information of the respective samples sequentially from MSB to LSB of the split on the bits of the binary data that is restored at block decoding lossless 410, and outputs the original digital data. Values corresponding to positions of the respective bits of the digital data of the respective samples, supplemented with data corresponding to the respective decoded bits, resulting in values that are the absolute values of the original data.
Information about the sign for the respective samples obtained from a block of data flow analysis 400, if the sign is negative, the absolute value is multiplied by -1 to make the value negative.
For example, assuming that the sequences to be decoded MSB bit is a 1,0,0,0,1,1,..., and if the submission is 0000(2), 10000(2), 10000(2), ... of recovered divided into data bits. Then refers to a sequence of the following bits. If the sequence of the following bits is a 1,1,1,0,0,0, . .., the restored digital data represent 11000(2), 01000(2), 01000(2), 10000(2), 10000(2), ... . Thus, recovery is performed continuously until divided into data bits to the LSB bits, and information about the sign, resulting recover the original input data.
In Fig.5 shows a block diagram of the device audio encoding according to the invention, which includes the imaging unit time/frequency 500, psychoacoustic unit 510, block quantization 520 and block seal bit 530.
The display unit time/frequency 500 converts the audio signal from the time domain into a signal of a frequency domain. Psychoacoustic unit 510 connects the audio signal converted in the signal frequency domain, using the signal components of the frequency bands and calculates the masking threshold for each frequency band. Block quantization 520 quantum signal to the frequency domain in each frequency band, so that the 510. Block seal bit 530 encodes the additional information and the quantized signal components of the frequency domain in each frequency band for generating bit streams.
The main feature of the invention is the block seal bit 530 for generating bit streams by encoding the quantized data in the device, audio encoding. The method of encoding digital data according to the invention can be used in the device, audio encoding, shown in Fig.5, for encoding the quantized data.
Before quantization of the audio signal using the encoder of the first sound psychoacoustic unit 510 using a psychoacoustic model generates the types of groups (long group, primary group, short band, stop-band, and so on ) frames of the input data of the current processing, the values of SMR (signal-to-threshold masking) of the respective bands quantization, information about the area in the case of small groups or delayed in time PCM data to be consistent synchronization psychoacoustic model and display the time/frequency to transmit them to the display unit time/frequency 500. When calculating the psychoacoustic model used Model 2 to ISO/IEC 11 is Zuya modified DCT (MDCT), depending on the group type, the output of the psychoacoustic unit 510. Here the group size is 2048 for long/start/stop group and 256 for short group, and MDCT is performed 8 times. This procedure is the same as that used in the well-known MPEG-2 NBC.
Block quantization 520 combines the frequency components of the data, the converted data in the frequency domain, using strips of quantization are shown in Table 1, and quantum them, increasing the step size, so that the value of SNR (signal/noise) band quantization has become less than the value of the SMR, the output of the psychoacoustic unit 510. Quantization by quantization scale, and the base size of the quantization step is 214. The quantization is performed so that the NMR value was less than 0 dB. The resulting output represents the information of the quantized data and the size of the quantization step of each processed strip. For encoding the quantized signals in each band coding is searched for a quantized signal having the largest absolute value, and then calculates the largest bit quantization for coding.
In Fig.6 shows a detailed block diagram of block seal bit 530, which is used spout 600, the coding block 610 and block the generation of the bit stream 620.
The separation unit bit 600 divides the quantized data output from the block quantization 520, into blocks of bits. The coding block 610 collects MSB bits from among divided into data bits output from the divided into data bits and encodes them. Then the bits are going in order from bits for subsequent encoding. Block the generation of the bit stream 620 generates streams of bits for the encoded data output from the coding block 610, and additional information on the encoded data in the order of significance of the bits.
Now will be described the operation of encoding additional information and quantized data occurring in the separation unit bit 600 and the coding block 610. For more information to start threads a bit to the bit streams are added to the synchronization signal bit streams. Then encoded size of all streams of bits. Next should be coded group type. The subsequent encoding process may differ depending on types of the group. For coding input signals of the frame in accordance with the characteristics of the signal is long, the group may be converted or can be converted to 8 shorter groups. Because of razmerov in each band coding gain maximum value bit quantization, and the coding is performed from the maximum value of the bit quantization encoding method is divided into data bits, the proposed invention. Then encoded information about the step size of the quantization band quantization output during quantization. To encode bits of quantization or information about the size of the quantization step get the minimum and maximum values of bits of quantization or size of the quantization step, to then determine the difference between these two values, whereby get the number of required bits. In practice, before encoding additional information first using arithmetic coding encodes the minimum value and the value needed to represent the bits, and then they are stored in the bit streams. If the encoding is actually executed later, it is the difference between the minimum value and additional information. Then coded these quantized signals.
For encoding the quantized signal can be used coding method is divided into data bits with which the corresponding quantized signals are combined into blocks of bits, and the bits have the e coding of the quantized signals necessary information about the sign of the respective samples, the information on the sign is also encoded. If the number of bits used up to this point, becomes greater than or equal to the allowable number of bits during encoding, depending on the significance, then the encoding at this point ceases to end the thread a bit. Therefore, the overall complexity can be significantly reduced compared with the known encoding method. However, to perform a more efficient encoding regardless of the complexity of the number of bits generated after encoding by an appropriate increase in the step size of each band quantization becomes greater than the number of allowed bits. The coding efficiency can be improved through repetition quantization and coding, while the number of generated bits is less than the allowable number of bits.
Similarly, 8 short of groups obtained by dividing the long group having a size of about one-eighth of the size of the long group, are displaying the time/frequency and quantization, and then the quantized data is lossless encoding. Here, the quantization is not performed separately on each of the 8 groups. Instead, using and what tawania in these sections, shown in Table 2, for further processing as a single lane in the long group. Thus, it can be obtained information about the size of the quantization step for each band in these three sections.
First encoded information bit quantization, and then get the maximum bit quantization. Then encode divided into data bits according to the invention, as long group. If bit quantization of some bands is less than the bit encoded in the moment, then the encoding is not performed. If bit quantization of a certain band becomes equal to the bit encoded in the moment, then the encoding is performed. When encoded strip, first encoded information on the size of the step for the band quantization, and then for subsequent encoding selected values corresponding to the bits of quantization, from among the quantized frequency components.
Through this procedure, the coding is performed in order of importance, and in block generating bit streams 620 are generated bit streams. In other words, to generate bit streams are encoded in order from the MSB bit to LSB-bit information for synchronization, frame size, group type, bit quantization for each of the bands is>In Fig. 7 shows a block diagram of a device for decoding audio decoding bit streams generated by the encoding device of the sound, which includes the analysis block bit streams 700, block decoding 710, block inverse quantization 720 and the display unit frequency/time 730.
The order of decoding audiobot using device decoding the audio signal is the reverse order of the encoding procedure, device, audio encoding. The unit of analysis flows bits 700 examines the significance of the bits forming the bit streams. The block decoding 710 for decoding bits of quantization step size quantization or quantized data generation bit streams input from the device, audio encoding decodes the additional information having at least quantization bits and the step size of quantization and the quantized data from bits to lower bits according to significance analyzed by the analysis block bit streams 700. The block of the inverse quantization 720 restores the decoded step size of quantization and quantized data into signals having the original levels. The display unit frequency/time 730 converts the signals passed back quanta is mA device encoding a video signal, which includes a DCT block 800, the block quantization 810 and block seal 820 bit. Characteristic of the invention is the block seal bits 820 for generating bit streams by encoding the quantized data unit encoding the video signal. The encoding of the quantized digital signals according to the invention can be used in the device, audio encoding, shown in Fig.8.
Block DCT 800 performs DCT video spatial region having an arbitrary level, data in the frequency domain. Block quantization 810 quantum data converted into the frequency domain. Block seal bits 820 separates the additional information and information about the quantized values into blocks of bits according to significance of video data to be encoded, and encodes them sequentially from low frequency to high frequency for generating bit streams.
As shown in Fig.8, the data in the frequency domain is obtained using DCT of video spatial region having an arbitrary level. And then through the quantizer performs quantization to the extent appropriate for the location of the quantized data, as shown in Fig.9.
Data , (usually 1616), as shown in Fig.9B. Then Px group are divided into 4 subgroups (usually 88) having the same size. Then using block DCT 800 DCT is performed for converting the spatial domain into frequency domain data, thereby obtaining the coefficients of the frequency components having the strip 64, as shown in Fig.9C. The resulting coefficients denoted as Fi (i=0, 1, 2, . .., 63) and quanthouse using block quantization 810. The quantized data is indicated as P(Fi) and are arranged in a one-dimensional matrix, as shown in Fig. 9D. Usually the low-frequency components are in most groups, and high-frequency components only in a few groups. Thus, the size of the data is obtained as shown in Fig.9F.
The quantized data is grouped in a similar fashion, and then you can use the method of digital encoding according to the invention for reordered quantized data using block seal 820 bit. Then the original quantized data can effectively be encoded in accordance with the importance, thereby generating the bit streams.
In Fig.10 shows a block diagram of an apparatus of decoding a video signal for decoding bit streams, zakodirovannye 20, the block of the inverse quantization 30 and the IDCT block 40.
The unit of analysis flows bits 10 examines the significance of the bits constituting the coded bit streams. The block decoder 20 decodes the additional information having at least quantization bits and the step size of quantization and the quantized data from bits to lower bits according to significance, the analyzing unit to analyze the flows of bit 10. In other words, get the bit streams generated by the encoding device of the video signal is divided into bits of the quantized data decode according to importance using the method proposed in the invention, and quantized data of the respective frequency components combine with the decoded data. Combined quantized data 64 frequency components are rearranged in the reverse order in the encoding device, resulting in their transformation into quantized data of frequency components to the original subgroups. The block of the inverse quantization 30 restores the decoded step size quantization and the quantized data in the form of signals having the original levels. The IDCT block 40 performs IDCT signals passed inverse quantization, for vos is mportant information that reduces the deterioration of the quality of the audio, even if some threads a bit lost or distorted.
Also, a new method for lossless encoding of digital data according to the invention is compatible with the known method of lossless encoding.
In addition, since the first encoded more important information, the invention can be used for encoding signals of various types, such as audio signals or video signals.
1. The encoding sequence of a specified number of digital data, wherein (a) represents the corresponding digital data having the same specified number of digits, (b) share corresponding to the digital data represented by the same number of digits, then collect the separated digital data to generate sequences composed of numbers with the same location in the corresponding digital data represented by the same number of digits, and (c) encode the sequence from the sequences of the most senior figures to sequences youngest digits.
2. The method of encoding digital data on p. 1, otlichayusta bit, and the operation (C) is the encoding represented in binary form data sequences from the most bits to sequence the most significant bit.
3. The method of encoding digital data on p. 2, characterized in that the encoding operation performed by combining the bits forming the bit sequence into blocks with a specified number of bits.
4. The method of encoding digital data on p. 2 or 3, characterized in that the method is a method of lossless encoding, by which all digital data encode lossless digital data.
5. The method of encoding digital data on p. 4, wherein the lossless encoding is Huffman coding.
6. The method of encoding digital data on p. 4, wherein the lossless encoding is arithmetic coding.
7. The encoding sequence of a specified number of digital data formed from the data of the sign and level data, wherein (a) represents the corresponding digital data having the same specified number of digits, (b) share corresponding to the digital data represented the same share of the, composed of numbers with the same location in the corresponding digital data represented by the same number of digits, (c) encode the sequence of the most senior figures, formed of the most senior figures-level data, forming represent digital data, (d) encode the data of the character corresponding to that contains the number that is in sequence encoded by the most senior figures and is non-zero, (e) encode the sequence of the most senior figures of the number of unencrypted data level digital data, (f) encode noncoding data character from among the data of the character corresponding to the data contains the digit that is in numeric sequences encoded in the operation (e), and is nonzero, (g) perform operations (e) and (f) on the respective digits of the digital data.
8. The method of encoding digital data on p. 7, wherein operation (a) provides for the representation of digital data in the form of binary data having the same number of bits, and the numbers in operations (b) to (g) are the bits.
9. The method of encoding digital data on p. 8, characterized in that the encoding operation with (C) through (g) act means the blocks with the specified number of bits.
10. The method of encoding digital data on p. 8 or 9, characterized in that the method is a method of lossless encoding, by which all digital data encode lossless digital data.
11. The method of encoding digital data on p. 10, wherein the lossless encoding is Huffman coding.
12. The method of encoding digital data on p. 10, wherein the lossless encoding is arithmetic coding.
13. The method of decoding digital data coded in order of importance, by assessing the significance of the digits of digital data, characterized in that (a) decode the digital data using the specified encoding from the most senior figures to the younger digits and (b) recover the digital data of the respective samples obtained in the operation (a), by combining the information digits of the respective samples according to the locations of the respective digits in the source data.
14. The method of decoding digital data on p. 13, characterized in that the figures are bits.
15. The method of decoding digital data on p. 13, wherein operation (a) is the decoding of lossless signal is divided into data bits from the decoded data by combining information for numbers of the respective samples according to the locations of the respective digits in the source data.
16. The method of decoding digital data on p. 14, wherein the method of decoding operation of the decoding is the decoding Huffman.
17. The method of decoding digital data on p. 14, wherein the method of decoding in the decoding operation is the arithmetic decoding.
18. The method of decoding digital data coded in order of importance, by assessing the significance of the digits of digital data, characterized in that (a) analyze the encoded digital data to determine whether the encoded digital data level data or data of the mark, (b) decode the data level of the analyzed digital data in the form specified method of decoding from the most senior figures to the younger digits, and (c) decode the data of the sign of the analyzed digital data for combining the decoded data of the mark with the decoded data.
20. The method of decoding digital data on p. 19, wherein in operation (b) decode lossless analyzed digital data from the highest bit to the lowest bit of the information digits of the respective samples according to the locations of the respective digits in the source data.
21. Device for encoding a sequence of a specified number of digital data, characterized in that it contains a separation unit bits to represent the corresponding digital data binary data formed from the same specified number of bits, and dividing these data into blocks of bits, the coding block for collecting and coding the oldest bit of the number is divided into data bits coming from the separation unit bit, and the subsequent collection and coding most bits and the block sealing bits to generate bit streams in order of importance encoded data out of the unit of encoding.
22. Device for encoding digital data on p. 21, wherein when the digital data formed from the data of the sign and level data, the coding block collects and encodes the data bits having the same significance level, from among divided into data bits, encodes a noncoding data character from among the data of the character corresponding to non-zero data level, and the encoding level data and data of the mark is performed sequentially from the highest bit to the lowest bit.
23. Device for encoding digital data on p. 21 or 22,neetsa by combining the bits in the block with the specified number of bits.
24. The device for decoding digital data coded in order of importance by assessing the significance of bits of digital data, characterized in that it contains the unit of analysis of the bit stream for analyzing the significance of bits of the bit stream of encoded digital data, the block decoder for decoding the analyzed digital data from the most senior figures to the younger numbers, and block associations bit for combining information bits corresponding samples from the decoded data output from the block decode and recover digital data corresponding samples.
25. The device for decoding digital data on p. 24, wherein the block decoding block contains the decoded level data for decoding the data level of the analyzed digital data using the specified method of decoding from the most senior figures to the youngest numbers and block decoding data of the mark for decoding data of the sign of the analyzed digital data and combining the decoded data of the mark with the decoded data.
26. The device for decoding digital signals on p. 24 or 25, wherein the block decoding decodes lossless analyzed the data bits.
27. Device for encoding the audio signal, characterized in that it contains the unit conversion time/frequency to convert the input audio signal time domain into a signal of a frequency domain, block quantization to the quantization signal frequency domain for each frequency band, the separation unit bits for dividing the quantized data into blocks of bits, the coding block for collecting and coding the oldest bit of the number is divided into data bits output from the separation unit bit, and the subsequent collection and coding bits sequentially from the oldest bit, and block the generation of the bit stream to generate bit streams in order of significance bits of the coded data and additional information for the coded data.
28. Device audio encoding on p. 27, characterized in that the power generating bit streams to generate streams of bits sequentially from low frequency to high frequency.
29. A method of coding an audio signal, wherein the divided audio data quantized for each given frequency band, in units of bits, collect and encode the most significant bits of the numbers divided into data bits and carry out the subsequent collection and coding bit sequence is more information for the coded data.
30. A method of coding an audio signal by p. 29, characterized in that the bit streams generated sequentially from low frequency to high frequency and from the bits to the youngest bits.
31. The device is decoding the audio signal for decoding bit streams of encoded audio data, characterized in that it contains the unit of analysis of the bit stream for analyzing the significance of bits forming the bit streams, the block decoding for decoding the additional information having at least quantization bits and the step size of quantization and the quantized data from the highest bit to the lowest bit in accordance with the importance analyzed by the analysis block of the bit stream, the block of the inverse quantization to restore the decoded step size quantization and the quantized data received from the block decoding, the signals having the original levels, and the conversion unit frequency/time to convert the signals passed inverse quantization obtained from the block of the inverse quantization signals in the time domain.
32. The method of decoding an audio signal for decoding bit streams of encoded audio data, wherein the decode additional information, the t to the youngest bits, have a feedback decoded quantization step size quantization and quantized data into signals having the original levels, and convert the signals that have passed inverse quantization signals in the time domain.
33. Device for encoding a video signal containing the block discrete cosine transform for performing discrete cosine transform of the input video signal, the block of quantization to the quantization of the data that passed the discrete cosine transform, block seal bit to separate the additional information and the quantized values into blocks of bits in accordance with the importance of the quantized data and generating bit streams.
34. A method of coding a video signal, characterized in that quantuum input video signal that has undergone the discrete cosine transform, share additional information and information about the quantized values into blocks of bits in accordance with the importance of the quantized data and code is divided into data bits in order of importance and generate streams of bits.
35. A method of coding video according to p. 34, characterized in that the significance correlated with the position of the bit, the significance of quantian meniaetsa down to the youngest bits.
36. A method of coding video according to p. 34, wherein the encoding is performed sequentially from low frequency to high frequency.
37. The device decoding a video signal for decoding bit streams of encoded video data, characterized in that it contains the unit of analysis of the bit stream for analyzing the significance of bits forming the bit streams, the block decoding for decoding the additional information having at least quantization bits and the step size of quantization and the quantized data from the highest bit to the lowest bit in accordance with the importance analyzed by the analysis block of the bit stream, the block of the inverse quantization to restore the decoded step size of quantization and quantized data into signals having the original levels, and the block of the inverse discrete cosine transform to perform inverse discrete cosine transform of the signals passed inverse quantization.
38. A device for decoding video by p. 37, characterized in that the coding block performs encoding sequentially from low frequency to high frequency.
39. Method of decoding a video signal for decoding dirout for more information having at least quantization bits and the step size of quantization and the quantized data from the highest bit to the lowest bit, carry back the decoded quantization step size quantization and quantized data into signals having the original levels, and perform inverse discrete cosine transformation of the signals passed inverse quantization.
Priority points:
02.04.1997 on PP.1-12, 21-23 and 27-30;
19.11.1997 on PP.13-20, 24-26 and 31-39.
A method and apparatus for loop-filtering the image data // 2154918
The invention relates to television, in particular to the processing of the image data, and in particular to a method and apparatus for loop-filtering the image data
Method of adaptive channel coding and device for its implementation // 2193276
The invention relates to methods and devices for adaptive channel coding for communication systems
The data transmission method and apparatus for signal encoding // 2191470
The invention relates to a data transmission method and apparatus for encoding and decoding signal containing side encoding at least two parallel coding block, and on the side of decoding at least two parallel block decoding
Channel coding/decoding in a communication system // 2190929
Device and method for inserting previously known bits at the input stage of the channel encoder // 2190296
The invention relates to a device and method of channel coding in the system previously known bits at the input stage of the channel coding device
The device and method of speed control for communication systems, multiple access, code-division // 2187892
The invention relates to communication systems, and in particular to a device and method for adaptive speed control data transmission channel in accordance with the operating conditions of the channel in the communication system mdcr
Parallel cascaded convolutional code with a finite sequence of bits and a decoder for such a code // 2187196
The invention relates to a coding error correction used when sending text messages on channels of low quality, and, more particularly, to a method of parallel cascaded convolutional encoding and corresponding decoding device
The address generator and method of generating addresses for use in turboproject/facing the interleaver // 2186460
The invention relates to turopereiting /facing the interleaver in communication system
The method of transmission of information protection against errors, the method of receiving information with protection from errors and transmitting system for transmitting information // 2186459
High-speed module for adding/comparing/selecting for use with witterby decoder // 2246751
FIELD: Witterby algorithm applications.
SUBSTANCE: system has first memory element for storing metrics of basic states, multiplexer, capable of selection between first and second operating routes on basis of even and odd time step, adding/comparing/selecting mechanism, which calculates metrics of end states for each state metric. Second memory element, connected to adding/comparing/selecting mechanism and multiplexer is used for temporary storage of end states metrics. Multiplexer selects first operating route during even time steps and provides basic states metrics, extracted from first memory element, to said mechanism to form end state metrics. During odd cycles multiplexer picks second operating route for access to second memory element and use of previously calculated end state metrics as metrics of intermediate source states.
EFFECT: higher efficiency.
Coding/decoding device and method for mobile code-division multiple access communication system // 2250563
FIELD: communications engineering.
SUBSTANCE: proposed device and method for mobile code-division multiple access communication system including device for transferring channel of backward-link transmission speed indicator afford generation of optimal code words ensuring optimal coding for all types of coding procedures from optimal type (24.1) up to optimal coding procedure 24.7 and supporting all optimal-coding devices.
EFFECT: optimized capacity.
74 cl, 21 dwg, 44 tbl
Noise-immune cyclic code codec // 2251210
FIELD: communications engineering; network remote measuring and control systems.
SUBSTANCE: proposed noise-immune cyclic code codec designed for data transfer without pre-phasing has on sending end code-word information section shaper incorporating shift-register memory elements, units for computing verifying parts of noise-immune code of code-word information section, and modulo two adder of code-word information section shaper; code-word synchronizing section shaper and modulo two adder of code-word synchronizing section; on receiving end it has binary filter incorporating binary-filter shift register memory elements, computing units for verifying parts of binary-filter noise-immune code, and binary-filter modulo two adder; shift register of code word information section; decoder; accumulator; error correction unit; unit for shaping synchronizing section of code word; and modulo two adder units.
EFFECT: enhanced speed of device.
Device and method for generating codes in communications system // 2251793
FIELD: communication systems.
SUBSTANCE: method includes generating sets of sub-codes of quasi-additional turbo-codes with given encoding speeds, and given sub-codes are reorganized as a set of sub-codes with another encoding speed for use in next transfer of sub-code with given encoding speed.
9 cl, 13 dwg
Device and method for generating codes in communication system // 2251794
FIELD: data transfer technologies.
SUBSTANCE: method includes segmentation of length N of quasi-complementary turbo-codes on preset amount of sections, determining identifiers of sub-code packets appropriate for segmented portions, setting of said packets separated for initial transfer of sub-code, calculation of number of remaining symbols in form N-Fs, where N - length of quasi-complementary turbo-codes, and Fs - position of start symbol of sub-code of quasi-complementary turbo-codes, determining position of symbol of remaining symbols in amount equal to sub-codes amount, which have to be sent and serial transfer of sub-code symbols from position of starting symbol Fs to position of last symbol Ls.
Device and method for check transmission for increasing carrying capacity of transmission in information transmitting system // 2251813
SUBSTANCE: method includes selecting one combination among given combinations, appropriate for several or every generated symbols of code word to transmit generated symbols of code word with length of sub-packet, determined in accordance to data transfer speed, information, appropriate for data transfer speed, is read, also based on length of sub-packet and chosen combination, from a table, wherein identification information, pointing at data transfer speed, sub-packet length and selected combination, is, is previously displayed for given information, and generated code word symbols are transmitted in accordance to read information and in accordance to selected combination.
EFFECT: possible check transmission of information by means of hybrid automatic repeat query for increasing carrying capacity during high-speed information transfer.
4 cl, 16 dwg, 6 tbl
Communication channel simulation method // 2254675
FIELD: communications engineering; simulating digital communication channels with separate and grouping errors.
SUBSTANCE: proposed method includes evaluation of set of communication channel states S0,S1, ..., Sm - 1 and calculation of conditional error probabilities P(e/s) in each state s" i = 0, ..., m - 1 of communication channel, and error acquisition in communication channel in compliance with conditional error probability for current state of communication channel; in the process probability of error-free interval p(0i) of i bits is found, and conditional probabilities p(0i1/11), p(0i1/01) of error-free intervals of i bits are calculated with respect to them basing on probabilities p(0i) and using recurrent rules during each current time interval and preceding one on condition that for error generation use is made of two states of communication channel corresponding to combination of errors 11 or 01; random number p uniformly distributed within interval between 0 and 1 is generated; conditional probabilities p(0i1/11), p(0i1/01) are summed up starting from i = 0 resulting in sequence 0k1 that constitutes bit-by-bit stream of communication channel errors.
EFFECT: enhanced speed.
Codec for noise immune cyclic code // 2254676
FIELD: communications engineering; data transfer, telemetering, and telecontrol systems.
SUBSTANCE: proposed codec has on sending end code-word data part shaper whose output and that of code-word synchronizing part shaper are connected to modulo two adder input; on receiving end it has binary filter whose code-word data part shaper output is connected to accumulator connected to synchronizing sequence decoder and to error connection unit whose outputs are connected to respective inverting inputs of code-word data part shaper; output of the latter functions as data output of device; output of binary-filter code-word synchronizing part is connected through switching unit to input of code-word data part shaping unit; synchronizing sequence decoder output is connected to control input of switching unit and to error correction unit input; on receiving end accumulator outputs are connected to inputs of code-word data part shift decoder whose output is connected to input of delay circuit whose output functions as second control input of switching unit and as synchronizing output of device.
EFFECT: enhanced noise immunity.
Interleaver and interleaving process in communication system // 2255419
FIELD: coding in communication systems.
SUBSTANCE: proposed partial reverse bit-order interleaver (P-RBO) functions to sequentially column-by-column configure input data stream of size N in matrix that has 2m lines and (J - 1) columns, as well as R lines in J column, to interleave configured data, and to read out interleaved data from lines.
EFFECT: optimized interleaving parameters complying with interleaver size.
4 cl, 7 dwg, 3 tbl


text:
Renny Arozarena (born 1971, in Havana) is a Cuban actor.

He started acting as a child, making his professional debut on the stage in leading roles in Andoba, Santa Camila de la Habana Vieja, Romeo et Juliette, Othello, among others. He is now director of a theatre group.  He has been in films such as Entre Ciclones, Bajo Habana and El loco soñador.

The film El Benny marks his first leading role in films.  It was presented at the Locarno International Film Festival in August 2006, where Arozarena won the Boccalino prize for best performance for protagonist in all sections of festival.  The Hollywood Reporter said "It is actor Arozarena who brings the legend to life, however, in a memorably dynamic performance."

Filmography
Entre ciclones (2003)
Bajo Habana (2003)
El Benny (2006)
Kangamba (2008)

See also
 Cinema of Cuba

External links

1971 births
Living people
20th-century Cuban male actors
21st-century Cuban male actors
Cuban male stage actors
Cuban male film actors
Male actors from Havana
North American child actors
Male child actors

redpajama_set_name: RedPajamaWikipedia


text:
Home Entertainment Movie Reviews Doctor Who Episode 4 'Listen' Review
Doctor Who Episode 4 'Listen' Review
Kingsley Olaleye Reuben
Wed September 17, 2014
Series 8, Episode 4: Mysterious Monsters – Superb Story
It's the one fans will be talking about for a very long time. The first two of the three episodes were delightfully dark, the third also underneath the humor and heartiness in which The Doctor was some what a buffer too with his moody demeanor. Many will claim that this fourth episode is where the series has peaked. Well either Moffat has knocked one out the park and the series will go on a decline from here or we have yet to even come close to heights the series is about to scale. Personally I'm indifferent.
So what was so special about this episode?
The preview didn't impress me and I wasn't expecting much, but less is more as they say, and the saying has never been truer about a Doctor Who baddie until now. These monsters under the bed every child imagines are brought to the fore with an intelligent introduction that raises more questions than it answers. What do they look like? What do they want? Where do they come from? The questions go on.
The doctor uses Clara as a compass via the TARDIS' telepathic console unit, locating the time when she had had a dream of being grabbed by the foot by the monster under the bed. However, she slightly missed with her aim (in true TARDIS driving fashion) by thinking about Danny Pink, the fellow teacher whom she'd go on a date with (a disastrous and embarrassing date at that). They end up meeting Danny as a child when he'd dreamt the same dream.
Doctor Who in the Tardis
The story gets even better when Clara asks the Doctor to break a time traveling rule (nothing new there then) and allow her to go back to her date (which she had previously stormed out of) in an attempt to make up for her first botched attempt at romantic interaction. Her mouth lands her in trouble – again – and things get even more tricky. In an attempt to not be like all those movie spoiler cretins I'll simply say childhoods are explored. Was that too much? It probably was. I think the spoiler ship sailed long ago. Let me continue!
As always, Doctor Who is didactic in its story telling and the theme today was all about fear and loneliness. Clara doesn't want to be alone in her attempt at pairing up with Danny Pink and failing miserably, The Doctor cant be alone, he needs Clara and states so earlier in the episode when he convinces her that whingeing about her date is far less important than the mystery he has lined up for her to help him solve.
Danny Pink's descendant Orsen Pink definitely doesn't want to be lonely after being shot to the end of the universe. However it's a little bit more than just company, rather the company you keep. Orsen made it clear that he was not alone despite being the last man at the end of the universe, and that was by no means a good thing, as the monsters who are in constant hiding come a-knocking.
Fear is also touched on and the Doctor puts it aptly when he says "Scared is a super power." And he makes the argument that it's not so much being scared that is of importance but rather what we do when we are fearful – channel that fear into making the right decisions.
In a beautiful bit of writing almost only possible where time travel is concerned, Clara ends up under a bed … in Gallifrey … What follows makes Clara probably the most important companion the Doctor has had and will ever have.
For those who have said Clara's character wasn't fleshed out enough, they will be extremely happy with this episode. Her words of wisdom borrowed from The Doctor to sooth his younger self tie in perfectly with a segment from the 50th anniversary.
This episode will be remembered for its climactic last ten minutes that does so much to enrich the characters on screen in a way that hasn't been achieved previously. Definitely a new high for the show and we have 8 episodes left in the series, I almost can't wait.
Bring on episode 5!
Doctor Who series 8
Kingsley Olaleye Reuben is an author who writes scripts, prose, poetry, and plays, journalistic stories and interviews, manages two blogs and is currently studying for a masters at Roehampton University, and working on his next book.You can contact Kingsley (also known as "The Bard") by email [email protected] or through NewsBlaze.
Ariel's red hair caused a few problems for The Little Mermaid
Is a TV Antenna Right for You? The Ultimate Guide
QUINCY – the Jones Kid
THE BLEEDING EDGE – Shocking Netflix Documentary
ANON – Withholding the Future
Leave No Trace – An All Around Wilderness
ABACUS: Small Enough To Jail (Documentary)
THE ESCAPE – With a Soft Landing
Latest Movies News from PR Newswire

redpajama_set_name: RedPajamaCommonCrawl


Chris Beaven's weekly NBA column.
Few of their games make it on national TV. Most of the time, they're playing past midnight for fans in the East.
But the Golden State Warriors are once again one of the more entertaining teams in the NBA.
Led by point guard Baron Davis and swingman Stephen Jackson, the Warriors became the fastest team in league history to climb above .500 after an 0-6 start. They enter tonight's game in Seattle at 8-7 after winning seven of eight games in a 12-day stretch.
Jackson's return from a seven-game suspension at the start of the season is an obvious reason for the turnaround.
"He's definitely a catalyst of it," forward Al Harrington said after Thursday's win over Houston.
The 6-foot-8 Jackson averages 21.6 points a game, and the Warriors are allowing 16 fewer points per game since his return. His versatility on both ends pulls together a quick, athletic team that creates mismatch problems. See last year's playoff upset of Dallas. But Jackson can't receive all the credit.
Davis is playing at a high level, averaging 24.2 points, 8.5 assists and 5.3 rebounds. He just has to stay healthy. So does Monta Ellis. The lightning quick, 6-3 guard averages 16.3 points per game. During the last four games, he's averaging 25.5 points on 57.1 percent shooting.
Davis, Kobe Bryant and LeBron James each heard chants of "M-V-P ... M-V-P" from their home crowds this week, and they are playing at that level through the first month.
But Orlando forward Dwight Howard has been the most physically dominating player in leading the Magic to an impressive start.
Howard went for a career-high 39 points Wednesday in a 110-94 win at Seattle to go with 16 rebounds and five blocks. It was his 14th double-double and third time he scored 30 or more in a six-game stretch. He averages 23.5 points and 14.5 rebounds, shooting 61.2 percent from the field.
The 6-foot-11, 265-pound Howard threw down nine dunks, shooting 12-of-17. He has 75 dunks overall.
"Point blank, he is the most dominant player in this game right now," Seattle rookie Kevin Durant said.
Charles Barkley called them the Washington Generals. The rest of us might think of them as the franchise formerly known as the New York Knicks.
The Knicks wandered through another game Thursday and took a 45-point beating, 104-59, in Boston for their lack of effort. New York hadn't lost this bad since 1980. Only a Nate Robinson halfcourt heave at the buzzer prevented the Knicks from their fewest points of the shot-clock era.
For the record: Boston's "Big Three" — Kevin Garnett, Ray Allen and Paul Pierce — scored 50 points, not even an average night for them. Subs Eddie House (15 points) and Glen "Big Baby" Davis (13) each scored more than any Knick.
Davis, a rookie out of LSU, entered the weekend playing his best basketball. He scored a then career-high 8 points in just six minutes in Cleveland on Tuesday, making all three of his shots from the floor. The 6-foot-9, 289-pound forward came back to make 4-of-6 shots vs. the Knicks and grabbed six rebounds.
- Give Golden State fans credit. While most NBA fans must be prodded into cheering by video scoreboards, a screaming PA announcer or Guns N' Roses power chords, Warrior fans actually did it on their own Monday. They broke out a "Let's Go Warriors" on their own late in a win over Phoenix that snapped the Suns' eight-game winning streak.
- The Lakers actually might get rewarded for not trading young center Andrew Bynum. He continues to show signs of being an impact player inside, averaging a double-double. Also, backup guard Jordan Farmar is providing tremendous energy and solid shooting off the Lakers bench.
- The Bucks need to find consistency. A week after beating the Cavs, Lakers and Mavericks, they lost to the Hawks and 76ers. "If we'd win these games, we'd be in a great position, but obviously we're taking things for granted," Andrew Bogut told the Milwaukee Journal Sentinel.


CompuNomad – Your tech when you're on the road.
Your tech when you're on the road.
WAIT! We are here! Well, more info here.
Do you live in an RV and need a computer tech? You're in the right place!
Do you need help setting up WiFi or even a network in your RV? I'm your man!
Are you trying to setup remote backup to a network device or to the cloud? I am your backup engineer!
Are you saying "wait, what? How do I do that?", then we need to talk!
The website will be undergoing some major changes soon!


After Alec Berg and Mike Judge finished the first season of their HBO comedy "Silicon Valley," the showrunners made a decision to take on even more work for the current year: they'd alternate writing and directing episodes, rather than hiring guest directors.
Because the lines between TV directing and writing continue to blur, Berg and Judge aren't the only showrunners moving seamlessly between the two. Writer-directors say the two disciplines complement each other in a way that makes for a better show overall.
John Ridley of ABC's "American Crime" finds the process of directing his own script allows him to step back from his words.
Whether drama or comedy, often what works on the page doesn't on set, so having the ability to tweak a line on the fly makes for an easier shoot.
Krisel agrees that when it comes to creating the best final product there's no room for being precious about the script.
Per Ridley, allowing room for those on-set discoveries is part of the benefit of writing and directing.


17/08/2018�� the more similar the better, but it will need to be able to host the raid card and power the drives at a minimum. If these are drives in hot bays they you'll need to be very careful they go in the exact same bays and the bays are wired to the raid card the same way....so the more exact the better..... 21/01/2008�� When you have a party, go to the "raid" tab in your social window and use the function "convert to raid" a raid can be anywhere from 2-40 people. Post by Judela You can get new people to your guild by doing that whole "guild is looking for new players" You can be annoying and do it in trade, or post in the guild channel.
The raid may not have matchmaking per say but you have the option of Guided Games which will match you with a clan, theoretically, helping people through the Raid. It worked pretty well for me but keep these few things in mind.... 21/01/2008�� When you have a party, go to the "raid" tab in your social window and use the function "convert to raid" a raid can be anywhere from 2-40 people. Post by Judela You can get new people to your guild by doing that whole "guild is looking for new players" You can be annoying and do it in trade, or post in the guild channel.
So your raid technically scales on how high your levels are (for these skills). The cooking skill is combined in here because it will need to match the type of food you catch with hunter/fishing. Meaning if you have a fishing level of 90, you need a cooking level of 90 to cook the fish you catch.
17/08/2018�� the more similar the better, but it will need to be able to host the raid card and power the drives at a minimum. If these are drives in hot bays they you'll need to be very careful they go in the exact same bays and the bays are wired to the raid card the same way....so the more exact the better..


text:
A Lenda de Ellcia (幻想叙譚エルシア Gensō Jodan Elicia) é um anime OVA dirigido por Noriyasu Kogawa e animado por JCStaff. Foi lançado em 1993, e consiste em 4 episódios de 50 minutos. ADV Films lançou para home vídeo nos Estados Unidos.

Dublagem Brasileira

Estúdio: Mastersound, São Paulo

Ligações externas

Animes de 1993


text:
Report says probation's flaws may prove costly
Governor Deval Patrick wants the inspector general to investigate.
By Marcella Bombardieri
Globe Staff / July 27, 2010
The Massachusetts Probation Department's culture of secrecy, failure to evaluate its own performance, and indifference to the best methods of reforming criminals have wasted scarce public funds and compromised public safety, according to a new study to be released today.
If public safety agencies — primarily probation — do not do a better job of keeping offenders from returning to the state's overcrowded prisons, Massachusetts will need to spend $550 million to build new jails and $45 million every year to run them, according to the Boston Foundation report.
"The manifold failures of our current Probation Department are leading to skyrocketing costs . . .,'' said Paul S. Grogan, president and chief executive of the Boston Foundation. "The human cost is also of great concern to us. . . . It means probably our prison population is much larger than it should be.''
Also yesterday, Governor Deval Patrick called on state Inspector General Gregory W. Sullivan to investigate the agency, and two of the state's top judges sought to reassure the public that changes are underway.
The new review — which follows a Spotlight Team report Sunday highlighting the Probation Department's mismanagement and inflated claims — will likely examine the department's efficiency and whether it is wasting public funds, according to Jack McCarthy, the senior assistant inspector general. Independent counsel Paul F. Ware Jr. already is examining patronage hiring and promotion within the 2,200-employee agency.
The Globe's findings are "extremely troubling,'' Patrick said. "I have personally asked about the doings over there and got no response. That's just not acceptable.''
The Spotlight Team reported Sunday that the Probation Department's electronic monitoring program has more employees than any other state and that its $19.5 million statewide network of rehabilitation centers is increasingly shunned by judges and county sheriffs who considers its performance lackluster. In May, the Globe reported that the department has hired at least 250 relatives, friends, and financial supporters of politicians or court officials.
After the May report, Supreme Judicial Court Chief Justice Margaret H. Marshall and Robert A. Mulligan, chief justice for administration and management, suspended Probation Commissioner John. J. O'Brien. Yesterday, the two judges said in a statement that the acting administrator is examining the effectiveness of all programs, including electronic monitoring and Community Corrections Centers.
"We want to reassure the residents of Massachusetts and court employees that court leaders continue to take comprehensive measures to address issues regarding the Probation Department reported in The Boston Globe's Spotlight articles,'' they said.
With strong support from state legislators, Probation Department spending skyrocketed 163 percent from 1998 to 2008, according to a previous Boston Foundation report. Other public safety agencies' budgets grew by no more than 20 percent. But those figures don't capture the taxpayer money lost when the agency fails to help troubled lawbreakers change their ways — leading them back to jail.
"The Legislature should be asking: What are we getting for this cost?'' said Len Engel, the lead author of both Boston Foundation studies. Engel is managing associate for policy at the Crime and Justice Institute, part of the Boston-based nonprofit Community Resources for Justice. "There seem to be no questions asked.''
The new report says that several states have been able to close prisons or shelve construction plans by making the kinds of moves the foundation recommends in Massachusetts, including intense data analysis, staff training, and programs that can change the way criminals think.
For example, focusing resources on the riskiest offenders helped Michigan cut returns to prison by 32 percent and reduce the prison population by 6,500 people — to 45,000 — in three years, according to the report.
A spokeswoman for the state's trial court system, of which the Probation Department is a part, said officials could not comment on the Boston Foundation report because they had not seen it.
The report highlighted "best practices'' widely accepted elsewhere, but not in Massachusetts. According to research, identifying the danger posed by an offender, and what kind of help that person needs to get back on track, is crucial to preventing a cycle of crime.
But Massachusetts has been using the same eight-question assessment form since 1988. The Probation Department told Engel that 81 percent of its probationers are deemed high risk, while modern assessment tools tend to place only about 15 percent of offenders in that category.
That matters because high-risk offenders need costly, intense intervention, while low-risk offenders are more likely to rebuild productive lives when they get less attention from their probation officers, according to research.
Mulligan and Marshall said the trial court is working with a national expert to update its risk assessment method.
In Connecticut, one of the model states the report identified, offenders receive different services depending on how they score on a scientifically validated, 54-question risk assessment. Some of most troubled probationers are put into inpatient treatment. Those who misbehave on regular probation are assigned to specially trained officers with small caseloads.
But only about a dozen officers supervise some 16,000 low-risk offenders with phone calls and mail instead of in-person appointments, according to William Carbone, executive director of the Court Support Services Division, which oversees probation within Connecticut's court system.
"It can be done,'' Grogan said. "It's not a mystery how to get this right.''
Noah Bierman and Thomas Farragher of the Globe staff contributed to this report. The Spotlight Team would like to hear from readers with tips about the state's Probation Department. The telephone number is 617-929-3208. Confidential messages can also be left at 617-929-7483. The e-mail address is spotlight@globe.com.


Charlotte Public Schools is pleased to announce the hire of Mike Sparks as the new Youth Recreation Coordinator. Mike, a graduate of Hope College, has vast experience in community services, coaching and recreation as he has previously worked in those capacities for the Bellevue and Maple Valley school districts. Mike has also served as the head varsity football coach for Napoleon High School, football special teams coordinator at Olivet College, and athletic director for Maple Valley Junior & Senior High School. He looks forward to putting that experience to work in the Charlotte community to provide recreational opportunities for area youth. "I'm excited for the opportunity to serve the district in this capacity and have great hope that we can improve the infrastructure and offerings of youth recreation locally." Mike looks forward to fulfilling the recreational needs in the community, and helping supplement sport and recreation offerings currently offered by other local organizations. "I am looking forward to building positive relationships with all organizations and individuals who currently assist in the development of our youth; especially within recreational programming," explains Sparks. "Through a comprehensive collaboration, we will serve Charlotte's youth and help them to bridge any gaps in their physical, academic and social development." Article submitted by Charlotte Public Schools.