What is claimed is:
1. A semiconductor storage device equipped with flash memories each having a limited size of a spare storage area, said semiconductor storage device comprising:
an error decision unit for judging whether or not an error occurs during writing of data;
a replacing unit for rewriting data to the spare storage area when said error decision unit judges that an error occurs;
a spare area size calculating unit for calculating a remaining size of the spare storage area after the data has been re-written to the spare storage area;
a spare area checking unit for comparing the remaining size of the spare storage area with a predetermined value; and
a warning generator for generating a warning when the remaining size of the spare storage area is smaller than the predetermined value.
2. The semiconductor storage device according to claim 1, wherein the replacing unit acquires a start address of the spare storage area from a spare storage area management table which is saved in a management area of each flash memory to thereby rewrite the data to the spare storage area of the acquired address, and after the completion of the data rewriting, the replacing unit updates the spare storage area management table and a logic-to-physic conversion table saved in the management area.
3. The semiconductor storage device according to claim 1, wherein the spare area size calculating unit calculates the remaining size of the spare storage area in response to a check command for checking the remaining size of the spare storage area which is issued by an external system.
4. The semiconductor storage device according to claim 1, further comprising a register for flagging a specific bit indicative of the warning when it is judged that the remaining size of the spare storage area is smaller than the predetermined value.
5. The semiconductor storage device according to claim 1, wherein a warning indication signal is provided for transmission to an external system and when the spare area checking unit judges that the remaining size of the spare storage area is smaller than the predetermined value, the warning indication signal is changed in level to notify the external system of the warning.
6. The semiconductor storage device according to claim 1 further comprising an external switch wherein the spare area size calculating unit executes the calculation of the remaining size of the spare storage area when the external switch is turned on.
7. A warning generating system of a semiconductor storage device exchanging commands and data with an external system, the semiconductor storage device being equipped with flash memories each having a limited size of a spare storage area, said system comprising:
an error decision unit for judging whether or not an error occurs during writing of data;
a replacing unit for rewriting data to the spare storage area when said error decision unit judges that an error occurs;
a spare area size calculating unit for calculating a remaining size of the spare storage area after the data has been re-written to the spare storage area;
a spare area checking unit for comparing the remaining size of the spare storage area with a predetermined value; and
a warning generator for generating a warning when the remaining size of the spare storage area is smaller than the predetermined value.
8. A warning generating method of a semiconductor storage device equipped with flash memories each having a limited size of a spare storage area, the method comprising:
judging whether or not an error occurs during writing of data;
rewriting data to the spare storage area when it is judged that an error occurs;
calculating a remaining size of the spare storage area after the data has been re-written to the spare storage area;
comparing the remaining size of the spare storage area with a predetermined value; and
generating a warning when the remaining size of the spare storage area is smaller than the predetermined value.
9. A semiconductor storage device equipped with flash memories each having a limited number of rewriting operations to be subjected and each flash memory being provided with a spare storage area for replacing a defective portion caused in writing data, said semiconductor storage device comprising:
an error decision unit for judging whether or not an error occurs in a defective portion during a data writing operation;
a replacing unit for replacing the defective portion by the spare storage area to write the data when the error decision unit judges that an error occurs;
a command receiving unit for receiving a remaining number examination command from an external equipment requesting an examination of a remaining size of the spare storage area;
a remaining spare size calculating unit for calculating a remaining size in number of the spare storage area in response to the remaining number examination command after the data has been written to the spare storage area; and
a spare area checking unit for comparing the calculated remaining size of the spare storage area with a predetermined value.
10. The semiconductor storage device according to claim 9, wherein each of the flash memories a sector arrangement in which data is rewritable in sector units and each flash memory includes a management area (31) for saving a logic-to-physic conversion table which indicates a distribution of good sectors of each flash memory, a user area for saving user data, and a spare storage area having spare sectors which replace defective sectors, and wherein the start addresses of the user area and the spare storage area are written in the management area, and wherein a flag data indicative of an attribute of each sector is saved in a specified byte position in each sector.
11. The semiconductor storage device according to claim 9, wherein entry and response procedure of the remaining number examination command is based on a non-data transfer command protocol.
12. The semiconductor storage device according to claim 9, wherein, in response to the remaining number examination command, the remaining spare size calculating unit obtains the minimum of count numbers of good sectors existing in the spare storage areas of the entire flash memories and determines the minimum as the remaining number of the spare sectors of the semiconductor storage device and when the remaining number of the spare sectors is smaller than the predetermined value, the remaining number of the spare sectors is notified to the external equipment.
13. The semiconductor storage device according to claim 9, wherein, in response to the remaining number examination command, a particular code indicative of a consumption condition of the spare sectors is delivered.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A Multiple-input Multiple-Output (MIMO) receiver, comprising:
a parameterized sphere detector having two search modes,
wherein, during a first search mode, the parameterized sphere detector enumerates a number of best candidate vectors up to a fixed parameter value, and
wherein, during a second search mode, the parameterized sphere detector enumerates additional candidate vectors using a greedy search until a predetermined number of candidate vectors have been enumerated.
2. The MIMO receiver of claim 1 wherein the parameterized sphere detector uses a breadth-first tree-search algorithm to search for candidate vectors during the first search mode.
3. The MIMO receiver of claim 1 wherein the parameterized sphere detector stores and updates a table having enumerated candidate vectors and their associated costs.
4. The MIMO receiver of claim 3 wherein the parameterized sphere detector sorts the enumerated candidate vectors stored in the table based on their associated costs.
5. The MIMO receiver of claim 1 wherein the parameterized sphere detector computes and stores a partial score for a branch corresponding to one of the best candidate vectors.
6. The MIMO receiver of claim 1 wherein the parameterized sphere detector overwrites a stored leaf node score if a better leaf node score is computed.
7. The MIMO receiver of claim 1 wherein the parameterized sphere detector prevents enumeration of leaf nodes from a given sub-tree if more than a threshold number of leaf nodes have been enumerated for that sub-tree.
8. The MIMO receiver of claim 1 wherein, if a previous enumerated leaf node came from a partial path, the parameterized sphere detector enumerates another partial path for a first symbol as long as a maximum number of candidate vectors for the first symbol have not been enumerated.
9. The MIMO receiver of claim 1 wherein the parameterized sphere detector uses independent sphere detectors on each sub-tree to enumerate candidate vectors.
10. The MIMO receiver of claim 1 wherein the parameterized sphere detector uses independent parameterized sphere detectors on each sub-tree and enumerates one leaf node at a time.
11. The MIMO receiver of claim 1 wherein the parameterized sphere detector uses different independent tree-search algorithms for different sub-trees.
12. The MIMO receiver of claim 1 wherein the parameterized sphere detector calculates candidate vectors in series.
13. The MIMO receiver of claim 1 wherein the parameterized sphere detector calculates candidate vectors in parallel.
14. The MIMO receiver of claim 13 wherein n candidate vectors are simultaneously computed from n unique parameterized sphere detectors applied to different sub-trees.
15. The MIMO receiver of claim 1 wherein parameterized sphere detector sorts and indexes the leaf node costs.
16. The MIMO receiver of claim 1 wherein the parameterized sphere detector is configured to operate based on two equalized inputs.
17. The MIMO receiver of claim 1 wherein the parameterized sphere detector recursively applies at least one parameterized sphere detector configured to handle two equalized inputs.
18. A method, comprising:
initializing a parameterized sphere detector to enumerate a fixed number of best candidate vectors before beginning a greedy search; and
enumerating additional candidate vectors with the greedy search.
19. The method of claim 18 wherein said initializing involves a breadth-first tree-search algorithm.
20. The method of claim 18 further comprising storing and sorting enumerated candidate vectors based on their associated costs.
21. The method of claim 18 further comprising recursively applying at least one parameterized sphere detector configured to handle two equalized inputs.