Integrated memory device and method of operating a memory device

• US 20080028148A1
• Filed: 07/31/2006
• Published: 01/31/2008
• Est. Priority Date: 07/31/2006
• Status: Abandoned Application

• Current Assignee: Infineon Technologies AG
• Original Assignee: Infineon Technologies AG
• Inventors: Wallner, Paul, Dudha, Chaitanya
• Application Number:
  US11/496,261
• Publication Number:
  US 20080028148A1
• Time in Patent Office: Days
• US Class Current: 711/118
• CPC Class Codes: G06F 12/023 Free address space management

Abstract

An integrated memory device includes a memory core having a plurality of memory cells and a group of terminals for communication between the memory device and an external electronic device. A data buffer temporarily stores data. The data buffer is coupled to the group of terminals and to the memory core. The data buffer includes a plurality of data buffer sections. Each data buffer section is capable of temporarily storing at least one data frame and being accessible by a respective data buffer address. A data buffer control unit is also provided.

Claims

1. An integrated memory device comprising:

a memory core having a plurality of memory cells;

a group of terminals for communication between the memory device and an external electronic device;

a data buffer for temporary storage of data, the data buffer being coupled to the group of terminals and to the memory core, the data buffer comprising a plurality of data buffer sections, each data buffer section being capable of temporarily storing at least one data frame and being accessible by a respective data buffer address; and

a data buffer control unit;

wherein the memory device is constructed to generate, for each data buffer section, at least one data bit assigned to the respective data buffer section, the data bit indicating whether the respective data buffer section comprises empty data buffer area for storing at least one data frame or whether the respective data buffer section is occupied; and

wherein the data buffer control unit is constructed to calculate, using the data bits assigned to the data buffer sections, a data buffer address of a data buffer section to which data frames are transmitted for being stored temporarily.

2. The memory device of claim 1, wherein the memory device is constructed to write data frames into those data buffer sections that correspond to a data buffer address calculated by the data buffer control unit using the data bits.

3. The memory device of claim 1, wherein the data buffer control unit combines data bits of all data buffer sections when calculating the data buffer address in which data frames are to be stored.

4. The memory device of claim 1, wherein the memory device, prior to writing a data frame into the data buffer, instructs the data buffer control unit to calculate a data buffer address of a data buffer section to which a data frame is transmitted.

5. The memory device of claim 1, wherein each data buffer section is capable of storing a plurality of data frames.

6. The memory device of claim 1, wherein the data buffer comprises data buffer sections corresponding to data buffer address numbers forming a predefined order, the predefined order of the data buffer address numbers ranging from a first data buffer address number to a last data buffer address number or vice versa.

7. The memory device of claim 6, wherein the data buffer control unit combines the data bits such that a smallest or a largest data buffer address number that corresponds to a data buffer section not yet completely occupied with data frames is calculated.

8. The memory device of claim 7, wherein the memory device, for temporarily storing a data frame in the data buffer, transmits the data frame to that data buffer section that corresponds to the smallest data buffer address number.

9. The memory device of claim 7, wherein the memory device, for temporarily storing a data frame in the data buffer, transmits the data frame to that data buffer section that corresponds to the largest data buffer address number.

10. The memory device of claim 1, wherein an input of the data buffer is coupled to the plurality of terminals and wherein an output of the data buffer is connected to the memory core.

11. The memory device of claim 10, wherein the memory device writes data frames received via a plurality of terminals into the data buffer.

12. The memory device of claim 10, wherein the memory device transmits data to be stored in the memory core from the data buffer to the memory core.

13. The memory device of claim 1, wherein an input of the data buffer is coupled to the memory core and wherein an output of the data buffer is connected to the plurality of terminals.

14. The memory device of claim 1, wherein the memory device further comprises a data frame decoder for decoding data frames received via the plurality of terminals.

15. The memory device of claim 1, wherein the data buffer control unit comprises an address pointer supplying data buffer addresses calculated by the data buffer control unit using the data bits assigned to the data buffer sections.

16. The memory device of claim 1, wherein the memory device reads all data frames stored in a particular data buffer section when performing an operation of writing of data from a data buffer address into the memory core.

17. The memory device of claim 1, wherein the memory device comprises a volatile memory device.

18. The memory device of claim 17, wherein the memory device comprises a dynamic random access memory device.

19. The memory device of claim 18, wherein the memory cells each comprise a selection transistor and a storage capacitor.

20. The memory device of claim 1, wherein the memory cells are coupled to bitlines and wordlines.

21. The memory device of claim 1, wherein

the data buffer addresses are represented by data buffer address numbers, the data buffer address numbers of the data buffer sections constituting a predefined order of data buffer address numbers;

and

wherein the memory device combines the data bits with one another, thereby calculating a data buffer address number that represents, within the predefined order of data buffer address numbers, a first data buffer address number corresponding to a data buffer section that comprises empty data buffer area for storing at least one data frame.

