Systems, apparatus, and methods for fast polynomial divided by monomial

By calculating the wrongly positioned polynomial in the initial stage and updating it after each frame is successfully decoded, the resource density and delay increase problems caused by frequent recalculating of polynomials in GCC encoding are solved, and the decoding efficiency and resource utilization are improved.

CN118944683APending Publication Date: 2024-11-12SAMSUNG ELECTRONICS CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410399606.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2023-05-12
Filing Date
2024-04-03
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

When using the SPolar generalized cascading code (GCC) encoding scheme for Reed-Solomon (RS) decoding, frequent recalculation of the mislocalized polynomial (ELP) results in resource intensiveness and increased latency, affecting decoding efficiency.

Method used

It is proposed to calculate the wrong positioning polynomials of all frames to be decoded in the initial stage, and update the polynomials after each frame is successfully decoded. By simultaneously calculating multiple update coefficients to maintain the polynomials in the entire decoding process, redundant multiplication operations are reduced.

Benefits of technology

Improve decoding efficiency, reduce the delay of RS decoding operations, and improve resource utilization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118944683A_ABST
    Figure CN118944683A_ABST
Patent Text Reader

Abstract

Systems, devices, and methods for decoding codewords obtained from a storage device are disclosed. The method includes: obtaining a codeword from among a plurality of codewords stored in a storage device, wherein the codeword includes a plurality of frames; obtaining an initial error location polynomial (ELP) corresponding to the codeword; decoding a frame of the plurality of frames; based on determining that the frame is successfully decoded, determining an updated ELP based on the initial ELP and information about the frame; and obtaining an information bit corresponding to the codeword based on the updated ELP, where the updated ELP includes a plurality of updated coefficients, and where the updated ELP is determined by simultaneously calculating at least two updated coefficients among the plurality of updated coefficients.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Apparatus and methods consistent with embodiments relate to processes for performing error correction encoding, and more particularly, to maintaining an error locator polynomial throughout a decoding process. Background Art

[0002] The data storage component may use an error correction code (ECC) to correct data corruption that may occur in the memory. Some types of ECC coding (e.g., ECC coding using the SPolar generalized concatenated code (GCC) coding scheme) may use Reed-Solomon (RS) decoding as part of the decoding process. In RS decoding, an error locator polynomial (ELP) may be used to determine the location of errors in a codeword. The ELP may be a polynomial in which a coefficient equal to zero may indicate the location of an erroneous symbol for which RS decoding failed.

[0003] In the initial stage of RS decoding, the root of ELP can indicate all known failed symbols, which can also be called erasure. The initial value of ELP can be established based on the known error locations.

[0004] In the GCC coding scheme, a symbol can be referred to as frame j. For example, for each frame j for which RS decoding fails, the ELP can be multiplied by the monomial (1-α j x). After constructing the ELP in this way, α j A zero in may indicate an error in frame j.

[0005] The GCC decoding process may include performing several RS decoding iterations for each GCC codeword. As a result, recalculating the ELP after each decoded frame or each decoded frame block may be very resource intensive. Therefore, it may be beneficial to calculate the initial ELP at a very early stage, considering all frames to be decoded as erasures, and then maintain the ELP throughout the decoding process by updating the ELP after each frame is successfully decoded. Summary of the invention

[0006] According to an aspect of one or more embodiments, a storage system includes: a storage device configured to store multiple codewords; and at least one processor configured to: obtain a codeword from the multiple codewords from the storage device, wherein the codeword includes multiple frames; obtain an initial error locator polynomial (ELP) corresponding to the codeword; decode a frame among the multiple frames; based on determining that the frame is successfully decoded, determine an updated ELP based on the initial ELP and information about the frame; and obtain information bits corresponding to the codeword based on the updated ELP, wherein the updated ELP includes multiple updated coefficients, wherein the at least one processor is further configured to determine the updated ELP by simultaneously calculating at least two updated coefficients among the multiple updated coefficients.

[0007] According to an aspect of one or more embodiments, a device for decoding a codeword comprising multiple frames includes at least one processor, which is configured to: obtain an initial error locator polynomial (ELP) corresponding to the codeword; decode a frame among the multiple frames; based on determining that the frame is successfully decoded, determine an updated ELP by simultaneously calculating at least two updated coefficients among multiple updated coefficients included in the updated ELP; and obtain information bits corresponding to the codeword based on the updated ELP.

[0008] According to an aspect of one or more embodiments, a method for controlling a storage system is performed by at least one processor and includes: obtaining a codeword from a storage device, wherein the codeword includes multiple frames; obtaining an initial error locator polynomial (ELP) corresponding to the codeword; decoding a frame among the multiple frames; based on determining that the frame is successfully decoded, determining an updated ELP based on the initial ELP and information about the frame; and obtaining information bits corresponding to the codeword based on the updated ELP, wherein the updated ELP includes multiple updated coefficients, and wherein the updated ELP is determined by simultaneously calculating at least two updated coefficients among the multiple updated coefficients.

[0009] According to an aspect of one or more embodiments, a method for decoding a codeword is performed by at least one processor and includes: obtaining an initial error locator polynomial (ELP) corresponding to the codeword, wherein the codeword includes multiple frames; decoding a frame among the multiple frames; based on determining that the frame is successfully decoded, determining an updated ELP by simultaneously calculating at least two updated coefficients among multiple updated coefficients included in the updated ELP; and obtaining information bits corresponding to the codeword based on the updated ELP. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The above and other aspects, features and advantages of certain embodiments of the present disclosure will become more apparent from the following description in conjunction with the accompanying drawings, in which:

[0011] Figure 1 is a block diagram of a computer system according to an embodiment;

[0012] Figure 2A is a block diagram of a host storage system according to an embodiment;

[0013] Figure 2B is a block diagram of an ECC engine according to an embodiment;

[0014] Figure 2C is a block diagram of an ECC encoding circuit according to an embodiment;

[0015] Figure 2D is a block diagram of an ECC decoding circuit according to an embodiment;

[0016] Figure 2E is a block diagram of an AES engine according to an embodiment;

[0017] Figure 3 is a block diagram of a memory system according to an embodiment;

[0018] Figure 4 is a block diagram of a memory device according to an embodiment.

[0019] Figure 5 is a block diagram of a UFS system according to an embodiment.

[0020] Figure 6 is a block diagram of a division module according to an embodiment.

[0021] Figure 7 is a block diagram of a division module according to an embodiment.

[0022] Figure 8 is a block diagram of two division modules operating in parallel according to an embodiment.

[0023] Fig. 9 is a flowchart of a process of controlling a storage system according to an embodiment.

[0024] Fig.10 is a block diagram of a data center according to an embodiment. DETAILED DESCRIPTION

[0025] As mentioned above, some types of error correction code (ECC) encoding schemes (such as ECC encoding using the SPolar generalized concatenated code (GCC) encoding scheme) can use Reed-Solomon (RS) decoding as part of the decoding process. For example, in a GCC encoding scheme, a GCC codeword may include j frames, which can be decoded using RS decoding. The error locator polynomial (ELP) used to determine the location of errors in the codeword can be obtained by substituting all monomials (1-α jx) (where j=0, ..., (N-1)) by multiplying. The initial degree of the ELP may be N, and the number of coefficients of the ELP may be derived from N.

[0026] In an embodiment, constructing the ELP in this way may be very inefficient. For example, in the SPolar GCC decoding process, each GCC codeword may require multiple RS decoding iterations. Therefore, if the ELP must be recalculated before each RS decoding iteration, many redundant multiplication operations may be performed and significant delay may be added to the RS decoding operation.

[0027] Accordingly, an embodiment may provide a method for generating ELP by obtaining an initial ELP including all possible error positions, which may also be referred to as deletion. For example, in a GCC codeword in which multiple frames have not yet been decoded, the initial ELP may indicate that all multiple frames are error positions. Then, after each frame is successfully decoded, the initial ELP may be divided by the monomial corresponding to the decoded frame. ELP may be maintained in this way throughout the GCC decoding process, which may allow for improved decoding efficiency by eliminating the need to calculate ELP before each RS decoding. In addition, an embodiment may provide a method for accelerating the division calculation by simultaneously calculating multiple coefficients of ELP. For example, an embodiment may provide a method for calculating the highest order coefficient of ELP while simultaneously calculating the lowest order coefficient of ELP, and then proceeding sequentially from both ends of ELP until all coefficients are calculated.

[0028] Figure 1 is a diagram of a system 1000 in which embodiments may be applied. For example, Figure 1 The system 1000 may be a mobile system such as a portable communication terminal (eg, a mobile phone), a smart phone, a tablet personal computer (PC), a wearable device, a healthcare device, or an Internet of things (IOT) device. Figure 1 The system 1000 is not necessarily limited to a mobile system and may be a PC, a laptop, a server, a media player, or an automotive device (eg, a navigation device).

[0029] Reference Figure 1 , the system 1000 may include a main processor 1100, a memory (e.g., 1200a and 1200b), and a storage device (e.g., 1300a and 1300b). In addition, the system 1000 may include at least one of an image capture device 1410, a user input device 1420, a sensor 1430, a communication device 1440, a display 1450, a speaker 1460, a power supply device 1470, and a connection interface 1480.

