153 research outputs found
Optical multiple access techniques for on-board routing
The purpose of this research contract was to design and analyze an optical multiple access system, based on Code Division Multiple Access (CDMA) techniques, for on board routing applications on a future communication satellite. The optical multiple access system was to effect the functions of a circuit switch under the control of an autonomous network controller and to serve eight (8) concurrent users at a point to point (port to port) data rate of 180 Mb/s. (At the start of this program, the bit error rate requirement (BER) was undefined, so it was treated as a design variable during the contract effort.) CDMA was selected over other multiple access techniques because it lends itself to bursty, asynchronous, concurrent communication and potentially can be implemented with off the shelf, reliable optical transceivers compatible with long term unattended operations. Temporal, temporal/spatial hybrids and single pulse per row (SPR, sometimes termed 'sonar matrices') matrix types of CDMA designs were considered. The design, analysis, and trade offs required by the statement of work selected a temporal/spatial CDMA scheme which has SPR properties as the preferred solution. This selected design can be implemented for feasibility demonstration with off the shelf components (which are identified in the bill of materials of the contract Final Report). The photonic network architecture of the selected design is based on M(8,4,4) matrix codes. The network requires eight multimode laser transmitters with laser pulses of 0.93 ns operating at 180 Mb/s and 9-13 dBm peak power, and 8 PIN diode receivers with sensitivity of -27 dBm for the 0.93 ns pulses. The wavelength is not critical, but 830 nm technology readily meets the requirements. The passive optical components of the photonic network are all multimode and off the shelf. Bit error rate (BER) computations, based on both electronic noise and intercode crosstalk, predict a raw BER of (10 exp -3) when all eight users are communicating concurrently. If better BER performance is required, then error correction codes (ECC) using near term electronic technology can be used. For example, the M(8,4,4) optical code together with Reed-Solomon (54,38,8) encoding provides a BER of better than (10 exp -11). The optical transceiver must then operate at 256 Mb/s with pulses of 0.65 ns because the 'bits' are now channel symbols
Modulation and coding technology for deep space and satellite applications
Modulation and coding research and development at the Jet Propulsion Laboratory (JPL) currently emphasize Deep Space Communications Systems and advanced near earth Commercial Satellite Communications Systems. The Deep Space Communication channel is extremely signal to noise ratio limited and has long transmission delay. The near earth satellite channel is bandwidth limited with fading and multipath. Recent code search efforts at JPL have found a long constraint, low rate convolutional code (15, 1/6) which, when concatenated with a ten bit Reed-Solomon (RS) code, provides a 2.1 dB gain over that of the Voyager spacecraft - the current standard. The new code is only 2 dB from the theoretical Shannon limit. A flight qualified version of the (15, 1/6) convolutional encoder was implemented on the Galileo Spacecraft to be launched later this year. An L-band mobile link, use of the Ka-band for personal communications, and the development of subsystem technology for the interconnection of satellite resources by using high rate optical inter-satellite links are noted
Design of FPGA-Implemented Reed-Solomon Erasure Code (RS-EC) Decoders With Fault Detection and Location on User Memory
ReedβSolomon erasure codes (RS-ECs) are widely used in packet communication and storage systems to recover erasures. When the RS-EC decoder is implemented on a field-programmable gate array (FPGA) in a space platform, it will suffer single-event upsets (SEUs) that can cause failures. In this article, the reliability of an RS-EC decoder implemented on an FPGA when there are errors in the user memory is first studied. Then, a fault detection and location scheme is proposed based on partial reencoding for the faults in the user memory of the RS-EC decoder. Furthermore, check bits are added in the generator matrix to improve the fault location performance. The theoretical analysis shows that the scheme could detect most faults with small missing and false detection probability. Experimental results on a case study show that more than 90% of the faults on user memory could be tolerated by the decoder, and all the other faults can be detected by the fault detection scheme when the number of erasures is smaller than the correction capability of the code. Although false alarms exist (with probability smaller than 4%), they can be used to avoid fault accumulation. Finally, the fault location scheme could accurately locate all the faults. The theoretical estimates are very close to the experiment results, which verifies the correctness of the analysis done.This work was supported in part by the National Natural Science Foundation of China under Grant 61501321, in part by the China Postdoctoral Science Foundation and Luoyang Newvid Technology Company, Ltd., and in part by the ACHILLES Project PID2019-104207RB-I00 funded by the Spanish Ministry of Science and Innovation
A systolic array implementation of a Reed-Solomon encoder and decoder.
A systolic array is a natural architecture for the
implementation of a Reed- Solomon (RS) encoder and decoder.
It possesses many of the properties desired for a special-purpose
application: simple and regular design, concurrency,
modular expansibility, fast response time, cost- effectiveness,
and high reliability. As a result, it is very well
suited for the simple and regular design essential for VLSI
implementation
.
This thesis takes a modular approach to the design of a
systolic array based RS encoder and decoder. Initially, the
concept of systolic arrays is discussed followed by an
introduction to finite field theory and Reed- Solomon codes.
Then it is shown how RS codes can be encoded and decoded with
primitive shift registers and implemented using a systolic
architecture. In this way, the reader can gain valuable
insight and comprehension into how these entities are
coalesced together to produce the overall implementation.http://archive.org/details/systolicarrayimp00mckeLieutenant, United States NavyApproved for public release; distribution is unlimited
Tutorial on Reed-Solomon error correction coding
This tutorial attempts to provide a frank, step-by-step approach to Reed-Solomon (RS) error correction coding. RS encoding and RS decoding both with and without erasing code symbols are emphasized. There is no need to present rigorous proofs and extreme mathematical detail. Rather, the simple concepts of groups and fields, specifically Galois fields, are presented with a minimum of complexity. Before RS codes are presented, other block codes are presented as a technical introduction into coding. A primitive (15, 9) RS coding example is then completely developed from start to finish, demonstrating the encoding and decoding calculations and a derivation of the famous error-locator polynomial. The objective is to present practical information about Reed-Solomon coding in a manner such that it can be easily understood
Multiple Cell Upsets Correction for OLS Codes
ABSTRACT: An Error Correction code with Parity check matrix is implemented which is other type of the One Step Majority Logic Decodable (OS-MLD) called as Orthogonal Latin Squares (OLS) codes. It is a concurrent error detection technique for OLS codes encoders and syndrome computation because of the fact that when ECCs are used, the encoder and decoder circuits can also suffer errors.These OLS codes are used to correct the memories and caches. This can be achieved due to their modularity such that the error correction capabilities can be easily adapted to the error rate or to the mode of the operation.OLS codes typically require more parity bits than other codes to correct the same number of errors. However, due to their modularity and the simple low delay decoding implementation these are widely used in Error Correction. All the errors that affect a single circuit node are detected by the parity prediction scheme. The area and latency values are monitored
ΠΠ²ΡΡ ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΠ΅ Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΠ΅ ΠΊΠΎΠ΄Ρ Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π² ΠΊΠΎΠ»ΡΡΠ΅ Π²ΡΡΠ΅ΡΠΎΠ² ΠΏΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ M=4
The paper describes research results of features of error detection in data vectors by sum codes. The task is relevant in this setting, first of all, for the use of sum codes in the implementation of the checkable discrete systems and the technical means for the diagnosis of their components. Methods for sum codes constructing are described. A brief overview in the field of methods for sum codes constructing is provided. The article highlights codes for which the values of all data bits are taken into account once by the operations of summing their values or the values of the weight coefficients of the bits during the formation of the check vector. The paper also highlights codes that are formed when the data vectors are initially divided into subsets, in particular, into two subsets. An extension of the sum code class obtained by isolating two independent parts in the data vectors, as well as weighting the bits of the data vectors at the stage of code construction, is proposed.
The paper provides a generalized algorithm for two-module weighted codes construction, and describes their features obtained by weighing with non-ones weight coefficients for one of data bits in each of the subvectors, according to which the total weight is calculated. Particular attention is paid to the two-module weight-based sum code, for which the total weight of the data vector in the residue ring modulo M = 4 is determined. It is shown that the purpose of the inequality between the bits of the data vector in some cases gives improvements in the error detection characteristics compared to the well-known two-module codes. Some modifications of the proposed two-module weighted codes are described. A method for calculating the total number of undetectable errors in the two-module sum codes in the residue ring modulo M = 4 with one weighted bit in each of the subsets is proposed. Detailed characteristics of error detection by the considered codes both by the multiplicities of undetectable errors and by their types (unidirectional, symmetrical and asymmetrical errors) are given. The proposed codes are compared with known codes. A method for the synthesis of two-module sum encoders on a standard element base of the single signals adders is proposed. The classification of two-module sum codes is presented.ΠΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Ρ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΠΎΡΠΎΠ±Π΅Π½Π½ΠΎΡΡΠ΅ΠΉ ΠΎΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΡ ΠΎΡΠΈΠ±ΠΎΠΊ Π² ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠ°Ρ
ΠΊΠΎΠ΄Π°ΠΌΠΈ Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ. Π ΡΠ°ΠΊΠΎΠΉ ΠΏΠΎΡΡΠ°Π½ΠΎΠ²ΠΊΠ΅ Π·Π°Π΄Π°ΡΠ° Π°ΠΊΡΡΠ°Π»ΡΠ½Π°, ΠΏΡΠ΅ΠΆΠ΄Π΅ Π²ΡΠ΅Π³ΠΎ, Π΄Π»Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΏΡΠΈ ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»Π΅ΠΏΡΠΈΠ³ΠΎΠ΄Π½ΡΡ
Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ ΠΈ ΡΠ΅Ρ
Π½ΠΈΡΠ΅ΡΠΊΠΈΡ
ΡΡΠ΅Π΄ΡΡΠ² Π΄ΠΈΠ°Π³Π½ΠΎΡΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈΡ
ΠΊΠΎΠΌΠΏΠΎΠ½Π΅Π½ΡΠΎΠ². ΠΡΠΈΠ²ΠΎΠ΄ΠΈΡΡΡ ΠΊΡΠ°ΡΠΊΠΈΠΉ ΠΎΠ±Π·ΠΎΡ ΡΠ°Π±ΠΎΡ Π² ΠΎΠ±Π»Π°ΡΡΠΈ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΈ ΠΎΠΏΠΈΡΠ°Π½ΠΈΠ΅ ΡΠΏΠΎΡΠΎΠ±ΠΎΠ² ΠΈΡ
ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ. ΠΡΠ΄Π΅Π»Π΅Π½Ρ ΠΊΠΎΠ΄Ρ, Π΄Π»Ρ ΠΊΠΎΡΠΎΡΡΡ
ΠΏΡΠΈ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½ΠΎΠ³ΠΎ Π²Π΅ΠΊΡΠΎΡΠ° Π΅Π΄ΠΈΠ½ΠΎΠΆΠ΄Ρ ΡΡΠΈΡΡΠ²Π°ΡΡΡΡ Π·Π½Π°ΡΠ΅Π½ΠΈΡ Π²ΡΠ΅Ρ
ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ°Π·ΡΡΠ΄ΠΎΠ² ΠΏΡΡΠ΅ΠΌ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈΡ
Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ ΠΈΠ»ΠΈ Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ Π²Π΅ΡΠΎΠ²ΡΡ
ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠΎΠ² ΡΠ°Π·ΡΡΠ΄ΠΎΠ², Π° ΡΠ°ΠΊΠΆΠ΅ ΠΊΠΎΠ΄Ρ, ΠΊΠΎΡΠΎΡΡΠ΅ ΡΠΎΡΠΌΠΈΡΡΡΡΡΡ ΠΏΡΠΈ ΠΏΠ΅ΡΠ²ΠΎΠ½Π°ΡΠ°Π»ΡΠ½ΠΎΠΌ ΡΠ°Π·Π±ΠΈΠ΅Π½ΠΈΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠΎΠ² Π½Π° ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π°, Π² ΡΠ°ΡΡΠ½ΠΎΡΡΠΈ Π½Π° Π΄Π²Π° ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π°. ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎ ΡΠ°ΡΡΠΈΡΠ΅Π½ΠΈΠ΅ ΠΊΠ»Π°ΡΡΠ° ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ, ΠΏΠΎΠ»ΡΡΠ°Π΅ΠΌΡΡ
Π·Π° ΡΡΠ΅Ρ Π²ΡΠ΄Π΅Π»Π΅Π½ΠΈΡ Π΄Π²ΡΡ
Π½Π΅Π·Π°Π²ΠΈΡΠΈΠΌΡΡ
ΡΠ°ΡΡΠ΅ΠΉ Π² ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠ°Ρ
, Π° ΡΠ°ΠΊΠΆΠ΅ Π²Π·Π²Π΅ΡΠΈΠ²Π°Π½ΠΈΡ ΡΠ°Π·ΡΡΠ΄ΠΎΠ² ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠΎΠ² Π½Π° ΡΡΠ°ΠΏΠ΅ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΊΠΎΠ΄Π°.
ΠΡΠΈΠ²Π΅Π΄Π΅Π½ ΠΎΠ±ΠΎΠ±ΡΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ², Π° ΡΠ°ΠΊΠΆΠ΅ ΠΎΠΏΠΈΡΠ°Π½Ρ ΠΎΡΠΎΠ±Π΅Π½Π½ΠΎΡΡΠΈ Π½Π΅ΠΊΠΎΡΠΎΡΡΡ
ΠΈΠ· ΠΊΠΎΠ΄ΠΎΠ², ΠΏΠΎΠ»ΡΡΠ΅Π½Π½ΡΡ
ΠΏΡΠΈ Π²Π·Π²Π΅ΡΠΈΠ²Π°Π½ΠΈΠΈ Π½Π΅Π΅Π΄ΠΈΠ½ΠΈΡΠ½ΡΠΌΠΈ Π²Π΅ΡΠΎΠ²ΡΠΌΠΈ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠ°ΠΌΠΈ ΠΏΠΎ ΠΎΠ΄Π½ΠΎΠΌΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠΌΡ ΡΠ°Π·ΡΡΠ΄Ρ Π² ΠΊΠ°ΠΆΠ΄ΠΎΠΌ ΠΈΠ· ΠΏΠΎΠ΄Π²Π΅ΠΊΡΠΎΡΠΎΠ², ΠΏΠΎ ΠΊΠΎΡΠΎΡΡΠΌ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΠ΅ΡΡΡ ΠΏΠΎΠ΄ΡΡΠ΅Ρ ΡΡΠΌΠΌΠ°ΡΠ½ΠΎΠ³ΠΎ Π²Π΅ΡΠ°. ΠΡΠΎΠ±ΠΎΠ΅ Π²Π½ΠΈΠΌΠ°Π½ΠΈΠ΅ ΡΠ΄Π΅Π»Π΅Π½ΠΎ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΠΌ Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΠΌ ΠΊΠΎΠ΄Π°ΠΌ Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ, Π΄Π»Ρ ΠΊΠΎΡΠΎΡΡΡ
ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΠ΅ΡΡΡ ΡΡΠΌΠΌΠ°ΡΠ½ΡΠΉ Π²Π΅Ρ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ Π²Π΅ΠΊΡΠΎΡΠ° Π² ΠΊΠΎΠ»ΡΡΠ΅ Π²ΡΡΠ΅ΡΠΎΠ² ΠΏΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ M=4. ΠΠΎΠΊΠ°Π·Π°Π½ΠΎ, ΡΡΠΎ ΡΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΠ΅ Π½Π΅ΡΠ°Π²Π½ΠΎΠΏΡΠ°Π²ΠΈΡ ΠΌΠ΅ΠΆΠ΄Ρ ΡΠ°Π·ΡΡΠ΄Π°ΠΌΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ Π²Π΅ΠΊΡΠΎΡΠ° Π² Π½Π΅ΠΊΠΎΡΠΎΡΡΡ
ΡΠ»ΡΡΠ°ΡΡ
Π΄Π°Π΅Ρ ΡΠ»ΡΡΡΠ΅Π½ΠΈΠ΅ Π² Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠ°Ρ
ΠΎΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΡ ΠΎΡΠΈΠ±ΠΎΠΊ ΠΏΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΡ Ρ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΠΌΠΈ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΠΌΠΈ ΠΊΠΎΠ΄Π°ΠΌΠΈ. ΠΠΏΠΈΡΡΠ²Π°ΡΡΡΡ Π½Π΅ΠΊΠΎΡΠΎΡΡΠ΅ ΠΌΠΎΠ΄ΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Π½ΡΡ
Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ². ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΡΠΏΠΎΡΠΎΠ± ΠΏΠΎΠ΄ΡΡΠ΅ΡΠ° ΠΎΠ±ΡΠ΅Π³ΠΎ ΡΠΈΡΠ»Π° Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
ΠΎΡΠΈΠ±ΠΎΠΊ Π² Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
ΠΊΠΎΠ΄Π°Ρ
Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π² ΠΊΠΎΠ»ΡΡΠ΅ Π²ΡΡΠ΅ΡΠΎΠ² ΠΏΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ M=4 Ρ ΠΎΠ΄Π½ΠΈΠΌ Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΠΌ ΡΠ°Π·ΡΡΠ΄ΠΎΠΌ Π² ΠΊΠ°ΠΆΠ΄ΠΎΠΌ ΠΈΠ· ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ². ΠΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΠΏΠΎΠ΄ΡΠΎΠ±Π½ΡΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΎΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΡ ΠΎΡΠΈΠ±ΠΎΠΊ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΡΠΌΠΈ ΠΊΠΎΠ΄Π°ΠΌΠΈ ΠΊΠ°ΠΊ ΠΏΠΎ ΠΊΡΠ°ΡΠ½ΠΎΡΡΡΠΌ Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
ΠΎΡΠΈΠ±ΠΎΠΊ, ΡΠ°ΠΊ ΠΈ ΠΏΠΎ ΠΈΡ
Π²ΠΈΠ΄Π°ΠΌ (ΠΌΠΎΠ½ΠΎΡΠΎΠ½Π½ΡΠ΅, ΡΠΈΠΌΠΌΠ΅ΡΡΠΈΡΠ½ΡΠ΅ ΠΈ Π°ΡΠΈΠΌΠΌΠ΅ΡΡΠΈΡΠ½ΡΠ΅ ΠΎΡΠΈΠ±ΠΊΠΈ). ΠΡΠΎΠ²Π΅Π΄Π΅Π½ΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΠ΅ Ρ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΠΌΠΈ ΠΊΠΎΠ΄Π°ΠΌΠΈ. ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΡΠΏΠΎΡΠΎΠ± ΡΠΈΠ½ΡΠ΅Π·Π° ΠΊΠΎΠ΄Π΅ΡΠΎΠ² Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π½Π° ΡΡΠ°Π½Π΄Π°ΡΡΠ½ΠΎΠΉ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠ½ΠΎΠΉ Π±Π°Π·Π΅ ΡΡΠΌΠΌΠ°ΡΠΎΡΠΎΠ² Π΅Π΄ΠΈΠ½ΠΈΡΠ½ΡΡ
ΡΠΈΠ³Π½Π°Π»ΠΎΠ². ΠΠ°Π½Π° ΠΊΠ»Π°ΡΡΠΈΡΠΈΠΊΠ°ΡΠΈΡ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ
ΠΠ²ΡΡ ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΠ΅ Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΠ΅ ΠΊΠΎΠ΄Ρ Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π² ΠΊΠΎΠ»ΡΡΠ΅ Π²ΡΡΠ΅ΡΠΎΠ² ΠΏΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ M=4
ΠΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Ρ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΠΎΡΠΎΠ±Π΅Π½Π½ΠΎΡΡΠ΅ΠΉ ΠΎΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΡ ΠΎΡΠΈΠ±ΠΎΠΊ Π² ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠ°Ρ
ΠΊΠΎΠ΄Π°ΠΌΠΈ Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ. Π ΡΠ°ΠΊΠΎΠΉ ΠΏΠΎΡΡΠ°Π½ΠΎΠ²ΠΊΠ΅ Π·Π°Π΄Π°ΡΠ° Π°ΠΊΡΡΠ°Π»ΡΠ½Π°, ΠΏΡΠ΅ΠΆΠ΄Π΅ Π²ΡΠ΅Π³ΠΎ, Π΄Π»Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΏΡΠΈ ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»Π΅ΠΏΡΠΈΠ³ΠΎΠ΄Π½ΡΡ
Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ ΠΈ ΡΠ΅Ρ
Π½ΠΈΡΠ΅ΡΠΊΠΈΡ
ΡΡΠ΅Π΄ΡΡΠ² Π΄ΠΈΠ°Π³Π½ΠΎΡΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈΡ
ΠΊΠΎΠΌΠΏΠΎΠ½Π΅Π½ΡΠΎΠ². ΠΡΠΈΠ²ΠΎΠ΄ΠΈΡΡΡ ΠΊΡΠ°ΡΠΊΠΈΠΉ ΠΎΠ±Π·ΠΎΡ ΡΠ°Π±ΠΎΡ Π² ΠΎΠ±Π»Π°ΡΡΠΈ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΈ ΠΎΠΏΠΈΡΠ°Π½ΠΈΠ΅ ΡΠΏΠΎΡΠΎΠ±ΠΎΠ² ΠΈΡ
ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ. ΠΡΠ΄Π΅Π»Π΅Π½Ρ ΠΊΠΎΠ΄Ρ, Π΄Π»Ρ ΠΊΠΎΡΠΎΡΡΡ
ΠΏΡΠΈ ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½ΠΎΠ³ΠΎ Π²Π΅ΠΊΡΠΎΡΠ° Π΅Π΄ΠΈΠ½ΠΎΠΆΠ΄Ρ ΡΡΠΈΡΡΠ²Π°ΡΡΡΡ Π·Π½Π°ΡΠ΅Π½ΠΈΡ Π²ΡΠ΅Ρ
ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ°Π·ΡΡΠ΄ΠΎΠ² ΠΏΡΡΠ΅ΠΌ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈΡ
Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ ΠΈΠ»ΠΈ Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ Π²Π΅ΡΠΎΠ²ΡΡ
ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠΎΠ² ΡΠ°Π·ΡΡΠ΄ΠΎΠ², Π° ΡΠ°ΠΊΠΆΠ΅ ΠΊΠΎΠ΄Ρ, ΠΊΠΎΡΠΎΡΡΠ΅ ΡΠΎΡΠΌΠΈΡΡΡΡΡΡ ΠΏΡΠΈ ΠΏΠ΅ΡΠ²ΠΎΠ½Π°ΡΠ°Π»ΡΠ½ΠΎΠΌ ΡΠ°Π·Π±ΠΈΠ΅Π½ΠΈΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠΎΠ² Π½Π° ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π°, Π² ΡΠ°ΡΡΠ½ΠΎΡΡΠΈ Π½Π° Π΄Π²Π° ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π°. ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎ ΡΠ°ΡΡΠΈΡΠ΅Π½ΠΈΠ΅ ΠΊΠ»Π°ΡΡΠ° ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ, ΠΏΠΎΠ»ΡΡΠ°Π΅ΠΌΡΡ
Π·Π° ΡΡΠ΅Ρ Π²ΡΠ΄Π΅Π»Π΅Π½ΠΈΡ Π΄Π²ΡΡ
Π½Π΅Π·Π°Π²ΠΈΡΠΈΠΌΡΡ
ΡΠ°ΡΡΠ΅ΠΉ Π² ΠΊΠΎΠ½ΡΡΠΎΠ»ΡΠ½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠ°Ρ
, Π° ΡΠ°ΠΊΠΆΠ΅ Π²Π·Π²Π΅ΡΠΈΠ²Π°Π½ΠΈΡ ΡΠ°Π·ΡΡΠ΄ΠΎΠ² ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠΎΠ² Π½Π° ΡΡΠ°ΠΏΠ΅ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΊΠΎΠ΄Π°.
ΠΡΠΈΠ²Π΅Π΄Π΅Π½ ΠΎΠ±ΠΎΠ±ΡΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ², Π° ΡΠ°ΠΊΠΆΠ΅ ΠΎΠΏΠΈΡΠ°Π½Ρ ΠΎΡΠΎΠ±Π΅Π½Π½ΠΎΡΡΠΈ Π½Π΅ΠΊΠΎΡΠΎΡΡΡ
ΠΈΠ· ΠΊΠΎΠ΄ΠΎΠ², ΠΏΠΎΠ»ΡΡΠ΅Π½Π½ΡΡ
ΠΏΡΠΈ Π²Π·Π²Π΅ΡΠΈΠ²Π°Π½ΠΈΠΈ Π½Π΅Π΅Π΄ΠΈΠ½ΠΈΡΠ½ΡΠΌΠΈ Π²Π΅ΡΠΎΠ²ΡΠΌΠΈ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠ°ΠΌΠΈ ΠΏΠΎ ΠΎΠ΄Π½ΠΎΠΌΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠΌΡ ΡΠ°Π·ΡΡΠ΄Ρ Π² ΠΊΠ°ΠΆΠ΄ΠΎΠΌ ΠΈΠ· ΠΏΠΎΠ΄Π²Π΅ΠΊΡΠΎΡΠΎΠ², ΠΏΠΎ ΠΊΠΎΡΠΎΡΡΠΌ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΠ΅ΡΡΡ ΠΏΠΎΠ΄ΡΡΠ΅Ρ ΡΡΠΌΠΌΠ°ΡΠ½ΠΎΠ³ΠΎ Π²Π΅ΡΠ°. ΠΡΠΎΠ±ΠΎΠ΅ Π²Π½ΠΈΠΌΠ°Π½ΠΈΠ΅ ΡΠ΄Π΅Π»Π΅Π½ΠΎ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΠΌ Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΠΌ ΠΊΠΎΠ΄Π°ΠΌ Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ, Π΄Π»Ρ ΠΊΠΎΡΠΎΡΡΡ
ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΠ΅ΡΡΡ ΡΡΠΌΠΌΠ°ΡΠ½ΡΠΉ Π²Π΅Ρ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ Π²Π΅ΠΊΡΠΎΡΠ° Π² ΠΊΠΎΠ»ΡΡΠ΅ Π²ΡΡΠ΅ΡΠΎΠ² ΠΏΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ M=4. ΠΠΎΠΊΠ°Π·Π°Π½ΠΎ, ΡΡΠΎ ΡΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΠ΅ Π½Π΅ΡΠ°Π²Π½ΠΎΠΏΡΠ°Π²ΠΈΡ ΠΌΠ΅ΠΆΠ΄Ρ ΡΠ°Π·ΡΡΠ΄Π°ΠΌΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ Π²Π΅ΠΊΡΠΎΡΠ° Π² Π½Π΅ΠΊΠΎΡΠΎΡΡΡ
ΡΠ»ΡΡΠ°ΡΡ
Π΄Π°Π΅Ρ ΡΠ»ΡΡΡΠ΅Π½ΠΈΠ΅ Π² Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠ°Ρ
ΠΎΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΡ ΠΎΡΠΈΠ±ΠΎΠΊ ΠΏΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΡ Ρ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΠΌΠΈ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΠΌΠΈ ΠΊΠΎΠ΄Π°ΠΌΠΈ. ΠΠΏΠΈΡΡΠ²Π°ΡΡΡΡ Π½Π΅ΠΊΠΎΡΠΎΡΡΠ΅ ΠΌΠΎΠ΄ΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Π½ΡΡ
Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ². ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΡΠΏΠΎΡΠΎΠ± ΠΏΠΎΠ΄ΡΡΠ΅ΡΠ° ΠΎΠ±ΡΠ΅Π³ΠΎ ΡΠΈΡΠ»Π° Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
ΠΎΡΠΈΠ±ΠΎΠΊ Π² Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
ΠΊΠΎΠ΄Π°Ρ
Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π² ΠΊΠΎΠ»ΡΡΠ΅ Π²ΡΡΠ΅ΡΠΎΠ² ΠΏΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ M=4 Ρ ΠΎΠ΄Π½ΠΈΠΌ Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΠΌ ΡΠ°Π·ΡΡΠ΄ΠΎΠΌ Π² ΠΊΠ°ΠΆΠ΄ΠΎΠΌ ΠΈΠ· ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ². ΠΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΠΏΠΎΠ΄ΡΠΎΠ±Π½ΡΠ΅ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΎΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΡ ΠΎΡΠΈΠ±ΠΎΠΊ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΡΠΌΠΈ ΠΊΠΎΠ΄Π°ΠΌΠΈ ΠΊΠ°ΠΊ ΠΏΠΎ ΠΊΡΠ°ΡΠ½ΠΎΡΡΡΠΌ Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
ΠΎΡΠΈΠ±ΠΎΠΊ, ΡΠ°ΠΊ ΠΈ ΠΏΠΎ ΠΈΡ
Π²ΠΈΠ΄Π°ΠΌ (ΠΌΠΎΠ½ΠΎΡΠΎΠ½Π½ΡΠ΅, ΡΠΈΠΌΠΌΠ΅ΡΡΠΈΡΠ½ΡΠ΅ ΠΈ Π°ΡΠΈΠΌΠΌΠ΅ΡΡΠΈΡΠ½ΡΠ΅ ΠΎΡΠΈΠ±ΠΊΠΈ). ΠΡΠΎΠ²Π΅Π΄Π΅Π½ΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΠ΅ Ρ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΠΌΠΈ ΠΊΠΎΠ΄Π°ΠΌΠΈ. ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΡΠΏΠΎΡΠΎΠ± ΡΠΈΠ½ΡΠ΅Π·Π° ΠΊΠΎΠ΄Π΅ΡΠΎΠ² Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Π½Π° ΡΡΠ°Π½Π΄Π°ΡΡΠ½ΠΎΠΉ ΡΠ»Π΅ΠΌΠ΅Π½ΡΠ½ΠΎΠΉ Π±Π°Π·Π΅ ΡΡΠΌΠΌΠ°ΡΠΎΡΠΎΠ² Π΅Π΄ΠΈΠ½ΠΈΡΠ½ΡΡ
ΡΠΈΠ³Π½Π°Π»ΠΎΠ². ΠΠ°Π½Π° ΠΊΠ»Π°ΡΡΠΈΡΠΈΠΊΠ°ΡΠΈΡ Π΄Π²ΡΡ
ΠΌΠΎΠ΄ΡΠ»ΡΠ½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ
Π‘ΠΏΠΎΡΠΎΠ± ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΡΠ΅ΠΌΠ΅ΠΉΡΡΠ²Π° ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Ρ Π½Π°ΠΈΠΌΠ΅Π½ΡΡΠΈΠΌ ΠΎΠ±ΡΠΈΠΌ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²ΠΎΠΌ Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ ΠΎΡΠΈΠ±ΠΎΠΊ Π² ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ Π²Π΅ΠΊΡΠΎΡΠ°Ρ
The research results of the methods for formation of separable sum codes with the minimum number of undetectable errors in data vectors are presented. A formula for counting the number of undetectable errors in data vectors and codes family properties are given. A universal method for formation of such codes is shown, which makes it possible for each value of the data vector length to obtain a whole family of codes that also have different distributions of undetectable errors by type and multiplicity. An example of codes formation, methods for analyzing characteristics, code comparison are presented. A method for synthesizing coders of developed sum codes is suggested.Β ΠΠ·Π»ΠΎΠΆΠ΅Π½Ρ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠΉ ΡΠΏΠΎΡΠΎΠ±ΠΎΠ² ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΡΠ°Π·Π΄Π΅Π»ΠΈΠΌΡΡ
ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ Ρ Π½Π°ΠΈΠΌΠ΅Π½ΡΡΠΈΠΌ ΠΎΠ±ΡΠΈΠΌ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²ΠΎΠΌ Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
ΠΎΡΠΈΠ±ΠΎΠΊ Π² ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠ°Ρ
. ΠΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΡΠΎΡΠΌΡΠ»Ρ ΠΏΠΎΠ΄ΡΡΠ΅ΡΠ° ΡΠΈΡΠ»Π° Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
ΠΎΡΠΈΠ±ΠΎΠΊ Π² ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
Π²Π΅ΠΊΡΠΎΡΠ°Ρ
ΠΈ ΡΠ²ΠΎΠΉΡΡΠ²Π° Π΄Π°Π½Π½ΠΎΠ³ΠΎ ΠΊΠ»Π°ΡΡΠ° ΠΊΠΎΠ΄ΠΎΠ². ΠΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ ΡΠ½ΠΈΠ²Π΅ΡΡΠ°Π»ΡΠ½ΡΠΉ ΡΠΏΠΎΡΠΎΠ± ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΡΠ°ΠΊΠΈΡ
ΠΊΠΎΠ΄ΠΎΠ², Π΄Π°ΡΡΠΈΠΉ Π΄Π»Ρ ΠΊΠ°ΠΆΠ΄ΠΎΠ³ΠΎ Π·Π½Π°ΡΠ΅Π½ΠΈΡ Π΄Π»ΠΈΠ½Ρ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ Π²Π΅ΠΊΡΠΎΡΠ° Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΡ ΠΏΠΎΠ»ΡΡΠ΅Π½ΠΈΡ ΡΠ΅Π»ΠΎΠ³ΠΎ ΡΠ΅ΠΌΠ΅ΠΉΡΡΠ²Π° ΠΊΠΎΠ΄ΠΎΠ², ΠΎΠ±Π»Π°Π΄Π°ΡΡΠΈΡ
ΠΊ ΡΠΎΠΌΡ ΠΆΠ΅ ΡΠ°Π·Π»ΠΈΡΠ½ΡΠΌΠΈ ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡΠΌΠΈ Π½Π΅ΠΎΠ±Π½Π°ΡΡΠΆΠΈΠ²Π°Π΅ΠΌΡΡ
ΠΎΡΠΈΠ±ΠΎΠΊ ΠΏΠΎ Π²ΠΈΠ΄Π°ΠΌ ΠΈ ΠΊΡΠ°ΡΠ½ΠΎΡΡΡΠΌ. ΠΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΠΏΡΠΈΠΌΠ΅ΡΡ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΊΠΎΠ΄ΠΎΠ², ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ»ΠΎΠ³ΠΈΡ Π°Π½Π°Π»ΠΈΠ·Π° ΠΈΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ, Π° ΡΠ°ΠΊΠΆΠ΅ Π΄Π°Π½ΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΠ΅ ΠΊΠΎΠ΄ΠΎΠ² ΠΌΠ΅ΠΆΠ΄Ρ ΡΠΎΠ±ΠΎΠΉ. ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΠΌΠ΅ΡΠΎΠ΄ ΡΠΈΠ½ΡΠ΅Π·Π° ΠΊΠΎΠ΄Π΅ΡΠΎΠ² ΡΠ°Π·ΡΠ°Π±ΠΎΡΠ°Π½Π½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ² Ρ ΡΡΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ
- β¦