22. The memory device of claim 21, wherein the memory device combines the data bits with one another by means of Boolean operators.

23. The memory device of claim 21, wherein the data bits assigned to the data buffer sections are constituting a level of hierarchy of the order 0, and wherein two respective data bits of the level of hierarchy of the order 0 are combined with one another, thereby obtaining one respective data bit of a level of hierarchy of the order 1.

24. The memory device of claim 21, wherein the memory device, for calculating the data buffer address number consecutively combines the data bits of same, further levels of hierarchy, so as to obtain data bits of further levels of hierarchy, thereby combining two data bits of the level of hierarchy of the order n to obtain one data bit of a level of hierarchy of the order n+1.

25. The memory device of claim 24, wherein the memory device, for calculating a data buffer address number, combines two data bits of a penultimate level of hierarchy to obtain one data bit of an ultimate level of hierarchy of the order N.

26. The memory device of claim 21, wherein the memory device assigns a plurality of N data buffer address numbers to the data buffer addresses of a plurality of N data buffer sections and wherein the memory device combines the data bits of the level of hierarchy of the order 0 consecutively, thereby generating data bits of N levels of hierarchy.

27. The memory device of claim 21, wherein the data buffer address numbers constitute a numerical order of data buffer address numbers.

28. The memory device of claim 27, wherein the numerical order of data buffer address numbers ranging between a smallest data buffer address number and a largest data buffer address number.

29. The memory device of claim 28, wherein the numerical order of data buffer address numbers start with the smallest data buffer address number and ends with the largest data buffer address number or vice versa.

30. The memory device of claim 21, wherein the memory device, for calculating a data buffer address number, attributes, to one respective data bit of each level of hierarchy of an order higher than 0, one of the data bits having been combined, thereby resulting in the respective data bit of the higher level of hierarchy, wherein the memory device for each attribution of a particular level of hierarchy uses that one of the two combined data bits of the lower level of hierarchy that corresponds to a data buffer address number occurring first, within the predefined order of data buffer address numbers, compared to the data buffer address number represented by the other one of the two combined data bits.

31. The memory device of claim 30, wherein, for each attribution to a data bit of a level of hierarchy of an order n+1, that data bit of the two respective data bits of the level of hierarchy of the order n is attributed that corresponds to the smaller data buffer address number compared to the data buffer address number of the other data bit combined therewith.

32. The memory device of claim 30, wherein, for each attribution to a data bit of a level of hierarchy of an order n+1, that data bit of the two respective data bits of the level of hierarchy of the order n is attributed that corresponds to the larger data buffer address number compared to the data buffer address number of the other data bit combined therewith.

33. The memory device of claim 30, wherein the memory device assigns to each level of hierarchy of an order n of a factor represented by 2ⁿ.

34. The memory device of claim 33, wherein the memory device obtains the data buffer address number to be calculated by multiplying each factor 2ⁿ assigned to a level of hierarchy of the order n with the data bit assigned to one of the data bits of the level of hierarchy of the order n, thereby yielding a respective product, and by forming the sum of the products for plural levels of hierarchy.

35. The memory device of claim 33, wherein in each level of hierarchy the factor of 2ⁿ is multiplied with only one attributed data bit, thereby obtaining a contribution of the respective level of hierarchy to the data buffer address number to be calculated, and wherein the sum over contributions of plural levels of hierarchy is formed, thereby resulting in the data bufer address number to be calculated.

36. The memory device of claim 35, wherein forming the sum to obtain the data buffer address number to be calculated is started with an ultimate level of hierarchy of the order N and wherein the data bit attributed to the data bit of the ultimate level of hierarchy and resulting from the penultimate level of hierarchy is used for selecting the attributed data bit of which one of the data bits of the penultimate level of hierarchy of the order N−

1 is used for further calculating the data buffer address number to be calculated.

37. The memory device of claim 33, wherein forming the sum to obtain the data buffer address number to be calculated is continued with consecutively selecting one respective data bit of a next lower level of hierarchy of an order n−

1, the selection depending on the numerical value of the data bit attributed to a data bit of the respective, next higher level of hierarchy.

38. The memory device of claim 37, wherein, for plural levels of hierarchy, a respective factor of 2ⁿ is multiplied with a respective attributed data bit, thereby obtaining products for the respective levels of hierarchy, and wherein the products are added to one another, thereby obtaining the data buffer address number assigned to the data buffer section capable of storing at least one data frame.

39. A method of operating a memory device comprising a data buffer having a plurality of data buffer sections accessible by data buffer addresses, the method comprising:

assigning to each data buffer section a data buffer address, the data buffer addresses being represented by data buffer address numbers and the data buffer address numbers of the data buffer sections constituting a predefined order of data buffer address numbers;