[0030] The main processor 1100 may control all operations of the system 1000, and more specifically, may control operations of other components included in the system 1000. The main processor 1100 may be implemented as a general-purpose processor, a dedicated processor, or an application processor.

[0031] The main processor 1100 may include at least one CPU core 1110, and also include a controller 1120 configured to control memories 1200a and 1200b and / or storage devices 1300a and 1300b. In some embodiments, the main processor 1100 may also include an accelerator 1130, which is a dedicated circuit for high-speed data operations such as artificial intelligence (AI) data operations. The accelerator 1130 may include a graphics processing unit (GPU), a neural processing unit (NPU), and / or a data processing unit (DPU), and is implemented as a chip physically separated from other components of the main processor 1100.

[0032] Memories 1200a and 1200b may be used as main memory devices of system 1000. Although each of memories 1200a and 1200b may include volatile memory, such as static random access memory (SRAM) and / or dynamic RAM (DRAM), each of memories 1200a and 1200b may also include non-volatile memory, such as flash memory, phase-change RAM (PRAM) and / or resistive RAM (RRAM). Memories 1200a and 1200b may be implemented in the same package as main processor 1100.

[0033] The storage devices 1300a and 1300b may be used as non-volatile storage devices configured to store data regardless of whether power is supplied thereto, and have a larger storage capacity than the memories 1200a and 1200b. The storage devices 1300a and 1300b may include storage controllers (storage controller, STRG CTRL) 1310a and 1310b, respectively, and non-volatile memories (Non-Volatile Memory, NVM) 1320a and 1320b configured to store data via the control of the storage controllers 1310a and 1310b. Although the NVMs 1320a and 1320b may include flash memories having a two-dimensional (2D) structure or a three-dimensional (3D) V-NAND structure, the embodiment is not limited thereto, and the NVMs 1320a and 1320b may include other types of NVMs, such as PRAM and / or RRAM.

[0034] The storage devices 1300a and 1300b may be physically separated from the main processor 1100 and included in the system 1000, or implemented in the same package as the main processor 1100. In addition, the storage devices 1300a and 1300b may have various types of SSDs or memory cards, and may be removably combined with other components of the system 100 through an interface (such as the connection interface 1480 described below). The storage devices 1300a and 1300b may be devices to which standard protocols such as universal flash storage (UFS), embedded multi-media card (eMMC), or high-speed non-volatile memory express (NVMe) are applied, but are not limited thereto.

[0035] The image capture device 1410 may capture still images or moving images. The image capture device 1410 may include a still camera, a video camera, and / or a webcam.

[0036] The user input device 1420 may receive various types of data input by a user of the system 1000 and include a touch pad, a keypad, a keyboard, a mouse, and / or a microphone.

[0037] The sensor 1430 may detect various types of physical quantities that may be obtained from the outside of the system 1000 and convert the detected physical quantities into electrical signals. The sensor 1430 may include a temperature sensor, a pressure sensor, an illumination sensor, a position sensor, an acceleration sensor, a biosensor, and / or a gyro sensor.

[0038] The communication device 1440 may transmit and receive signals between other devices outside the system 1000 according to various communication protocols. The communication device 1440 may include an antenna, a transceiver, and / or a modem.

[0039] Display 1450 and speaker 1460 may be used as output devices configured to output visual information and auditory information, respectively, to a user of system 1000 .

[0040] The power supply device 1470 may appropriately convert power supplied from a battery (not shown) embedded in the system 1000 and / or an external power source, and supply the converted power to each component of the system 1000 .

[0041] The connection interface 1480 may provide a connection between the system 1000 and an external device that is connected to the system 1000 and is capable of sending and receiving data to and from the system 1000. The connection interface 1480 may be implemented by using various interface schemes, such as advanced technology attachment (ATA), serial ATA (SATA), external SATA (e-SATA), small computer small interface (SCSI), serial attached SCSI (SAS), peripheral component interconnection (PCI), PCI express (PCIe), NVMe, IEEE 1394, universal serial bus (USB) interface, secure digital (SD) card interface, multi-media card (MMC) interface, eMMC interface, UFS interface, embedded UFS (eUFS) interface, and compact flash (CF) card interface.

[0042] Figure 2A is a block diagram of a host storage system 10 according to an example embodiment.

[0043] The host storage system 10 may include a host 100 and a storage device 200. In addition, the storage device 200 may include a storage controller 210 and an NVM 220. According to an example embodiment, the host 100 may include a host controller 110 and a host memory 120. The host memory 120 may be used as a buffer memory configured to temporarily store data to be transmitted to the storage device 200 or data received from the storage device 200.

[0044] The storage device 200 may include a storage medium configured to store data in response to a request from the host 100. As an example, the storage device 200 may include at least one of an SSD, an embedded memory, and a removable external memory. When the storage device 200 is an SSD, the storage device 200 may be a device that complies with the NVMe standard. When the storage device 200 is an embedded memory or an external memory, the storage device 200 may be a device that complies with the UFS standard or the eMMC standard. Each of the host 100 and the storage device 200 may generate a packet and send the packet according to the adopted standard protocol.

[0045] When the NVM 220 of the storage device 200 includes a flash memory, the flash memory may include a 2D NAND memory array or a 3D (or vertical) NAND (vertical NAND, VNAND) memory array. As another example, the storage device 200 may include various other types of NVM. For example, the storage device 200 may include magnetic RAM (magnetic RAM, MRAM), spin transfer torque MRAM, conductive bridging RAM (conductive bridging RAM, CBRAM), ferroelectric RAM (ferroelectric RAM, FRAM), PRAM, RRAM, and various other types of memory.

[0046] According to an embodiment, the host controller 110 and the host memory 120 may be implemented as separate semiconductor chips. Alternatively, in some embodiments, the host controller 110 and the host memory 120 may be integrated in the same semiconductor chip. As an example, the host controller 110 may be any one of a plurality of modules included in an application processor (AP). The AP may be implemented as a system on chip (SoC). In addition, the host memory 120 may be an embedded memory included in the AP or an NVM or memory module located outside the AP.

[0047] The host controller 110 may manage an operation of storing data (eg, write data) of a buffer of the host memory 120 in the NVM 220 or an operation of storing data (eg, read data) of the NVM 220 in a buffer.

[0048] The storage controller 210 may include a host interface 211, a memory interface 212, and a CPU 213. In addition, the storage controller 210 may further include a flash translation layer (FTL) 214, a packet manager 215, a buffer memory 216, an error correction code (ECC) engine 217, and an advanced encryption standard (AES) engine 218. The storage controller 210 may further include a working memory (not shown) in which the FTL 214 is loaded. The CPU 213 may execute the FTL 214 to control data write and read operations on the NVM 220.

[0049] The host interface 211 may send packets to and receive packets from the host 100. The packets sent from the host 100 to the host interface 211 may include commands or data to be written to the NVM 220. The packets sent from the host interface 211 to the host 100 may include responses to commands or data read from the NVM 220. The memory interface 212 may send data to be written to the NVM 220 to the NVM 220, or receive data read from the NVM 220. The memory interface 212 may be configured to comply with a standard protocol, such as Toggle or an open NAND flash interface (ONFI).

[0050] The FTL 214 may perform various functions such as an address mapping operation, a wear leveling operation, and a garbage collection operation. The address mapping operation may be an operation of converting a logical address received from the host 100 into a physical address for actually storing data in the NVM 220. The wear leveling operation may be a technique for preventing excessive deterioration of a particular block by allowing the blocks of the NVM 220 to be evenly used. As an example, the wear leveling operation may be implemented using a firmware technique for balancing the erase counts of physical blocks. The garbage collection operation may be a technique for ensuring available capacity in the NVM 220 by erasing an existing block after copying valid data of the existing block to a new block.

[0051] The packet manager 215 may generate a packet according to an interface protocol agreed to by the host 100, or parse various types of information from a packet received from the host 100. In addition, the buffer memory 216 may temporarily store data to be written to or read from the NVM 220. Although the buffer memory 216 may be a component included in the storage controller 210, the buffer memory 216 may be outside the storage controller 210.

[0052] The ECC engine 217 may perform error detection and correction operations on read data read from the NVM 220. More specifically, the ECC engine 217 may generate parity bits for write data to be written to the NVM 220, and the generated parity bits may be stored together with the write data in the NVM 220. During reading of data from the NVM 220, the ECC engine 217 may correct errors in the read data by using the parity bits read from the NVM 220 and the read data, and output the error-corrected read data.

[0053] The AES engine 218 may perform at least one of an encryption operation and a decryption operation on data input to the memory controller 210 by using a symmetric key algorithm.

[0054] Figure 2B yes Figure 2A Detailed diagram of the ECC engine 217. Figure 2B , the ECC engine 217 may include an ECC encoding circuit 510 and an ECC decoding circuit 520. In response to the ECC control signal ECC_CON, the ECC encoding circuit 510 may generate parity bits ECCP[0:7] for write data WData[0:63] to be written to memory cells of the memory cell array 221. The parity bits ECCP[0:7] may be stored in the ECC cell array 223. According to an embodiment, in response to the ECC control signal ECC_CON, the ECC encoding circuit 510 may generate parity bits ECCP[0:7] for write data WData[0:63] to be written to memory cells including defective cells of the memory cell array 221.

