Abstract:
The present invention discloses a three-dimensional offset-printed memory (3D-oP). Compared with a conventional three-dimensional mask-programmed read-only memory (3D-MPROM), it has a lower data-mask count and thereby a lower data-mask cost. The mask-patterns for different memory levels/bits-in-a-cell are merged onto a multi-region data-mask. At different printing steps, a wafer is offset by different values with respect to said data-mask. Accordingly, data-patterns are printed into different memory levels/bits-in-a-cell from a same data-mask.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a continuation of application “Three-Dimensional Offset-Printed Memory”, application Ser. No. 13/599,085, filed Aug. 30, 2012, which relates to a provisional application, “Three-Dimensional Offset-Printed Memory”, Application Ser. No. 61/529,920, filed Sep. 1, 2011. 
     
    
     BACKGROUND 
       [0002]    1. Technical Field of the Invention 
         [0003]    The present invention relates to the field of integrated circuit, and more particularly to mask-programmed read-only memory (mask-ROM). 
         [0004]    2. Prior Arts 
         [0005]    Three-dimensional mask-programmed read-only memory (3D-MPROM) has the potential to replace DVD and Blu-Ray Discs. It is ideal for mass publication. U.S. Pat. No. 5,835,396 discloses a 3D-MPROM. It is a monolithic semiconductor memory. As illustrated in  FIG. 1 , a typical 3D-MPROM comprises a semiconductor substrate 0 and a 3-D stack  10  stacked above. The 3-D stack  10  comprises M (M≧2) vertically stacked memory levels (e.g.  10 A,  10 B). Each memory level (e.g.  10 A) comprises a plurality of upper address lines (e.g.  2   a ), lower address lines (e.g.  1   a ) and memory cells (e.g.  5   aa ). Each memory cell stores n (n≧1) bits. Memory levels (e.g.  10 A,  10 B) are coupled to the substrate  0  through contact vias (e.g.  1   av,    1   av ′). The substrate circuit  0 X in the substrate  0  comprises a peripheral circuit for the 3-D stack  10 . Hereinafter, xMxn 3D-MPROM denotes a 3D-MPROM comprising M memory levels with n bits-per-cell (bpc). 
         [0006]    3D-MPROM is a diode-based cross-point memory. Each memory cell (e.g.  5   aa ) typically comprises a diode  3   d.  The diode  3   d  can be broadly interpreted as any device whose electrical resistance at the read voltage is lower than that when the applied voltage has a magnitude smaller than or polarity opposite to that of the read voltage. Each memory level (e.g.  10 A) further comprises at least a data-coding layer (e.g.  6 A). The pattern in the data-coding layer is a data-pattern and it represents the digital data stored in the data-coding layer. In this figure, the data-coding layer  6 A is a blocking dielectric  3   b,  which blocks the current flow between the upper and lower address lines. Absence or existence of a data-opening (e.g.  6   ca ) in the blocking dielectric  3   b  indicates the state of a memory cell (e.g.  5   ca ). 
         [0007]    In prior arts, data-patterns for different memory levels are transferred from separate data-masks. Pattern-transfer is also referred to as “print”, transfers a data pattern from a data-mask to a data-coding layer. Hereinafter, “mask” can be broadly interpreted as any apparatus that carries the source image of the data to be printed.  FIGS. 2A-2B  illustrate two prior-art data-masks  4 A,  4 B. Each data-mask (e.g.  4 A) is comprised of an array of mask cells “aa”-“bd”. The mask-pattern (clear or dark) at each mask cell determines the existence or absence of a data-opening at the corresponding memory cell. For example, the mask-opening  4   ca  on the data-mask  4 A leads to a data-opening  6   ca  at cell  5   ca  of the memory level  10 A; the mask-openings  4 ′ aa,    4 ′ da  on the data-mask  4 B lead to data-openings  6 ′ aa,    6 ′ da  at cells  5 ′ aa,    5 ′ da  of the memory level  10 B. 
         [0008]    To further increase storage density, 3D-MPROM can store n (n&gt;1) bits-per-cell (bpc). U.S. patent application Ser. No. 12/785,621 discloses a large-bpc 3D-MPROM. As illustrated in  FIG. 3 , each memory cell (e.g.  5   aa ) stores two bits: Bit- 1  and Bit- 2 . Bit- 1  is physically implemented by an extra implant, while Bit- 2  is physically implemented by a resistive layer  3   r.  Hereinafter, j-th bit-in-a-cell denotes the j-th bit stored in an n-bpc cell (n≧j). For example, the 1 st  bit-in-a-cell in a 2-bpc cell is Bit- 1 ; the 2 nd  bit-in-a-cell in a 2-bpc cell is Bit- 2 . 
         [0009]    In prior arts, the data-patterns for different bits-in-a-cell (e.g. Bit- 1 , Bit- 2 ) are printed from separate data-masks.  FIGS. 4A-4B  illustrate two prior-art data-masks  4 C,  4 D. Each data-mask (e.g.  4 C) is comprised of an array of mask cells “aa”-“bd”. The mask-pattern (clear or dark) at each mask cell determines the existence or absence of the extra implant or the resistive layer at the corresponding memory cell. For example, the mask-opening  4   xa * on the data-mask  4 C leads to the extra-implanted layer  3   i  at cells  5   ca,    5   da;  the mask-openings  4 ′ ba*,    4 ′ da * on the data-mask  4 D lead to the removal of the resistive layer  3   r  at cells  5   ba,    5   da.    
         [0010]    Prior arts generally require M×n data-masks for an xMxn 3D-MPROM, because each memory level and each bit-in-a-cell need a separate data-mask. At 22 nm node, each data-mask costs ˜$250 k (hereinafter, k=1,000). Accordingly, the data-mask set of an x8x2 3D-MPROM, including 16 (=8×2) data-masks, will cost ˜$4 million. This high data-mask cost will hinder widespread applications of the 3D-MPROM. To lower the data-mask cost, the present invention discloses a three-dimensional offset-printed memory (3D-oP). 
       Objects and Advantages 
       [0011]    It is a principle object of the present invention to provide a 3D-MPROM with a lower data-mask cost. 
         [0012]    It is a further object of the present invention to provide a method to reduce the total number of data-masks of the 3D-MPROM. 
         [0013]    In accordance with these and other objects of the present invention, a three-dimensional offset-printed memory (3D-oP) is disclosed. 
       SUMMARY OF THE INVENTION 
       [0014]    The present invention discloses a three-dimensional offset-printed memory (3D-oP). 3D-oP is an improved 3D-MPROM. It records data with an offset-printing means. To realize offset-printing, the mask-patterns for a plurality of memory levels and/or bits-in-a-cell are merged onto a multi-region data-mask. At different printing steps, the wafer is offset by different values with respect to the multi-region data-mask. Accordingly, data-patterns are printed into data-coding layers for different memory levels/bits-in-a-cell from the same data-mask. Offset-printing lowers the total data-mask count and therefore, lowers the total data-mask cost. 
         [0015]    In a 3D-oP batch, all dice are printed from the same data-masks. Although different dice may have different data-array sequence, all dice have a same data-array set. Here, a data-array is an array of digital values represented by a data-coding layer at each cell location; the data-array sequence is an ordered list of all data-arrays in a 3D-oP die, e.g. from the one closet to the substrate to the one farthest from the substrate; and a data-array set is a collection of all data-arrays in a 3D-oP die. 
         [0016]    To make the difference in the data-array sequence transparent to users, 3D-oP preferably comprises a configurable-input/output (I/O) means. It changes inputs/outputs according to the data-array sequence of the 3D-oP die. Compared with a reference 3D-oP die, if the data-array sequence for two memory levels in a 3D-oP die of interest is reversed, the programmable-I/O changes at least a portion of its input address; if the data-array sequence for two bits-in-a-cell in this 3D-oP die is reversed, the programmable-I/O changes the bit-order of at least a portion of its output. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0017]      FIG. 1  is a cross-sectional view of a x2x1 3D-MPROM along the cut-line AA′ of  FIGS. 2A-2B ; 
           [0018]      FIGS. 2A-2B  disclose two data-masks for the x2x1 3D-MPROM in prior arts; 
           [0019]      FIG. 3  is a cross-sectional view of a x1x2 3D-MPROM along the cut-line BB′ of  FIGS. 4A-4B ; 
           [0020]      FIGS. 4A-4B  disclose two data-masks for the x1x2 3D-MPROM in prior arts; 
           [0021]      FIGS. 5A-5B  illustrate the printing steps used in a preferred offset-printing means; 
           [0022]      FIG. 6  discloses an exemplary multi-region data-mask; 
           [0023]      FIGS. 7A-7B  disclose the data-arrays m(1), m(2) represented by the two data-mask regions on the multi-region data-mask; 
           [0024]      FIGS. 8A-8B  are the cross-sectional views of two 3D-oP dice  18   a,    18   b  from a preferred x2x1 3D-oP batch; 
           [0025]      FIGS. 9A-9B  disclose two data-arrays p 18a [1], p 18a [2] for the two memory levels  16 A,  16 B of the 3D-oP die  18   a;    
           [0026]      FIGS. 11A-10B  are the cross-sectional views of two dice  18   c,    18   d  from a preferred x1x2 3D-oP batch; 
           [0027]      FIGS. 11A-11B  disclose two data-arrays p 18c [1,1], p 18c [1,2] for Bit- 1 , Bit- 2  of the die  18   c;    
           [0028]      FIG. 12  is a circuit block diagram of a preferred 3D-oP; 
           [0029]      FIG. 13A  is a circuit block diagram for the preferred x2x1 3D-oP;  FIG. 13B  is a circuit block diagram for the preferred x1x2 3D-oP; 
           [0030]      FIG. 14  is a cross-sectional view of a preferred x2x2 3D-oP; 
           [0031]      FIG. 15  illustrates a multi-region data-mask for the preferred x2x2 3D-oP and all dice in an exposure field; 
           [0032]      FIG. 16  is a table listing each data-array in each die after each printing step for the preferred x2x2 3D-oP; 
           [0033]      FIG. 17  is a circuit block diagram of the preferred x2x2 3D-oP; 
           [0034]      FIG. 18  is a cross-sectional view of a preferred x3x3x1 3D 2 -oP; 
           [0035]      FIG. 19  is a circuit block diagram of the preferred 3D 2 -oP; 
           [0036]      FIG. 20  illustrates a multi-region data-mask for the preferred 3D 2 -oP and all dice in an exposure field; 
           [0037]      FIG. 21  is a table listing each data-array in each die after each printing step for the preferred 3D 2 -oP; 
           [0038]      FIG. 22  is a table listing three types of packages in a 3D 2 -oP batch. 
       
    
    
       [0039]    It should be noted that all the drawings are schematic and not drawn to scale. Relative dimensions and proportions of parts of the device structures in the figures have been shown exaggerated or reduced in size for the sake of clarity and convenience in the drawings. The same reference symbols are generally used to refer to corresponding or similar features in the different embodiments. 
       DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0040]    Those of ordinary skills in the art will realize that the following description of the present invention is illustrative only and is not intended to be in any way limiting. Other embodiments of the invention will readily suggest themselves to such skilled persons from an examination of the within disclosure. 
         [0041]    In order to reduce the total number of data-masks, the present invention discloses a three-dimensional offset-printed memory (3D-oP). It records data with an offset-printing means. Offset-printing is a printing means. Major printing means includes photo-lithography and imprint-lithography (referring to the co-pending U.S. Pat. App. 61/529,919, “Three-Dimensional Printed Memory”): photo-lithography uses data-masks to print data, whereas imprint-lithography uses data-templates (also referred to as master, stamp, or mold) to print data. 
         [0042]    Referring now to  FIGS. 5A-5B , an overview of the offset-printing means is disclosed. It uses a multi-region data-mask  8 . In this example, this multi-region data-mask  8  comprises the mask-patterns for two different memory levels  16 A,  16 B. They are located in the data-mask regions  8   a,    8   b,  respectively. 
         [0043]    The preferred offset-printing means comprises two printing steps. At the 1 st  printing step ( FIG. 5A , i.e. lithography A to code the first memory level  16 A), the origin O 18a  of the die  18   a  is aligned to the origin O M  of the data-mask region  8   a.  During exposure E 1a , the data-mask regions  8   a  is printed to the data-coding layer  6 A for the memory level  16 A of the dice  18   a,  while the data-mask regions  8   b  is printed to the data-coding layer  6 A for the memory level  16 A of the dice  18   b.    
         [0044]    At the 2 nd  printing step ( FIG. 5B , i.e. lithography B to code the second memory level  16 B), the alignment position of the wafer  9  is offset by a value of Δ y  from its alignment position at the 1 st  printing step. Let d y  be the displacement between the dice  18   a  and  18   b.  If Δ y =Δ y , the origin O 18b  of the die  18   b  is aligned to origin O M . During exposure E 2a , the data-mask region  8   a  is printed to the data-coding layer  6 B for the memory level  16 B of the die  18   b.    
         [0045]    During the next exposure E 2b , as long as the stepping distance D y  is twice the displacement d y  between adjacent dice, the data-mask region  8   b  will be printed to the data-coding layer  6 B for the memory level  16 B of the die  18   a.  Finally, on the finished wafer  9 , in the die  18   a,  the data-mask regions  8   a,    8   b  are printed to the data-coding layers  6 A,  6 B for the memory levels  16 A,  16 B, respectively; while in the die  18   b,  they are printed to the data-coding layers  6 B,  6 A for the memory levels  16 B,  16 A, respectively. 
         [0046]      FIG. 6  discloses more details on an exemplary multi-region data-mask  8 . Each of its data-mask regions  8   a,    8   b  is comprised of an array of mask cells “aa”-“bd”. In the data-mask region  8   a,  the clear mask-patterns at the mask cells “ca”, “bb”, “ab” form mask-openings  8   ca,    8   xb.  In the data-mask region  8   b,  the clear mask-patterns at the mask cells “aa”, “da”, “bb” form mask-openings  8   aa,    8   da,    8   bb.  If the following convention is used: the dark mask-pattern represents ‘0’ and the clear mask-pattern represents ‘1’, the digital values represented by each mask cell in the data-mask region  8   a  form a data-array m(1) ( FIG. 7A ), while the digital values represented by each mask cell in the data-mask region  8   b  form a data-array m(2) ( FIG. 7B ). 
         [0047]    Referring now to  FIGS. 8A-8B , two dice  18   a,    18   b  from a preferred x2x1 3D-oP batch are disclosed. In a 3D-oP batch, all dice are manufactured with the same mask set, and all dice have the same 3-D frame. Here, a 3-D frame comprises all address lines in the 3-D stack, but no data-coding layer. In this example, the data for both dice  18   a  and  18   b  are printed from the same data-mask  8 .  FIG. 8A  discloses the x2x1 3-D stack  16   a  of the die  18   a.  The data-coding layer  6 A of the memory level  16 A is printed from the data-mask region  8   a,  while the data-coding layer  6 B of the memory level  16 B is printed from the data-mask region  8   b.  Here, the following convention is used: absence of a data-opening represents ‘0’ and existence of a data-opening represents ‘1’. Accordingly, in the 3D-oP die  18   a,  the digital values stored in all memory cells in the memory level  16 A form a data-array p 18a [1] of  FIG. 9A ; the digital values stored in all memory cells in the memory level  16 B form a data-array p 18a [2] of  FIG. 9B . It can observed that the data-array p 18a [1] is same as the mask data-array m(1) of  FIG. 7A , i.e. p 18a [1]=m(1); and, the data-array p 18a [2] is same as the mask data-array m(2) of  FIG. 7B , i.e. p 18a [2]=m(2). 
         [0048]    On the other hand,  FIG. 8B  discloses the x2x1 3-D stack  16   b  of the die  18   b.  The data-coding layer  6 A of the memory level  16 A is printed from the data-mask region  8   b,  while the data-coding layer  6 B of the memory level  16 B is printed from the data-mask region  8   a.  Similarly, for die  18   b,  p 18a [1]=m(2), p 18a [2]=m(1). 
         [0049]    In a 3D-oP batch, an ordered list (e.g. from the one closet to the substrate to the one farthest from the substrate) of all data-arrays (including the arrays for all memory levels and all bits-in-a-cell) in each 3D-oP die forms a data-array sequence S. A collection of these data-arrays forms a data-array set. By definition, the value of a set is only related to its elements, not the order of these elements. For the dice  18   a,    18   b  of  FIGS. 8A-8B , their data-array sequence can be expressed as: 
         [0000]      { S   18a   }={p   18a [1 ],p   18a [2 ]}={m (1), m (2)}; 
         [0000]      { S   18b   }={p   18b [1 ],p   18b [2 ]}={m (2), m (1)}; 
         [0000]      with {S 18a }={S 18b }, but S 18a ≠S 18b .
 
         [0000]    It can be observed that, the data-array set of the die  18   a  is same as that of the die  18   b,  while the data-array sequence of the die  18   a  is a reverse of that of the die  18   b.  To access the same data, different memory level needs to be accessed in the die  18   b  than that in the die  18   a.    
         [0050]    Referring now to  FIGS. 10A-10B , offset-printing can also be applied to the 3D-MPROM with n bits-per-cell (bpc). Similarly, the mask-patterns for two different bits-in-a-cell are merged onto a multi-region data-mask. At different printing steps, the wafer is offset by different values with respect to the multi-region data-mask. Accordingly, various data-patterns from the same data-mask are printed into data-coding layers for different bits-in-a-cell. Two x1x2 3D-oP dice  18   c,    18   d  from a preferred 3D-oP batch are illustrated in  FIG. 10A-10B . 
         [0051]      FIG. 10A  discloses an x1x2 3-D stack  16   c  of die  18   c.  Each memory cell (e.g.  5   aa ) in the memory level  16 A stores two bits: Bit- 1  and Bit- 2 . Bit- 1  is represented by a first data-coding layer  6 C, i.e. an extra-implanted layer  3   i;  Bit- 2  is represented by a second data-coding layer  6 D, i.e. a resistive layer  3   r.  The data-coding layer  6 C of Bit- 1  is printed from the data-mask region  8   a,  while the data-coding layer  6 D of Bit- 2  is printed from the data-mask region  8   b.  Here, the following convention is used: existence of an extra implant represents ‘0’ and absence of an extra implant represents ‘1’; existence of the resistive layer represents ‘0’ and absence of the resistive layer represents ‘1’. Accordingly, in the first memory level  16 C of the 3D-oP die  18   c,  the digital values stored by Bit- 1  form the data-array p 18c [1,1] of  FIG. 11A ; the digital values stored by Bit- 2  form the data-array p 18c [1,2] of  FIG. 11B . Here, p[i,j] means the data-array for j th -bit-in-a-cell on the i st  memory level of the die  18   c.  It can be observed that, the data-array p 18c [1,1] is opposite to the data-array m(1) of  FIG. 7A , i.e. p 18c [1,1]=-m(1); the data-array p 18c [1,2] is equal to the data-array m(2) of  FIG. 7B , i.e. p 18c [1,2]=-m(2). Here, the symbol “-” means ‘0’, ‘1’ are interchanged. Because the digital values in a data-array could change with definition, the polarity of the data-array has little meaning. In the present invention, two data-arrays are considered same if each bit in the first data-array and its corresponding bit in the second data-array have the same or opposite values. 
         [0052]    On the other hand,  FIG. 10B  discloses an x1x2 3-D stack  16   d  of die  18   d.  In the first memory level  16 C of the die  18   d,  the data-coding layer  6 C for Bit- 1  is printed from the data-mask region  8   b,  while the data-coding layer  6 D for Bit- 2  is printed from the data-mask region  8   a.  Accordingly, for the die  18   d,  p 18d [1,1]=-m(2), p 18d [1,2]=m(1). 
         [0053]    For the dice  18   c  and  18   d  of  FIGS. 10A-10B , their data-array sequences can be expressed as: 
         [0000]        S   18c =( p   18c [1,1], p   18c [1,2])=(- m (1), m (2)); 
         [0000]        S   18d =( p   18d [1,1 ],p   18d [1,2])=(- m (2), m (1)); 
         [0000]      with {S 18c }={S 18d }, but S 18c ≠S 18d .
 
         [0000]    It can be observed that, the data-array set of the die  18   c  is same as that of the die  18   d,  while the data-array sequence of the die  18   c  is a reverse of that of the die  18   d.  For the same input address, the bit-order of the output needs to be reversed. 
         [0054]      FIG. 12  is a circuit block diagram of a preferred 3D-oP  18 . It comprises an xMxn 3-D stack  16  and a configurable-I/O means  24 . The 3-D stack  16  comprises Mxn data-arrays. Here, the data-array for the j-th bit-in-a-cell in the i-th memory level is denoted by p[i,j] (1≦i≦M, 1≦j≦n). The configurable-I/O means  24  comprises a sequence-memory  22 , which stores the information related to the data-array sequence of this 3D-oP die. One example of the sequence-related information is chip ID. Chip ID is directly related to the location of the die on a wafer and can be used to extract the information related to its data-array sequence. The sequence-memory  22  is preferably an embedded non-volatile writable memory. For example, it may use direct-write memory, laser-programmable fuse and/or electrically-programmable memory. For the direct-write memory, the sequence-related information can be written during manufacturing. For the laser-programmable fuse, the sequence-related information can be written during or after manufacturing. For the electrically-programmable memory, the sequence-related information can be written after manufacturing. 
         [0055]    The configurable-I/O means  24 , based on the sequence-related information, changes the input of the external I/O  28  and/or the output of the internal I/O  26  in such a way that the external I/O  26  shows no dependence on the data-array sequence. In other words, all 3D-oPs in the same batch, even though they might have different data-array sequence, appear to have the same external I/O  28  for users. More details on the 3D-oP circuit are disclosed in  FIGS. 13A-13B .  
         [0056]      FIG. 13A  is a circuit block diagram of the preferred x2x1 3D-oP  18  from  FIGS. 8A-8B . The input-address decoder  201  is shown in this figure. The 3-D stack  16  stores two data-arrays p[1], p[2] for the memory levels  16 A,  16 B, respectively. Here, the notation of data-arrays is simplified to p[i] (1≦i≦M) for the 1-bpc 3D-oP (i.e. each 3D-oP cell stores one bit). The input-address decoder  201  decodes the internal input address  26 . For example, if the most significant bit of the internal input address  26  is ‘0’, the data-array p[1] is accessed; otherwise p[2] is accessed. The configurable-I/O means  24  changes the value of the external input address  28  based on the sequence-related information: for the die  18   a,  the internal input address  26  is same as the external input address  28 ; for the die  18   b,  the most significant bit of the internal input address  26  is inverted from that of the external input address  28 . 
         [0057]      FIG. 13B  is a circuit block diagram of the preferred x1x2 3D-oP  18  from  FIGS. 10A-10B . The output buffer  200  is shown in this figure. The 3-D stack  16  stores two data-arrays p[1,1] and p[1,2] for Bit- 1  and Bit- 2 . The output buffer  200  comprises a plurality of output-groups  21 ,  21 ′ . . . . Each output-group stores outputs from all bits in a 3D-oP cell. For example, the output-group  21  comprises output-bits  21   a,    21   b,  with the output-bit  21   a  storing Bit- 1  and the output-bit  21   b  storing Bit- 2 , where Bit- 1  and Bit- 2  are from a same 3D-oP cell. The configurable-I/O means  24  changes the bit-order within each output-group  21  in the output buffer  200  based on the sequence-related information: for the die  18   c,  the external output  28  is same as the internal output  26 ; for the die  18   d,  the bit-order within each output-group (e.g.  21 ) is reversed. 
         [0058]    The technique of offset-printing to different memory levels ( FIGS. 8A-8B ) can be combined with the technique of offset-printing to different bits-in-a-cell ( FIGS. 10A-10B ). To be more specific, the mask-patterns for different memory levels and different bits-in-a-cell are merged onto a multi-region data-mask. At different printing steps, the wafer  is offset by different values with respect to the multi-region data-mask. Accordingly, various data-patterns from the same data-mask are printed into data-coding layers for different memory levels and different bits-in-a-cell.  FIG. 14  illustrates an example. This preferred x2x2 3D-oP  18   e  comprises two memory levels  16 A,  16 B with 2-bpc: Bit- 1 , Bit- 2 . There are a total of four data-coding layers. Their data-arrays are: p[1,1] for Bit- 1  in memory level  16 A; p[1,2] for Bit- 2  in memory level  16 A; p[2,1 ] for Bit- 1  in memory level  16 B; and p[2,2] for Bit- 2  in memory level  16 B. 
         [0059]    The left side of  FIG. 15  illustrates the multi-region data-mask  8  used for the preferred x2x2 3D-oP  18 . It comprises four data-mask regions whose mask data-arrays are m(1)-m(4). The origin of the multi-region data-mask is O M . The right side of  FIG. 15  illustrates all dice D[1]-D[4] in an exposure field E on a 3D-oP wafer  9 . Their origins are O 1 -O 4 , respectively. Because these dice D[1]-D[4] are offset-printed with the same data-mask  8 , they belong to the same 3D-oP batch. 
         [0060]      FIG. 16  is a table listing the data-array for each data-coding layer of each die after each printing step for the preferred 2×2 3D-oP  18 . Its third column lists the origin of the die to which O M  is aligned at each printing step. Four printing steps are required for four data-coding layers. At the 1 st  printing step (i.e. for p[1,1]), O M  is aligned to the origin O 1  of the die D[1] and the data-arrays p[1,1 ] of dice D[1]-D[4] are equal to m(1)-m(4), respectively. At the 2 nd  printing step (i.e. for p[1,2]), O M  is aligned to the origin O 2  of the die D[2]. As long as the stepping distance D along the y direction is twice as much as the die displacement d y  between D[2] and D[1], i.e. D y =2d y , the data-arrays p[1,2] of dice D[1]-D[4] are equal to m(2), m(1), m(4), m(3), respectively. At the 3 rd  printing step (i.e. for p[2,1]), O M  is aligned to the origin O 3  of the die D[3]. As long as the stepping distance D x  along the x direction is twice as much as the die displacement d x  between D[3] and D[1], i.e. D x =2d x , the data-arrays p[2,1] of dice D[1]-D[4] are equal to m(3), m(4), m(1), m(2), respectively. At  the 4 th  printing step (i.e. for p[2,2]), O M  is aligned to the origin O 4  of the die D[4]. As long as D y =2d y  and D x =2d x , the data-arrays p[2,2] of dice D[1]-D[4] are equal to m(4), m(3), m(2), m(1), respectively. 
         [0061]    In sum, for the dice D[1]-D[4] of  FIG. 15 , their data-array sequences can be expressed as: 
         [0000]        S   D[1] =( p   D[1] [1,1], p   D[1] [1,2], p   D[1] [2,1], p   D[1] [2,2])=( m (1), m (2), m (3), m (4)); 
         [0000]        S   D[2] =( p   D[2] [1,1 ],p   D[2] [1,2 ],p   D[2] [2,1], p   D[2] [2,2])=( m (2), m (1), m (4), m (3)); 
         [0000]        S   D[3] =( p   D[3] [1,1], p   D[3] [1,2], p   D[3] [2,1], p   D[3] [2,2])=( m (3), m (4), m (1), m (2)); 
         [0000]        S   D[4] =( p   D[4] [1,1], p   D[4] [1,2], p   D[4] [2,1], p   D[4] [2,2])=( m (4), m (3), m (2), m (1)); 
         [0000]      with {S D[1] }={S D[2] }={S D[3] }={S D[4] }, but S D[1] ≠S D[2] ≠S D[3] ≠S D[4] .
 
         [0000]    From these expressions, it can be observed that all 3D-oP dice D[1]-D[4] have the same data-array set, but can have different data-array sequences. 
         [0062]      FIG. 17  is a circuit block diagram of the preferred x2x2 3D-oP  18 . The input-address decoder  20 I and output buffer  200  are both shown in this figure. They have the same functions are those of  FIGS. 13A-13B . The 3-D stack  16  stores four data-arrays p[1,1]-p[2,2]. The configurable-I/O means  24  changes the value of the external input address  28  and/or the internal output  26  based on the sequence-related information: for the die D[1], no change is made; for the die D[2], the bit-order within each output-group (e.g.  21 ) in the output buffer  200  is reversed; for the die D[3], the most significant bit of the internal input address  26  is inverted from that of the external input address  28 ; for the die D[4], the most significant bit of the internal input address  26  is inverted from that of the external input address  28 , and the bit-order within each output-group (e.g.  21 ) in the output buffer  200  is reversed. 
         [0063]    The technique of offset-printing can not only be applied to the data-coding layers in a single die, but also be applied to the data-coding layers in a group of dice.  Accordingly, the present invention discloses a three-dimensional 3D-oP-based memory package (3D 2 -oP). The 3D 2 -oP package is often released in the form of a memory card. Similarly, the mask-patterns for a plurality of memory levels/bits-in-a-cell of a plurality of dice are merged onto a multi-region data-mask. At different printing steps, the wafer is offset by different values with respect to the data-mask. Accordingly, various data-patterns from the same data-mask are printed into data-coding layers for different memory levels/bits-in-a-cell of different dice in the 3D 2 -oP package. 
         [0064]      FIG. 18  illustrates a preferred x3x3x1 3D 2 -oP package  38 . Here, xKxMxn 3D 2 -oP package denotes a memory package comprising K vertically stacked xMxn 3D-oP dice. In this example, it comprises three 3D-oP dice C 1 -C 3 . They are vertically stacked on an interposer substrate  30  and form a 3D-oP stack  36 . Bond wires  32  connect dice C 1 -C 3  to the substrate  30 . To improve its data-security, the 3D 2 -oP package  38  is preferably filled with a molding compound  34 . 
         [0065]      FIG. 19  is a circuit block diagram of the preferred 3D 2 -oP package  38 . Its 3D-oP stack  36  stores nine data-arrays, i.e. three data-arrays p[1]-p[3] for each of the dice C 1 -C 3 . It also comprises a configurable-I/O means  24 , which has a similar function as that of  FIG. 17 . The configurable-I/O means  24  could be located in the 3D-oP die and/or the controller die. 
         [0066]    The left side of  FIG. 20  illustrates the multi-region data-mask  8  used for the preferred 3D 2 -oP package  38 . It comprises nine data-mask regions whose data-arrays are m(1)-m(9). The origin of the multi-region data-mask  8  is O M . The right side of  FIG. 20  illustrates all dice D[1]-D[9] in an exposure field E on a 3D-oP wafer  9 . The origins for dice D[1]-D[3] are O 1 -O 3 , respectively. 
         [0067]      FIG. 21  is a table listing the data-array for each data-coding layer of each dice after each printing step for the preferred 3D 2 -oP package  38 . Its third column lists the  origin of the die to which O M  is aligned at each printing step. Three printing steps are required for three data-coding layers. At the 1 st  printing step (i.e. for p[1]), O M  is aligned to the origin O 1  of the die D[1] and the data-arrays p[1] of dice D[1]-D[9] are equal to m(1)-m(9), respectively. At the 2 nd  printing step (i.e. for p[2]), O M  is aligned to the origin O 2  of the die D[2]. As long as D y =3d d1 =3d y2 , the data-arrays p[2] of dice D[1]-D[9] are equal to m(3), m(1), m(2), m(6), m(4), m(5), m(9), m(7), m(8), respectively. At the 3 rd  printing step (i.e. for p[3]), O M  is aligned to the origin O 3  of the die D[3]. As long as D y =3d y1 =3d y2 , the data-arrays p[3] of dice D[1]-D[9] are equal to m(2), m(3), m(1), m(5), m(6), m(4), m(8), m(9), m(7), respectively. 
         [0068]      FIG. 22  is a table listing three 3D 2 -oP packages M[1]-M[3] formed from nine dice D[1]-D[9] of  FIG. 20 : the 3D 2 -oP package M[1] comprises dice D[1], D[4], D[7]; the 3D 2 -oP package M[2] comprises dice D[2], D[5], D[8]; and the 3D 2 -oP package M[ 3 ] comprises dice D[3], D[6], D[9]. Because these packages M[1]-M[3] are offset-printed with the same data-mask  8 , they belong to the same 3D 2 -oP batch. 
         [0069]    In sum, for the 3D 2 -oP packages M[1]-M[3] of  FIG. 20 , their data-array sequences can be expressed as: 
         [0000]        S   M[1] =( S   D[1]   ,S   D[4]   ,S   D[7] )=( m (1), m (3), m (2); m (4), m (6), m (5); m (7), m (9), m (8)); 
         [0000]        S   M[2] =( S   D[2]   ,S   D[5]   ,S   D[8] )= m (2), m (1), m (3); m (5), m (4), m (6); m (8), m (7), m (9)); 
         [0000]        S   M[3] =( S   D[3]   ,S   D[6]   ,S   D[9] )=( m (3), m (1), m (1); m (6), m (5), m (4); m (9), m (8), m (7)); 
         [0000]      with {S M[1] }={S M[2] }={S M[3] }, but S M[1] ≠S M[2] ≠S M[3] .
 
         [0000]    From these expressions, it can be observed that all 3D 2 -oP packages M[1]-M[3] have the same data-array set, but can have different data-array sequences. 
         [0070]    While illustrative embodiments have been shown and described, it would be apparent to those skilled in the art that may more modifications than that have been mentioned above are possible without departing from the inventive concepts set forth  therein. For example, besides photo-lithography, offset-printing can be applied to imprint-lithography. The invention, therefore, is not to be limited except in the spirit of the appended claims.