generating for each data buffer section at least one data bit assigned to the respective data buffer section, the data bits indicating whether the respective data buffer section comprises empty data buffer area for storing at least one data frame or whether the respective data buffer section is occupied; and

combining the data bits with one another, thereby calculating a data buffer address number that represents, within the predefined order of data buffer address numbers, a first data buffer address number corresponding to a data buffer section that comprises empty data buffer area for storing at least one data frame.

40. The method of claim 39, wherein the data bits are combined with one another by means of Boolean operators.

41. The method of claim 39, wherein the data bits assigned to the data buffer sections are constitute a level of hierarchy of the order 0, and wherein two respective data bits of the level of hierarchy of the order 0 are combined with one another, thereby obtaining one respective data bit of a level of hierarchy of the order 1.

42. The method of claim 41, wherein calculating the data buffer address number comprises consecutively combining the data bits of same, further levels of hierarchy, so as to obtain data bits of further levels of hierarchy, thereby combining two data bits of the level of hierarchy of the order n to obtain one data bit of a level of hierarchy of the order n+1.

43. The method of claim 39, wherein calculating a data buffer address number includes combining two data bits of a penultimate level of hierarchy to obtain one data bit of an ultimate level of hierarchy of the order N.

44. The method of claim 39, wherein a plurality of N data buffer address numbers is assigned to the data buffer addresses of a plurality of N data buffer sections and wherein combining the data bits of the level of hierarchy of the order 0 are consecutively combined, thereby generating data bits of N levels of hierarchy.

45. The method of claim 39, wherein the data buffer address numbers constitute a numerical order of data buffer address numbers.

46. The method of claim 45, wherein the numerical order of data buffer address numbers range between a smallest data buffer address number and a largest data buffer address number.

47. The method of claim 46, wherein the numerical order of data buffer address numbers starts with the smallest data buffer address number and ends with the largest data buffer address number or vice versa.

48. The method of claim 39, wherein calculating a data buffer address number further includes attributing, to one respective data bit of each level of hierarchy of an order higher than 0, one of the data bits having been combined, thereby resulting in the respective data bit of the higher level of hierarchy, wherein for each attribution of a particular level of hierarchy that one of the two combined data bits of the lower level of hierarchy is used that corresponds to a data buffer address number occurring first, within the predefined order of data buffer address numbers, compared to the data buffer address number represented by the other one of the two combined data bits.

49. The method of claim 48, wherein, for each attribution to a data bit of a level of hierarchy of an order n+1, that data bit of the two respective data bits of the level of hierarchy of the order is attributed that corresponds to the smaller data buffer address number compared to the data buffer address number of the other data bit combined therewith.

50. The method of claim 48, wherein, for each attribution to a data bit of a level of hierarchy of an order n+1, that data bit of the two respective data bits of the level of hierarchy of the order n is attributed that corresponds to the larger data buffer address number compared to the data buffer address number of the other data bit combined therewith.

51. The method of claim 48, wherein to each level of hierarchy of an order n of a factor represented by 2ⁿ is assigned.

52. The method of claim 51, wherein the data buffer address number to be calculated is obtained by multiplying each factor 2ⁿ assigned to a level of hierarchy of the order n with the data bit assigned to one of the data bits of the level of hierarchy of the order n, thereby obtaining a respective product, and by forming the sum of the products for plural levels of hierarchy.

53. The method of claim 51, wherein in each level of hierarchy the factor of 2ⁿ is multiplied with only one attributed data bit, thereby obtaining a contribution of the respective level of hierarchy to the data buffer address number to be calculated, and wherein the sum over contributions of plural levels of hierarchy is formed, thereby resulting in the data buffer address number to be calculated.

54. The method of claim 39, wherein forming the sum to obtain the data buffer address number to be calculated starts with an ultimate level of hierarchy of the order N and wherein the data bit attributed to the data bit of the ultimate level of hierarchy and resulting from the penultimate level of hierarchy is used for selecting the attributed data bit of which one of the data bits of the penultimate level of hierarchy of the order N−

1 is used for further calculating the data buffer address number to be calculated.

55. The method of claim 51, wherein forming the sum to obtain the data buffer address number to be calculated is continued with consecutively selecting one respective data bit of a next lower level of hierarchy of an order n−

1, the selection depending on the numerical value of the data bit attributed to a data bit of the respective, next higher level of hierarchy.

56. The method of claim 55, wherein, for plural levels of hierarchy a respective factor of 2ⁿ is multiplied with a respective attributed data bit, thereby obtaining products for the respective levels of hierarchy, and wherein the products are added to one another, thereby obtaining the data buffer address number assigned to the data buffer section capable of storing at least one data frame.

57. The method of claim 39, wherein the Boolean operators are one of AND-operators, NAND-operators, OR-operators or NOR-operators.

58. The method of claim 57, wherein the Boolean operators are AND-operators.