[0055] In response to the ECC control signal ECC_CON, the ECC decoding circuit 520 may correct the error bit data by using the read data RData[0:63] read from the memory cells of the memory cell array 221 and the parity bits ECCP[0:7] read from the ECC cell array 223, and output the error-corrected data Data[0:63]. According to an embodiment, in response to the ECC control signal ECC_CON, the ECC decoding circuit 520 may correct the error bit data by using the read data RData[0:63] read from the memory cells including the defective cells of the memory cell array 221 and the parity bits ECCP[0:7] read from the ECC cell array 223, and output the error-corrected data Data[0:63].

[0056] Figure 2C yes Figure 2B FIG. 5 is a diagram of an ECC encoding circuit 510 .

[0057] Reference Figure 2C , the ECC encoding circuit 510 may include a parity generator 511, which receives the 64-bit write data WData[0:63] and the basic bits B[0:7] in response to the ECC control signal ECC_CON, and generates the parity bits ECCP[0:7] by using an XOR array operation. The basic bits B[0:7] may be bits for generating the parity bits ECCP[0:7] for the 64-bit write data WData[0:63], for example, b'00000000 bits. The basic bits B[0:7] may use other specific bits instead of the b'00000000 bits.

[0058] Figure 2D yes Figure 2B FIG. 5 is a diagram of an ECC decoding circuit 520 .

[0059] Reference Figure 2D, the ECC decoding circuit 520 may include a syndrome generator 521, a coefficient calculator 522, a 1-bit error position detector 523, and an error corrector 524. The syndrome generator 521 may receive 64-bit read data and 8-bit parity bits ECCP[0:7] in response to the ECC control signal ECC_CON, and generate syndrome data S[0:7] by using an XOR array operation. The coefficient calculator 522 may calculate the coefficients of the error position equation by using the syndrome data S[0:7]. The error position equation may be an equation with the inverse of the error bit as a root. The 1-bit error position detector 523 may calculate the position of the 1-bit error by using the calculated error position equation. The error corrector 524 may determine the position of the 1-bit error based on the detection result of the 1-bit error position detector 523. The error corrector 524 may correct the error by inverting the logic value of the bit where the error occurs among the 64-bit read data RData[0:63] based on the determined 1-bit error position information, and output the error-corrected 64-bit data Data[0:63].

[0060] In an embodiment, the error location equation may correspond to the ELP described herein.

[0061] Figure 2E yes Figure 2A Detailed diagram of the AES engine 218. The AES engine 218 can encrypt and decrypt data by using the AES algorithm and includes an encryption module 218a and a decryption module 218b. Figure 2E A case where the encryption module 218a and the decryption module 218b are implemented as separate modules is shown, but in another case, one module capable of performing both encryption and decryption operations may be implemented in the AES engine 218. The buffer memory 216 may be a volatile memory used as a buffer or an NVM.

[0062] The AES engine 218 may receive the first data transmitted from the buffer memory 216. The encryption module 218a may encrypt the first data transmitted from the buffer memory 216 by using the encryption key and generate second data. The second data may be transmitted from the AES engine 218 to the buffer memory 216 and stored in the buffer memory 216.

[0063] In addition, the AES engine 218 may receive third data sent from the buffer memory 216. The third data may be data encrypted using the same encryption key as the encryption key used to encrypt the first data. The decryption module 218b may decrypt the third data sent from the buffer memory 216 using the same encryption key as the encryption key used to encrypt the first data and generate the fourth data. The fourth data may be sent from the AES engine 218 to the buffer memory 216 and stored in the buffer memory 216.

[0064] Figure 3 is a block diagram of a memory system 15 according to an embodiment. Figure 3 , the memory system 15 may include a memory device 17 and a memory controller 16. The memory system 15 may support a plurality of channels CH1 to CHm, and the memory device 17 may be connected to the memory controller 16 through the plurality of channels CH1 to CHm. For example, the memory system 15 may be implemented as a storage device such as an SSD.

[0065] The memory device 17 may include a plurality of NVM devices NVM11 to NVMmn. Each of the NVM devices NVM11 to NVMmn may be connected to one of the plurality of channels CH1 to CHm in a manner corresponding thereto. For example, the NVM devices NVM11 to NVM1n may be connected to the first channel CH1 through ways W11 to W1n, and the NVM devices NVM21 to NVM2n may be connected to the second channel CH2 through ways W21 to W2n. In example embodiments, each of the NVM devices NVM11 to NVMmn may be implemented as an arbitrary memory unit that may be operated according to a single command from the memory controller 16. For example, each of the NVM devices NVM11 to NVMmn may be implemented as a chip or a die, but the inventive concept is not limited thereto.

[0066] The memory controller 16 may send and receive signals to and from the memory device 17 through a plurality of channels CH1 to CHm. For example, the memory controller 16 may send commands CMDa to CMDm, addresses ADDRa to ADDRm, and data DATAa to DATAm to the memory device 17 through the channels CH1 to CHm, or receive data DATAa to DATAm from the memory device 17.

[0067] The memory controller 16 may select one of the NVM devices NVM11 to NVMmn connected to each of the channels CH1 to CHm by using a corresponding one of the channels CH1 to CHm, and transmit and receive signals to and from the selected NVM device. For example, the memory controller 16 may select the NVM device NVM11 from the NVM devices NVM11 to NVM1n connected to the first channel CH1. The memory controller 16 may transmit a command CMDa, an address ADDRa, and data DATAa to the selected NVM device NVM11 through the first channel CH1, or receive data DATAa from the selected NVM device NVM11.

[0068] The memory controller 16 may send and receive signals to and from the memory device 17 in parallel through different channels. For example, the memory controller 16 may send a command CMDb to the memory device 17 through the second channel CH2 while sending a command CMDa to the memory device 17 through the first channel CH1. For example, the memory controller 16 may receive data DATAb from the memory device 17 through the second channel CH2 while receiving data DATAa from the memory device 17 through the first channel CH1.

[0069] The memory controller 16 may control all operations of the memory device 17. The memory controller 16 may send signals to the channels CH1 to CHm and control each of the NVM devices NVM11 to NVMmn connected to the channels CH1 to CHm. For example, the memory controller 16 may send a command CMDa and an address ADDRa to the first channel CH1 and control one NVM device selected from the NVM devices NVM11 to NVM1n.

[0070] Each of the NVM devices NVM11 to NVMmn may operate via the control of the memory controller 16. For example, the NVM device NVM11 may program data DATAa based on a command CMDa, an address ADDRa, and data DATAa provided to the first channel CH1. For example, the NVM device NVM21 may read data DATAb based on a command CMDb and an address ADDb provided to the second channel CH2, and transmit the read data DATAb to the memory controller 16.

[0071] although Figure 3 An example is shown in which the memory device 17 communicates with the memory controller 16 through m channels and includes n NVM devices corresponding to each channel, but the number of channels and the number of NVM devices connected to one channel may be variously changed.

[0072] Figure 4 is a block diagram of a memory device 300 according to an example embodiment. Figure 4 , the memory device 300 may include a control logic circuit 320, a memory cell array 330, a page buffer 340, a voltage generator 350, and a row decoder 360. Figure 4 , but the memory device 300 may also include Figure 6 In addition, the memory device 300 may further include column logic, a pre-decoder, a temperature sensor, a command decoder and / or an address decoder.

[0073] The control logic circuit 320 may control all various operations of the memory device 300. The control logic circuit 320 may output various control signals in response to a command CMD and / or an address ADDR from the memory interface circuit 310. For example, the control logic circuit 320 may output a voltage control signal CTRL_vol, a row address X-ADDR, and a column address Y-ADDR.

[0074] The memory cell array 330 may include a plurality of memory blocks BLK1 to BLKz (where z is a positive integer), each of which may include a plurality of memory cells. The memory cell array 330 may be connected to the page buffer 340 through the bit lines BL, and connected to the row decoder 360 through the word lines WL, the string selection lines SSL, and the ground selection lines GSL.

[0075] In an example embodiment, the memory cell array 330 may include a 3D memory cell array including a plurality of NAND strings. Each NAND string may include memory cells connected to word lines stacked vertically on a substrate, respectively. The disclosures of U.S. Patent Nos. 7,679,133, 8,553,466, 8,654,587, 8,559,235 and U.S. Patent Publication No. 2011 / 0233648 are incorporated herein by reference. In an example embodiment, the memory cell array 330 may include a 2D memory cell array including a plurality of NAND strings arranged in a row direction and a column direction.

[0076] The page buffer 340 may include a plurality of page buffers PB1 to PBn (here, n is an integer greater than or equal to 3), and the plurality of page buffers PB1 to PBn may be connected to the memory cells respectively through a plurality of bit lines BL. The page buffer 340 may select at least one bit line BL in response to the column address Y-ADDR. The page buffer 340 may operate as a write driver or a sense amplifier according to the operation mode. For example, during a programming operation, the page buffer 340 may apply a bit line voltage corresponding to the data to be programmed to the selected bit line. During a read operation, the page buffer 340 may sense the current or voltage of the selected bit line BL and sense the data stored in the memory cell.

[0077] The voltage generator 350 may generate various voltages for program operation, read operation and erase operation based on the voltage control signal CTRL_vol. For example, the voltage generator 350 may generate a program voltage, a read voltage, a program verification voltage and an erase voltage as the word line voltage VWL.

[0078] The row decoder 360 may select one of the plurality of word lines WL and one of the plurality of string selection lines SSL in response to the row address X-ADDR. For example, the row decoder 360 may apply a program voltage and a program verification voltage to the selected word line WL during a program operation, and apply a read voltage to the selected word line WL during a read operation.

[0079] Figure 5 2 is a diagram of a UFS system 2000 according to an embodiment. The UFS system 2000 may be a system conforming to the UFS standard promulgated by the Joint Electron Device Engineering Council (JEDEC), and includes a UFS host 2100 , a UFS device 2200 , and a UFS interface 2300 . Figure 1 The above description of system 1000 may also be used without Figure 5 To the extent that the following descriptions conflict, apply Figure 5 UFS system 2000.

[0080] Reference Figure 5 , the UFS host 2100 may be connected to the UFS device 2200 through the UFS interface 2300. Figure 1 When the main processor 1100 is an AP, the UFS host 2100 may be implemented as a part of the AP. The UFS host controller 2110 and the host memory 2140 may correspond to Figure 1 The UFS device 2200 may correspond to the controller 1120 of the main processor 1100 and the memories 1200a and 1200b. Figure 1The storage devices 1300a and 1300b, and the UFS device controller 2210 and the NVM 2220 may correspond to Figure 1 Storage controllers 1310a and 1310b and NVMs 1320a and 1320b.

[0081] The UFS host 2100 may include a UFS host controller 2110, an application 2120, a UFS driver 2130, a host memory 2140, and a UFS interconnect (UIC) layer 2150. The UFS device 2200 may include a UFS device controller 2210, an NVM 2220, a storage interface 2230, a device memory 2240, a UIC layer 2250, and a regulator 2260. The NVM 2220 may include a plurality of memory cells 2221. Although each memory cell 2221 may include a V-NAND flash memory having a 2D structure or a 3D structure, each memory cell 2221 may include another type of NVM, such as PRAM and / or RRAM. The UFS device controller 2210 may be connected to the NVM 2220 through a storage interface 2230. The storage interface 2230 may be configured to comply with a standard protocol, such as Toggle or ONFI.

[0082] The application 2120 may refer to a program that wants to communicate with the UFS device 2200 to use the functions of the UFS device 2200. The application 2120 may send an input-output request (IOR) to the UFS driver 2130 for an input / output (I / O) operation on the UFS device 2200. The IOR may refer to a data read request, a data storage (or write) request, and / or a data erase (or discard) request, but is not limited thereto.

[0083] The UFS driver 2130 may manage the UFS host controller 2110 through a UFS host controller interface (UFS-HCI). The UFS driver 2130 may convert the IOR generated by the application 2120 into a UFS command defined by the UFS standard, and send the UFS command to the UFS host controller 2110. One IOR may be converted into a plurality of UFS commands. Although the UFS command may be basically defined by the SCSI standard, the UFS command may also be a command dedicated to the UFS standard.

[0084] The UFS host controller 2110 may transmit the UFS command converted by the UFS driver 2130 to the UIC layer 2250 of the UFS device 2200 through the UIC layer 2150 and the UFS interface 2300. During transmission of the UFS command, the UFS host register 2111 of the UFS host controller 2110 may be used as a command queue (CQ).

[0085] The UIC layer 2150 on the UFS host 2100 side may include a mobile industry processor interface (MIPI) M-PHY 2151 and a MIPI UniPro 2152 , and the UIC layer 2250 on the UFS device 2200 side may also include a MIPI M-PHY 2251 and a MIPI UniPro 2252 .

[0086] The UFS interface 2300 may include a line configured to send a reference clock signal REF_CLK, a line configured to send a hardware reset signal RESET_n for the UFS device 2200, a pair of lines configured to send a pair of differential input signals DIN_t and DIN_c, and a pair of lines configured to send a pair of differential output signals DOUT_t and DOUT_c.

[0087] The frequency of the reference clock signal REF_CLK provided from the UFS host 2100 to the UFS device 2200 may be one of 19.2 MHz, 26 MHz, 38.4 MHz, and 52 MHz, but is not limited thereto. The UFS host 2100 may change the frequency of the reference clock signal REF_CLK during operation (i.e., during a data transmission / reception operation between the UFS host 2100 and the UFS device 2200). The UFS device 2200 may generate a clock signal having various frequencies according to the reference clock signal REF_CLK provided from the UFS host 2100 by using a phase-locked loop (PLL). In addition, the UFS host 2100 may set the data rate between the UFS host 2100 and the UFS device 2200 by using the frequency of the reference clock signal REF_CLK. That is, the data rate may be determined depending on the frequency of the reference clock signal REF_CLK.

[0088] The UFS interface 2300 may support multiple lanes, each of which may be implemented as a pair of differential lines. For example, the UFS interface 2300 may include at least one receiving lane and at least one transmitting lane. Figure 5In the embodiment, a pair of lines configured to transmit a pair of differential input signals DIN_T and DIN_C may constitute a receiving path, and a pair of lines configured to transmit a pair of differential output signals DOUT_T and DOUT_C ​​may constitute a transmitting path. Figure 5 One transmission path and one reception path are shown in FIG. 1 , but the number of transmission paths and the number of reception paths may vary.

[0089] The receiving path and the transmitting path may transmit data based on a serial communication scheme. Due to the structure in which the receiving path is separated from the transmitting path, full-duplex communication between the UFS host 2100 and the UFS device 2200 may be achieved. That is, while receiving data from the UFS host 2100 through the receiving path, the UFS device 2200 may send data to the UFS host 2100 through the transmitting path. In addition, control data (e.g., commands) from the UFS host 2100 to the UFS device 2200 and user data stored in the NVM 2220 of the UFS device 2200 or read from the NVM 2220 by the UFS host 2100 may be transmitted through the same path. Accordingly, between the UFS host 2100 and the UFS device 2200, in addition to a pair of receiving paths and a pair of transmitting paths, it may not be necessary to further provide a separate path for data transmission.

[0090] The UFS device controller 2210 of the UFS device 2200 may control all operations of the UFS device 2200. The UFS device controller 2210 may manage the NVM 2220 by using a logical unit (LU) 2211 as a logical data storage unit. The number of LUs 2211 may be 8, but is not limited thereto. The UFS device controller 2210 may include an FTL, and converts a logical data address (e.g., a logical block address (LBA)) received from the UFS host 2100 into a physical data address (e.g., a physical block address (PBA)) by using address mapping information of the FTL. A logical block configured to store user data in the UFS system 2000 may have a size within a predetermined range. For example, the minimum size of a logical block may be set to 4K bytes.

[0091] When a command from the UFS host 2100 is applied to the UFS device 2200 through the UIC layer 2250 , the UFS device controller 2210 may perform an operation in response to the command and send a completion response to the UFS host 2100 when the operation is completed.

[0092] As an example, when the UFS host 2100 intends to store user data in the UFS device 2200, the UFS host 2100 may send a data storage command to the UFS device 2200. When receiving a response ("Ready to Transfer" response) indicating that the UFS host 2100 is ready to receive user data (ready to transfer) from the UFS device 2200, the UFS host 2100 may send the user data to the UFS device 2200. The UFS device controller 2210 may temporarily store the received user data in the device memory 2240, and store the user data temporarily stored in the device memory 2240 at a selected location of the NVM 2220 based on the address mapping information of the FTL.

[0093] As another example, when the UFS host 2100 intends to read user data stored in the UFS device 2200, the UFS host 2100 may send a data read command to the UFS device 2200. The UFS device controller 2210, which has received the command, may read the user data from the NVM 2220 based on the data read command, and temporarily store the read user data in the device memory 2240. During the read operation, the UFS device controller 2210 may detect and correct errors in the read user data by using an ECC engine (not shown) embedded therein. More specifically, the ECC engine may generate parity bits for write data to be written to the NVM 2220, and the generated parity bits may be stored in the NVM 2220 together with the write data. During the reading of data from the NVM 2220, the ECC engine may correct errors in the read data by using the parity bits read from the NVM 2220 and the read data, and output the error-corrected read data.

[0094] In addition, the UFS device controller 2210 may transmit the user data temporarily stored in the device memory 2240 to the UFS host 2100. In addition, the UFS device controller 2210 may further include an AES engine (not shown). The AES engine may perform at least one of an encryption operation and a decryption operation on the data transmitted to the UFS device controller 2210 by using a symmetric key algorithm.

[0095] The UFS host 2100 may sequentially store commands to be sent to the UFS device 2200 in the UFS host register 2111, which may be used as a common queue, and sequentially send the commands to the UFS device 2200. In this case, even while the previously sent command is still being processed by the UFS device 2200, that is, even before receiving a notification that the previously sent command has been processed by the UFS device 2200, the UFS host 2100 may send the next command waiting in the CQ to the UFS device 2200. Therefore, the UFS device 2200 may also receive the next command from the UFS host 2100 during the processing of the previously sent command. The maximum number of commands (or queue depth) that can be stored in the CQ may be, for example, 32. In addition, the CQ may be implemented as a circular queue in which the start and end of the command line stored in the queue are indicated by a head pointer and a tail pointer.

[0096] Each memory cell in the plurality of memory cells 2221 may include a memory cell array (not shown) and a control circuit (not shown) configured to control the operation of the memory cell array. The memory cell array may include a 2D memory cell array or a 3D memory cell array. The memory cell array may include a plurality of memory cells. Although each memory cell is a single-level cell (SLC) configured to store 1 bit of information, each memory cell may be a cell configured to store 2 or more bits of information, such as a multi-level cell (MLC), a triple-level cell (TLC), and a quadruple-level cell (QLC). The 3D memory cell array may include a vertical NAND string in which at least one memory cell is vertically oriented and located on another memory cell.

[0097] Voltages VCC, VCCQ, and VCCQ2 may be applied to the UFS device 2200 as power supply voltages. Voltage VCC may be a main power supply voltage for the UFS device 2200, and is in the range of 2.4V to 3.6V. Voltage VCCQ may be a power supply voltage for mainly providing a low voltage to the UFS device controller 2210, and is in the range of 1.14V to 1.26V. Voltage VCCQ2 may be a power supply voltage for mainly supplying a voltage lower than voltage VCC and higher than voltage VCCQ to an I / O interface such as MIPI M-PHY 2251, and is in the range of 1.7V to 1.95V. The power supply voltage may be supplied to the corresponding components of the UFS device 2200 through the regulator 2260. The regulator 2260 may be implemented as a set of unit regulators respectively connected to the above-mentioned different power supply voltages.

[0098] As described above, embodiments may involve determining an initial ELP polynomial that may include terms corresponding to all symbols or frames that have not yet been decoded. Then, when frame j is successfully decoded, the ELP may be calculated by dividing the ELP by the monomial (1-α j ) to modify the initial ELP to reflect the successful decoding.

[0099] As an example, the polynomials g(x) and f(x) may be provided as shown in Equation 1 and Equation 2 below:

[0100]

[0101] f(x)=(1+α j x)g(x) Equation 2

[0102] To obtain or recover the polynomial g(x) from the polynomial f(x), we can think of it as dividing the polynomial f(x) by the monomial (1+α j x).

[0103] Considering that each coefficient f(x) i and g(x) i The relationship between them shows that these coefficients satisfy the following equations 3 and 4:

[0104] f i =g i +α j g i-1 Equation 3

[0105] g 0 =f 0 Equation 4

[0106] As a result, each of the coefficients of g(x) may be iteratively calculated in order from the lowest order coefficient to the highest order coefficient according to the following Equation 4:

[0107] g i =f i -α j g i-1 Equation 5

[0108] Furthermore, if it is known that the polynomial degrees of f(x) and g(x) are reduced, the following equation 5 can be satisfied:

[0109] g n+1 =0 Equation 6

[0110] As a result, the coefficients of g(x) may be iteratively calculated in order from the highest order coefficient to the lowest order coefficient according to Equation 6 below:

[0111]

[0112] Equations 7 and 8 below provide examples of f(x) and g(x) that can be used to illustrate this calculation:

[0113] g(x)=Ax 2 +Bx+C Equation 8

[0114] f(x)=(1+Dx)g(x)=ADx 3 +(A+DB)x 2 +(B+DC)x+C

[0115] For the examples of f(x) and g(x) shown in Equation 7 and Equation 8, the coefficients of f(x) can be expressed according to the following Equations 9-12:

[0116] f 3 =AD Equation 9

[0117] f 2 =(A+DB) Equation 10

[0118] f 1 =(B+DC) Equation 11

[0119] f 0 =C Equation 12

[0120] According to an embodiment, if these coefficients f 3 、f 2 、f 1 and f 0 is known and the monomial term (1+Dx) is known, and if the polynomial degree of f(x) and g(x) is reduced, the coefficients of g(x) can be determined sequentially from the lowest order to the highest order according to the following equations 13-15:

[0121] g 0 =f 0 =C Equation 13

[0122] g 1 =f 1 -Dg 0 =(B+DC)-DC=B Equation 14

[0123] g 2 =f 2 -Dg 1 =(A+DB)-DB=A Equation 15

[0124] In addition, the coefficients of g(x) may also be determined sequentially from the highest order to the lowest order according to the following equations 16-18:

[0125]

[0126]

[0127]

[0128] In an embodiment, the polynomial division operation shown in the above equation can be performed for any division task involving polynomials, as long as the polynomial being divided is divisible by the divisor. Accordingly, although these operations are explained in the context of ECC decoding herein, the embodiments can also be applied in any appropriate context, such as division involving decimals, etc.

[0129] Figure 6 is a block diagram illustrating an example implementation of the polynomial division method described above. Figure 6 As shown, the division module 600 can be used to divide the coefficient X D ,……,X 0 The first polynomial of degree D divided by the monomial (1-α j ) in order to obtain the coefficient Y D-1 ,……,Y 0 In an embodiment, the division module 600 may receive the coefficient X D ,……,X 0 As input, the coefficients Y can be output one by one D-1 ,……,Y 0 In an embodiment, the coefficient X D ,……,X 0 can correspond to the coefficients of f(x) above, and the coefficients Y D-1 ,……,Y 0 can correspond to the coefficients of g(x) above.

[0130] In an embodiment, the division module 600 can be obtained from the highest order coefficient Y D-1 To the lowest order coefficient Y 1 The calculations are performed sequentially. For example, to calculate the coefficient Y D-1 , the division module 600 may receive the coefficient X D , and the coefficient X D Multiply This is equivalent to changing the coefficient X D Divide by α j In an embodiment, the term α included in the monomial term j can be called monomial coefficients or monomial terms, and the terms It can be called the reciprocal of the monomial coefficient or the reciprocal of the monomial term. To calculate the coefficient Y D-2 , the division module 600 may receive the coefficient X D-`, the coefficient X D-1 With coefficient Y D-1 Add them and multiply the result by The division module 600 can be performed sequentially in this manner to calculate any number of coefficients. In an embodiment, the division module 600 can calculate the coefficient Y in the first operation cycle. D-1 , and the coefficient Y can be calculated in the second operation cycle D-c .

[0131] In an embodiment, the division module 600 can be obtained from the lowest order coefficient Y 1 To the highest order coefficient Y D-1 The calculations are performed sequentially. For example, to calculate the coefficient Y 1 , the division module 600 may receive the coefficient X 0 =1, the coefficient X 0 Multiply by α j , and multiply the result by the coefficient X 1 Then, to calculate the coefficient Y 2 , the division module 600 can convert the coefficient Y 1 Multiply by α j , and add the multiplication result to the coefficient X 2 The division module 600 may be performed sequentially in this manner to calculate any number of coefficients. In an embodiment, the division module 600 may calculate the coefficient Y in the first operation cycle. 1 , and the coefficient Y can be calculated in the second operation cycle 2 .

[0132] In an embodiment, in order to speed up the calculation, the division module 600 can calculate the coefficients in two directions at the same time. For example, in an embodiment, the division module 600 can be combined with Y 1 At the same time, calculate the coefficient Y D-1 , can be compared with Y 2 At the same time, calculate the coefficient Y D-2 , and so on, until the coefficient Y D-1 ,……,Y 0 In an embodiment, calculating the coefficients simultaneously may mean that the operations included in the calculation can be performed at the same time. In an embodiment, calculating the coefficients simultaneously may mean obtaining the results of the calculations during the same operation cycle. For example, in an embodiment, the division module 600 may calculate the coefficient Y during the first operation cycle. D-1 and coefficient Y 1 , the coefficient Y can be calculated during the second operation cycle D-2 and coefficient Y 2 , and so on.

[0133] In an embodiment, the division module 600 may calculate more than two coefficients per operation cycle. For example, assuming that there are i calculations in a row per cycle, and starting from both sides, the expected delay may be cycles, which means that All coefficients are calculated in cycles. For example, in an embodiment, it is feasible for GF(2^7) to calculate two coefficients per side per cycle, and it is even possible to calculate three coefficients per side per cycle.

[0134] Figure 7 is a block diagram showing an example hardware implementation of the above-mentioned division module according to an embodiment. Figure 7 As shown, the division module 700 may include a high calculation module 710 and a low calculation module 720. The high calculation module 710 may calculate downward from the highest order coefficient, and the low calculation module 720 may calculate upward from the lowest order coefficient. Each of the high calculation module 710 and the low calculation module 720 may include separate hardware for calculating even coefficients and odd coefficients, so each of the high calculation module 710 and the low calculation module 720 may calculate two coefficients per operation cycle. Accordingly, in an embodiment, the division module 700 may calculate four coefficients per operation cycle. As a result, the division module 700 may have The latency of an operation cycle.

[0135] like Figure 7 As shown, the high calculation module 710 may include a multiplexer high_even_i and a multiplexer high_odd_i, and high_even_i may receive the coefficient X D , X D-2 ,……,X (D / 2)+3 , high_odd_i can receive the coefficient X D-1 , X D-3 ,……,X (D / 2)+2 In addition, the high calculation module 710 may include a multiplexer high_odd_o and a multiplexer high_even_o, and the multiplexer high_odd_o may output the coefficient Y D-1 , Y D-3 ,……,X (d / 2)+2 , the multiplexer high_even_o can output the coefficient Y D-2 , Y D-4 ,……,Y (D / 2)+1The high calculation module 710 may further include a high input multiplexer 715, which may receive a 0 value and the output of the high calculation module 710. Multiplexers high_even_i, high_odd_i, high_even_o, and high_odd_o may be controlled by a signal pow_high, and the high input multiplexer 715 may be controlled by a signal START. For example, in an embodiment, multiplexers high_even_o and high_odd_o may be controlled by a signal pow_high to output a single coefficient at a time.

[0136] like Figure 7 As further shown in FIG. 1 , the low calculation module 720 may include a multiplexer low_even_i and a multiplexer low_odd_i, and low_even_i may receive the coefficient X 2 , X 4 ,……,X (D / 2)+1 , low_odd_i can receive the coefficient X 1 , X 3 ,……,X (D / 2) In addition, the low calculation module 720 may include a multiplexer low_odd_o and a multiplexer low_even_o, and the multiplexer low_odd_o may output the coefficient Y 1 , Y 3 ,……,Y (D / 2) , the multiplexer low_even_o can output the coefficient Y 2 , Y 4 ,……,Y (D / 2)+1 The low calculation module 720 may also include a low input multiplexer 725, which may receive the coefficients X 0 and the output of the low calculation module 720. Multiplexers low_even_i, low_odd_i, low_even_o, and low_odd_o may be controlled by a signal pow_low, and the low input multiplexer 725 may be controlled by a signal START. For example, in an embodiment, multiplexers low_even_o and low_odd_o may be controlled by a signal pow_low to output a single coefficient at a time.

[0137] In an embodiment, during the first operation cycle, the start signal may cause the high input multiplexer 715 to output a value of 0 as the signal X. high The signal pow_high can make the multiplexer high_even_i output coefficient X D , and make the multiplexer high_odd_i output coefficient X D-1. You can use 0 value and coefficient X D A bitwise XOR operation is performed, and the result of this operation can be multiplied by the term The result of the multiplication can be provided to the multiplexer high_odd_o, and the value of the signal pow_high can cause the multiplexer high_odd_o to output the result as the coefficient Y D-1 This value and the coefficient X can be D-1 A bitwise XOR operation is performed, and the result of this operation can be multiplied by the term The multiplication result can be provided to the high input multiplexer 715 for use as input for the next operation cycle, and can also be provided to the multiplexer high_even_o. The value of the signal pow_high can cause the multiplexer high_even_o to output the result as the coefficient Y D-2 .

[0138] During the first operation cycle, the start signal may cause the lower input multiplexer 725 to output the coefficient X 0 The value of signal X low The signal pow_low can make the multiplexer low_odd_i output coefficient X 1 , and make the multiplexer low_even_i output coefficient X 2 . Coefficient X 0 The value of can be multiplied by the term α j , and the multiplication result and the coefficient X can be 1 A bitwise XOR operation is performed. The result of this operation can be provided to the multiplexer low_odd_o, and the value of the signal pow_low can cause the multiplexer low_odd_o to output the result as the coefficient Y 1 This value can also be multiplied by the term α j , and the multiplication result and the coefficient X can be 2 A bitwise XOR operation is performed. The result of this operation can be provided to the low input multiplexer 725 for use as input for the next operation cycle, and can also be provided to the multiplexer low_even_o, and the value of the signal pow_low can cause the multiplexer low_even_o to output the result as the coefficient Y 2 .

[0139] Accordingly, the division module 700 can simultaneously execute the calculation of the coefficient Y 1 and coefficient Y D-1 The operation of the value of can be performed simultaneously for calculating the coefficient Y 2 and coefficient Y D-2 Therefore, the division module 700 can calculate the coefficient Y during the same operation cycle.1 , coefficient Y 2 , coefficient Y D-2 and coefficient Y D-1 The value of .

[0140] During the second operation cycle, the start signal may cause the high input multiplexer 715 to output the coefficient Y obtained during the first operation cycle. d-2 The value of signal X high The signal pow_high can make the multiplexer high_even_i output coefficient X D-2 , and make the multiplexer high_odd_i output coefficient X d-3 . Signal X can be high The value and coefficient X D-2 A bitwise XOR operation is performed, and the result of this operation can be multiplied by the term The result of the multiplication can be provided to the multiplexer high_odd_o, and the value of the signal pow_high can cause the multiplexer high_odd_o to output the result as the coefficient Y D-3 This value and the coefficient X can be D-3 A bitwise XOR operation is performed, and the result of this operation can be multiplied by the term The multiplication result can be provided to the high input multiplexer 715 for use as an input for the next operation cycle, and can also be provided to the multiplexer high_even_o. The value of the signal pow_high can cause the multiplexer high_even_o to output the result as the coefficient Y. D-4 .

[0141] During the second operation cycle, the start signal may cause the lower input multiplexer 725 to output the coefficient Y obtained during the first operation cycle. 2 The value of signal X low The signal pow_low can make the multiplexer low_odd_i output coefficient X 3 , and make the multiplexer low_even_i output coefficient X 4 Coefficient Y 2 The value of can be multiplied by the term α j , and the multiplication result and the coefficient X can be 3 A bitwise XOR operation is performed. The result of this operation can be provided to the multiplexer low_odd_o, and the value of the signal pow_low can cause the multiplexer low_odd_o to output the result as the coefficient Y 3 This value can also be multiplied by the term α j , and the multiplication result and the coefficient X can be 4A bitwise XOR operation is performed. The result of this operation can be provided to the low input multiplexer 725 for use as input for the next operation cycle, and can also be provided to the multiplexer low_even_o, and the value of the signal pow_low can cause the multiplexer low_even_o to output the result as the coefficient Y 4 .

[0142] Accordingly, the division module 700 can simultaneously execute the calculation of the coefficient Y 3 and Y D-3 The coefficient value operation can also be performed simultaneously for calculating the coefficient Y 4 and coefficient Y D-4 Therefore, the division module 700 can calculate the coefficient Y during the same operation cycle. 3 , coefficient Y 4 , coefficient Y D-4 and coefficient Y D-3 The value of .

[0143] In an embodiment, one or more coefficients (eg, coefficient Y (D / 2)+1 ) may be calculated by both high calculation module 710 and low calculation module 720. If the results on both sides are not equal, this may indicate that a multiplication or division error has occurred. In an embodiment, care should be taken when selecting this intermediate to ensure that high calculation module 710 and low calculation module 720 do not inadvertently receive as input a coefficient that has already been updated as an output. In an embodiment, during a polynomial update, one or more coefficients (e.g., coefficient Y (D / 2)+1 ) may only consider one of multiplexer high_even_o and multiplexer low_even_o. For example, the multiplexer that can reach ∞ first over time among multiplexer high_even_o and multiplexer low_even_o may be considered. In an embodiment, an indication of a corrected frame may be received on a cycle-by-cycle basis. As an example, if a 74th degree polynomial is processed using division module 700, this may result in a latency of 74 / 4 operation cycles. In an embodiment, this latency may be reduced by operating multiple instances of division module 600 or division module 700 in parallel.

[0144] Figure 88000. It is a block diagram of two division modules operating in a parallel pipeline architecture. In an embodiment, each of the two division modules can operate on different coefficients at the same time. For example, if an indication that a frame is corrected in the first operation cycle is received, the first division module 700a starts to operate on ELP 8000. Then, if a new indication that a different frame is corrected in the second operation cycle is received, the second division module 700b can start to operate on ELP 8000. This is possible because the highest order coefficient and the lowest order coefficient of ELP 8000 are stable after at least one operation cycle. In other words, after the first operation cycle, the subsequent operation of the first division module 700a does not change the highest order coefficient and the lowest order coefficient. Therefore, starting from the second operation cycle, the second division module 700b can use the highest order coefficient and the lowest order coefficient to perform calculations, and the first division module 700a and the second division module 700b can be performed in parallel. In an embodiment, all division modules operating in parallel can start from the same number of times, using zero for higher coefficients, so as to avoid coefficient overflow.

[0145] Fig. 9 is a flow chart of a process 900 of controlling a storage device according to an embodiment. In some implementations, Fig. 9 One or more process blocks of the division module 600, the division module 700 or the above reference Figure 1-Figure 8 any other elements described.

[0146] like Fig. 9 As shown, at operation 901, process 900 may include obtaining a codeword from a storage device. In an embodiment, the codeword may be an SPolar GCC codeword and may include a plurality of frames.

[0147] like Fig. 9 As further shown, at operation 902, process 900 may include obtaining an initial ELP corresponding to a codeword.

[0148] like Fig. 9 As further shown, process 900 may include decoding a frame of the plurality of frames at operation 903. In an embodiment, RS decoding may be used to decode the frame.

[0149] like Fig. 9As further shown in FIG. 9 , at operation 904, process 900 may include: determining an updated ELP based on the initial ELP and information about the frame based on determining that the frame is successfully decoded. In an embodiment, the updated ELP may include multiple updated coefficients, and the updated ELP may be determined by simultaneously calculating at least two updated coefficients among the multiple updated coefficients. In an embodiment, the updated ELP may have a lower degree than the initial ELP. In an embodiment, the root of the ELP may indicate an error location.

[0150] like Fig. 9 As further shown in FIG. 9 , at operation 905 , process 900 may include obtaining information bits corresponding to the codeword based on the updated ELP.

[0151] In an embodiment, the information about the frame may include a monomial term or a monomial coefficient corresponding to the frame. In an embodiment, the monomial term may correspond to α j .

[0152] In an embodiment, multiple updated coefficients may correspond to multiple residual frames among multiple frames, the multiple updated coefficients may include a highest updated coefficient corresponding to a highest order residual frame among the multiple residual frames, and a lowest updated coefficient corresponding to a lowest order residual frame among the multiple residual frames, and the updated ELP may be determined by simultaneously calculating the highest updated coefficient and the lowest updated coefficient.

[0153] In an embodiment, the initial ELP may include multiple coefficients corresponding to multiple frames, the multiple coefficients may include a highest coefficient and a lowest coefficient, the highest updated coefficient may be calculated based on the highest coefficient, and the lowest updated coefficient may be calculated based on the lowest coefficient.

[0154] In an embodiment, the highest updated coefficient may be calculated by multiplying the highest coefficient by the inverse of the monomial term, and the lowest updated coefficient may be calculated by performing a bitwise XOR operation on the lowest coefficient and the monomial term.

[0155] In an embodiment, the multiple coefficients may include a second high coefficient and a second low coefficient, the multiple updated coefficients may include a second high updated coefficient corresponding to a second high order residual frame among the multiple residual frames, and a second low updated coefficient corresponding to a second low order residual frame among the multiple residual frames, and the updated ELP may be determined by simultaneously calculating the second high updated coefficient and the second low updated coefficient.

[0156] In an embodiment, the second highest updated coefficient may be calculated by multiplying the reciprocal of the monomial term with the result of a bitwise XOR operation on the highest updated coefficient and the second highest coefficient, and the second lowest updated coefficient may be calculated by performing a bitwise XOR operation on the second lowest coefficient and the result of multiplying the lowest updated coefficient with the monomial term.

[0157] although Fig. 9 An example block diagram of process 900 is shown, but in some implementations, process 900 may also include Fig. 9 The blocks shown may include additional blocks, fewer blocks, different blocks, or blocks in a different arrangement than those shown. Additionally or alternatively, two or more of the blocks of process 900 may be arranged or combined in any order, or performed in parallel.

[0158] Fig.10 is a diagram of a data center 3000 to which a memory device is applied according to an embodiment.

[0159] Reference Fig.10 , the data center 3000 may be a facility that collects multiple pieces of data of various types and provides services, and is referred to as a data storage center. The data center 3000 may be a system for operating a search engine and a database, and may be a computing system used by a company or a government agency such as a bank. The data center 3000 may include application servers 3100 to 3100n and storage servers 3200 to 3200m. According to an embodiment, the number of application servers 3100 to 3100n and the number of storage servers 3200 to 3200m may be selected differently. The number of application servers 3100 to 3100n may be different from the number of storage servers 3200 to 3200m.

[0160] The application server 3100 or the storage server 3200 may include at least one of the processors 3110 and 3210 and the memories 3120 and 3220. The storage server 3200 is now described as an example. The processor 3210 may control all operations of the storage server 3200, access the memory 3220, and execute instructions and / or data loaded in the memory 3220. The memory 3220 may be a double-data-rate synchronous DRAM (DDRSDRAM), a high-bandwidth memory (HBM), a hybrid memory cube (HMC), a dual in-line memory module (DIMM), an Optane DIMM, and / or a non-volatile DIMM (NVMDIMM). In some embodiments, the number of processors 3210 and memory 3220 included in the storage server 3200 may be selected differently. In an embodiment, the processor 3210 and the memory 3220 may provide a processor-memory pair. In an embodiment, the number of processors 3210 may be different from the number of memories 3220. The processor 3210 may include a single-core processor or a multi-core processor. The above description of the storage server 3200 may be similarly applied to the application server 3100. In some embodiments, the application server 3100 may not include a storage device 3150. The storage server 3200 may include at least one storage device 3250. According to the embodiment, the number of storage devices 3250 included in the storage server 3200 may be selected differently.

[0161] The application servers 3100 to 3100n can communicate with the storage servers 3200 to 3200m through the network 3300. The network 3300 can be implemented by using a fiber channel (FC) or Ethernet. In this case, FC can be a medium for relatively high-speed data transmission, and an optical switch with high performance and high availability is used. According to the access method of the network 3300, the storage servers 3200 to 3200m can be provided as file storage devices, block storage devices, or object storage devices.

[0162] In an embodiment, the network 3300 may be a storage-specific network, such as a storage area network (SAN). For example, the SAN may be an FC-SAN, which uses an FC network and is implemented according to an FC protocol (FC protocol, FCP). As another example, the SAN may be an Internet protocol (Internet protocol, IP)-SAN, which uses a transmission control protocol (transmission control protocol, TCP) / IP network and is implemented according to SCSI based on TCP / IP or Internet SCSI (Internet SCSI, iSCSI) protocol. In another embodiment, the network 3300 may be a general network, such as a TCP / IP network. For example, the network 3300 may be implemented according to protocols such as FC over Ethernet (FC over Ethernet, FCoE), network attached storage (network attached storage, NAS), and NVMe over Fabrics (NVMe-oF) based on network structures.

[0163] Hereinafter, the application server 3100 and the storage server 3200 will be mainly described. The description of the application server 3100 may be applied to another application server 3100n, and the description of the storage server 3200 may be applied to another storage server 3200m.

[0164] The application server 3100 may store data requested to be stored by a user or client in one of the storage servers 3200 to 3200m through the network 3300. In addition, the application server 3100 may obtain data requested to be read by a user or client from one of the storage servers 3200 to 3200m through the network 3300. For example, the application server 3100 may be implemented as a network server or a database management system (DBMS).

[0165] The application server 3100 may access a memory 3120n or a storage device 3150n included in another application server 3100n through the network 3300. Alternatively, the application server 3100 may access a memory 3220 to 3220m or a storage device 3250 to 3250m included in the storage servers 3200 to 3200m through the network 3300. Therefore, the application server 3100 may perform various operations on data stored in the application servers 3100 to 3100n and / or the storage servers 3200 to 3200m. For example, the application server 3100 may execute an instruction for moving or copying data between the application servers 3100 to 3100n and / or the storage servers 3200 to 3200m. In this case, data may be moved from the storage devices 3250 to 3250m of the storage servers 3200 to 3200m to the storage 3120 to 3120n of the application servers 3100 to 3100n directly or through the storage 3220 to 3220m of the storage servers 3200 to 3200m. The data moved through the network 3300 may be data encrypted for security or privacy.

[0166] The storage server 3200 is now described as an example. The interface 3254 can provide a physical connection between the processor 3210 and the controller 3251 and a physical connection between the network interface card (NIC) 3240 and the controller 3251. For example, the interface 3254 can be implemented using a direct attached storage (DAS) solution in which the storage device 3250 is directly connected to a dedicated cable. For example, the interface 3254 can be implemented using various interface solutions, such as ATA, SATA, e-SATA, SCSI, SAS, PCI, PCIe, NVMe, IEEE 1394, USB interface, SD card interface, MMC interface, eMMC interface, UFS interface, eUFS interface and / or CF card interface.

[0167] The storage server 3200 may further include a switch 3230 and a NIC (Network Interconnect) 3240. The switch 3230 may selectively connect the processor 3210 to the storage device 3250 or selectively connect the NIC 3240 to the storage device 3250 via the control of the processor 3210.

[0168] In an embodiment, the NIC 3240 may include a network interface card and a network adapter. The NIC 3240 may be connected to the network 3300 through a wired interface, a wireless interface, a Bluetooth interface, or an optical interface. The NIC 3240 may include an internal memory, a digital signal processor (DSP), and a host bus interface, and is connected to the processor 3210 and / or the switch 3230 through the host bus interface. The host bus interface may be implemented as one of the above examples of the interface 3254. In an embodiment, the NIC 3240 may be integrated with at least one of the processor 3210, the switch 3230, and the storage device 3250.

[0169] In the storage servers 3200 to 3200m or the application servers 3100 to 3100n, the processor may send a command to the storage devices 3150 to 3150n and 3250 to 3250m or the memories 3120 to 3120n and 3220 to 3220m, and program or read the data. In this case, the data may be data for which an error has been corrected by an ECC engine. The data may be data for which a data bus inversion (DBI) operation or a data masking (DM) operation has been performed, and may include cyclic redundancy code (CRC) information. The data may be data encrypted for security or privacy.

[0170] The storage devices 3150 to 3150n and 3250 to 3250m may send control signals and command / address signals to the NAND flash memory devices 3252 to 3252m in response to a read command received from the processor. Therefore, when data is read from the NAND flash memory devices 3252 to 3252m, a read enable (RE) signal may be input as a data output control signal, and thus, the data may be output to the DQ bus. The RE signal may be used to generate a data strobe signal DQS. The command and address signals may be latched in the page buffer depending on the rising edge or falling edge of the write enable (WE) signal.

[0171] The controller 3251 may control all operations of the storage device 3250. In an embodiment, the controller 3251 may include an SRAM. The controller 3251 may write data to the NAND flash memory device 3252 in response to a write command, or read data from the NAND flash memory device 3252 in response to a read command. For example, a write command and / or a read command may be provided from the processor 3210 of the storage server 3200, the processor 3210m of another storage server 3200m, or the processors 3110 and 3110n of the application servers 3100 and 3100n. The DRAM 3253 may temporarily store (or buffer) data to be written to the NAND flash memory device 3252 or data read from the NAND flash memory device 3252. In addition, the DRAM 3253 may store metadata. Here, the metadata may be user data for managing the NAND flash memory device 3252 or data generated by the controller 3251. The storage device 3250 may include a secure element (SE) for security or privacy.

[0172] According to the tradition of the art, embodiments are described and illustrated in the accompanying drawings according to functional blocks, units and / or modules. It will be appreciated by those skilled in the art that these blocks, units and / or modules are physically implemented by electronic (or optical) circuits, such as logic circuits, discrete components, microprocessors, hard-wired circuits, memory elements, wiring connections, etc., which can be formed using semiconductor-based manufacturing techniques or other manufacturing techniques. In the case where blocks, units and / or modules are implemented by microprocessors, etc., they can be programmed using software (e.g., microcode) to perform the various functions discussed herein, and can be optionally driven by firmware and / or software. Alternatively, each block, unit and / or module can be implemented by dedicated hardware, or implemented as a combination of dedicated hardware to perform some functions and processors (e.g., one or more programmed microprocessors and associated circuits) to perform other functions. In addition, each block, unit and / or module of the embodiment can be physically divided into two or more interacting and separated blocks, units and / or modules without departing from the scope of the present invention. Furthermore, the blocks, units and / or modules of the embodiments may be physically combined into more complex blocks, units and / or modules without departing from the scope of the present invention.

[0173] The various operations of the above-described methods may be performed by any suitable means capable of performing the operations, such as various hardware and / or software components, circuits and / or modules.

[0174] Software may include an ordered listing of executable instructions for implementing logical functions and may be embodied in any "processor readable medium" for use by or in conjunction with an instruction execution system, apparatus or device (such as a single-core or multi-core processor or a system including a processor).

[0175] The blocks or steps of the methods or algorithms and functions described in conjunction with the embodiments disclosed herein may be directly embodied in hardware, a software module executed by a processor, or a combination of the two. If implemented in software, the functions may be stored or transmitted as one or more instructions or codes on a tangible, non-temporary computer-readable medium. The software module may reside in a random access memory (RAM), a flash memory, a read-only memory (ROM), an electrically programmable ROM (EPROM), an electrically erasable programmable ROM (EEPROM), a register, a hard disk, a removable disk, a CDROM, or any other form of storage medium known in the art.

[0176] The foregoing is illustrative of embodiments and should not be construed as limiting thereof. Although several embodiments have been described, those skilled in the art will readily appreciate that many modifications may be made to the embodiments without materially departing from the scope of the invention.

Claims

1. A storage system, include: a storage device configured to store a plurality of codewords; as well as At least one processor configured to: Obtaining a codeword from among the plurality of codewords from the storage device, wherein the codeword comprises a plurality of frames; Obtaining an initial error locator polynomial (ELP) corresponding to the codeword; decoding a frame from the plurality of frames; Based on the frame being successfully decoded, determining an updated ELP based on the initial ELP and information about the frame; and obtaining information bits corresponding to the codeword based on the updated ELP, wherein the updated ELP comprises a plurality of updated coefficients, and The at least one processor is further configured to determine the updated ELP by simultaneously calculating at least two updated coefficients among the plurality of updated coefficients.

2. The storage system according to claim 1, in, The information about the frame includes monomial terms corresponding to the frame.

3. The storage system according to claim 2, in, The plurality of updated coefficients correspond to a plurality of remaining frames among the plurality of frames, wherein the plurality of updated coefficients include a highest updated coefficient corresponding to a highest order residual frame among the plurality of residual frames, and a lowest updated coefficient corresponding to a lowest order residual frame among the plurality of residual frames, and Wherein the at least one processor is further configured to determine the updated ELP by simultaneously calculating the highest updated coefficient and the lowest updated coefficient.

4. The storage system according to claim 3, in, The initial ELP includes a plurality of coefficients corresponding to the plurality of frames, wherein the plurality of coefficients include a highest coefficient and a lowest coefficient, and The at least one processor is further configured to calculate the highest updated coefficient based on the highest coefficient, and to calculate the lowest updated coefficient based on the lowest coefficient.

5. The storage system according to claim 4, in, The at least one processor is further configured to compute the highest updated coefficient by multiplying the highest coefficient by the inverse of the monomial term and to compute the lowest updated coefficient by performing a bitwise XOR operation on the lowest coefficient and the monomial term.

6. The storage system according to claim 5, in, The plurality of coefficients also includes a second highest coefficient and a second lowest coefficient, wherein the plurality of updated coefficients further include a second highest updated coefficient corresponding to a second highest order residual frame among the plurality of residual frames, and a second lowest updated coefficient corresponding to a second lowest order residual frame among the plurality of residual frames, and The at least one processor is further configured to determine the updated ELP by simultaneously calculating the second high updated coefficient and the second low updated coefficient.

7. The storage system according to claim 6, in, The at least one processor is further configured to: calculating the second highest updated coefficient by multiplying the reciprocal of the monomial term by a result of a bitwise XOR operation of the highest updated coefficient and the second highest coefficient, and The second lower updated coefficient is calculated by performing a bitwise XOR operation on the second lower coefficient and a result of multiplying the lowest updated coefficient by the monomial term.

8. The storage system according to claim 1, in, The codeword comprises a generalized concatenated code (GCC) codeword, and The updated ELP is used to perform Reed-Solomon decoding corresponding to the GCC codeword.

9. A device for decoding a codeword comprising a plurality of frames, the device include: At least one processor configured to: Obtaining an initial error locator polynomial (ELP) corresponding to the codeword; decoding a frame from the plurality of frames; determining the updated ELP by simultaneously calculating at least two updated coefficients among a plurality of updated coefficients included in the updated ELP based on the frame being successfully decoded; as well as An information bit corresponding to the codeword is obtained based on the updated ELP.

10. The device according to claim 9, in, The updated ELP is determined based on the initial ELP and monomial terms corresponding to the frame.

11. The device according to claim 10, in, The plurality of updated coefficients correspond to a plurality of remaining frames among the plurality of frames, wherein the plurality of updated coefficients include a highest updated coefficient corresponding to a highest order residual frame among the plurality of residual frames, and a lowest updated coefficient corresponding to a lowest order residual frame among the plurality of residual frames, and The at least one processor is further configured to determine the updated ELP by simultaneously calculating the highest updated coefficient and the lowest updated coefficient.

12. The device according to claim 11, in, The initial ELP includes a plurality of coefficients corresponding to the plurality of frames, wherein the plurality of coefficients include a highest coefficient and a lowest coefficient corresponding to a lowest-order frame among the plurality of frames, and The at least one processor is further configured to calculate the highest updated coefficient based on the highest coefficient, and to calculate the lowest updated coefficient based on the lowest coefficient.

13. The device according to claim 12, in, The at least one processor is further configured to compute the highest updated coefficient by multiplying the highest coefficient by a reciprocal of the monomial term and to compute the lowest updated coefficient by performing a bitwise XOR operation on the lowest coefficient and the monomial term.

14. The device according to claim 13, in, The plurality of coefficients also includes a second highest coefficient and a second lowest coefficient, wherein the plurality of updated coefficients further include a second highest updated coefficient corresponding to a second highest order residual frame among the plurality of residual frames, and a second lowest updated coefficient corresponding to a second lowest order residual frame among the plurality of residual frames, and The at least one processor is further configured to determine the updated ELP by simultaneously calculating the second high updated coefficient and the second low updated coefficient.

15. The device according to claim 14, in, The at least one processor is further configured to: calculating the second highest updated coefficient by multiplying the reciprocal of the monomial term by a result of a bitwise XOR operation of the highest updated coefficient and the second highest coefficient, and The second lower updated coefficient is calculated by performing a bitwise XOR operation on the second lower coefficient and a result of multiplying the lowest updated coefficient by the monomial term.

16. The device according to claim 9, in, The codeword comprises a generalized concatenated code (GCC) codeword, and The updated ELP is used to perform Reed-Solomon decoding corresponding to the GCC codeword.

17. A method for controlling a storage system, the method being executed by at least one processor and include: Obtaining a codeword from a storage device, wherein the codeword includes a plurality of frames; Obtaining an initial error locator polynomial (ELP) corresponding to the codeword; decoding a frame from the plurality of frames; Based on the frame being successfully decoded, determining an updated ELP based on the initial ELP and information about the frame; and obtaining information bits corresponding to the codeword based on the updated ELP, wherein the updated ELP comprises a plurality of updated coefficients, and Therein, determining the updated ELP includes simultaneously calculating at least two updated coefficients among the multiple updated coefficients.

18. The method according to claim 17, in, The information about the frame includes monomial terms corresponding to the frame.

19. The method according to claim 18, in, The plurality of updated coefficients correspond to a plurality of remaining frames among the plurality of frames, wherein the plurality of updated coefficients include a highest updated coefficient corresponding to a highest order residual frame among the plurality of residual frames, and a lowest updated coefficient corresponding to a lowest order residual frame among the plurality of residual frames, and Wherein, simultaneously calculating the at least two updated coefficients includes simultaneously calculating the highest updated coefficient and the lowest updated coefficient.

20. The method according to claim 19, in, The initial ELP includes a plurality of coefficients corresponding to the plurality of frames, wherein the plurality of coefficients include a highest coefficient and a lowest coefficient, and wherein the highest updated coefficient is calculated based on the highest coefficient, and The lowest updated coefficient is calculated based on the lowest coefficient.