1. In a direct-sequence CDMA system, apparatus having a processor to efficiently perform matrix multiplication, said apparatus comprising:
a pre-computation module that generates a matrix of partial results from an input matrix and an input vector by, in part, grouping elements along a second dimension of said input matrix; and
a post-computation module that sums along a first dimension of said matrix of partial results in a time-shared manner to form a vector of full matrix multiplication results as partial results in said matrix of partial results become available from said pre-computation module, wherein said vector of full matrix multiplication results comprises coded information for transmission over a wireless medium to one or more receivers.
2. The apparatus of claim 1, comprising a time-shared accumulator module, shared between said pre-computation module and said post-computation module, that accumulates said partial results and said full matrix multiplication results.
3. The apparatus of claim 1, comprising an analog-to-digital converter that digitizes said input vector before use by said pre-computation module.
4. The apparatus of claim 1, comprising an ingresschannel cancellation filter that filters said input vector before use by said pre-computation module.
5. The apparatus of claim 1, comprising a vector register that stores said vector of full matrix multiplication results.
6. The apparatus of claim 1, wherein said input matrix comprises a matrix of direct-sequence codes.
7. The apparatus of claim 1, wherein said input matrix comprises an inverse matrix of direct-sequence codes.
8. The apparatus of claim 1, wherein said input vector comprises a vector of uncoded symbols.
9. The apparatus of claim 1, wherein said input vector comprises a vector of coded symbols.
10. The apparatus of claim 1, wherein each element of said input matrix comprises a value of +1 or \u22121.
11. The apparatus of claim 1, wherein said grouping elements comprises performing an optimal grouping based on tradeoffs between performance, power, cost, and hardware for said CDMA system.
12. The apparatus of claim 1, wherein said first dimension corresponds to a row dimension of said input matrix and said matrix of partial results.
13. The apparatus of claim 1, wherein said second dimension corresponds to a column dimension of said input matrix and said matrix of partial results.
14. A method for matrix multiplication within a direct-sequence CDMA system, the method comprising:
generating, using a pre-computation module within the CDMA system, a matrix of partial results from an input matrix and an input vector by, in part, grouping elements along a second dimension of said input matrix, wherein said input vector comprises symbols to be coded for transmission over a wireless medium; and
summing, using a post-computation module within the CDMA system, along a first dimension of said matrix of partial results in a time-shared manner to form a vector of full matrix multiplication results as partial results in said matrix of partial results become available from said pre-computation module, wherein said vector of full matrix multiplication results comprises coded information for transmission over said wireless medium to one or more receivers.
15. The method of claim 14, comprising accumulating said partial results and said full matrix multiplication results using a time-shared accumulator module shared between said pre-computation module and said post-computation module.
16. The method of claim 14, comprising digitizing, using an analog-to-digital converter, said input vector before use by said pre-computation module.
17. The method of claim 14, comprising filtering, using an ingresschannel cancellation filter, said input vector before use by said pre-computation module.
18. The method of claim 14, comprising storing, using a vector register, said vector of full matrix multiplication results.
19. The method of claim 14, wherein said input matrix comprises a matrix of direct-sequence codes.
20. The method of claim 14, wherein said input matrix comprises an inverse matrix of direct-sequence codes.
21. The method of claim 14, wherein said input vector comprises a vector of uncoded symbols.
22. The method of claim 14, wherein said input vector comprises a vector of coded symbols.
23. The method of claim 14, wherein each element of said input matrix comprises a value of +1 or \u22121.
24. The method of claim 14, wherein said grouping elements comprises performing an optimal grouping based on tradeoffs between performance, power, cost, and hardware for said CDMA system.
25. The method of claim 14, wherein said first dimension corresponds to a row dimension of said input matrix and said matrix of partial results.
26. The method of claim 14, wherein said second dimension corresponds to a column dimension of said input matrix and said matrix of partial results.
27. A machine-readable storage having stored thereon, a computer program having at least one code section for matrix multiplication within a direct-sequence CDMA system, the at least one code section being executable by a machine for causing the machine to perform steps comprising:
generating, using a pre-computation module within the CDMA system, a matrix of partial results from an input matrix and an input vector by, in part, grouping elements along a second dimension of said input matrix, wherein said input vector comprises symbols to be coded for transmission over a wireless medium; and
summing, using a post-computation module within the CDMA system, along a first dimension of said matrix of partial results in a time-shared manner to form a vector of full matrix multiplication results as partial results in said matrix of partial results become available from said pre-computation module, wherein said vector of full matrix multiplication results comprises coded information for transmission over said wireless medium to one or more receivers.
28. The machine-readable storage of claim 27, wherein said at least one code section comprises code for accumulating said partial results and said full matrix multiplication results using a time-shared accumulator module shared between said pre-computation module and said post-computation module.
29. The machine-readable storage of claim 27, wherein said at least one code section comprises code for digitizing, using an analog-to-digital converter, said input vector before use by said pre-computation module.
30. The machine-readable storage of claim 27, wherein said at least one code section comprises code for filtering, using an ingresschannel cancellation filter, said input vector before use by said pre-computation module.
31. The machine-readable storage of claim 27, wherein said at least one code section comprises code for storing, using a vector register, said vector of full matrix multiplication results.
32. The machine-readable storage of claim 27, wherein said input matrix comprises a matrix of direct-sequence codes.
33. The machine-readable storage of claim 27, wherein said input matrix comprises an inverse matrix of direct-sequence codes.
34. The machine-readable storage of claim 27, wherein said input vector comprises a vector of uncoded symbols.
35. The machine-readable storage of claim 27, wherein said input vector comprises a vector of coded symbols.
36. The machine-readable storage of claim 27, wherein each element of said input matrix comprises a value of +1 or \u22121.
37. The machine-readable storage of claim 27, wherein said grouping elements comprises performing an optimal grouping based on tradeoffs between performance, power, cost, and hardware for said CDMA system.
38. The machine-readable storage of claim 27, wherein said first dimension corresponds to a row dimension of said input matrix and said matrix of partial results.
39. The machine-readable storage of claim 27, wherein said second dimension corresponds to a column dimension of said input matrix and said matrix of partial results.
40. In a direct-sequence CDMA system, apparatus having a processor to efficiently perform matrix multiplication, said apparatus comprising:
at least one module that generates a matrix of partial results from an input matrix and an input vector by, in part, grouping elements along a second dimension of said input matrix; and
said at least one module sums along a first dimension of said matrix of partial results in a time-shared manner to form a vector of full matrix multiplication results as partial results in said matrix of partial results become available from said at least one module, wherein said vector of full matrix multiplication results comprises coded information for transmission over a wireless medium to one or more receivers.
41. The apparatus of claim 40, wherein said at least one module comprises a first module that performs said generating of said matrix, and a second module that performs said summing.
42. The apparatus of claim 41, wherein said first module comprises a pre-computation module and said second module comprises a post-computation module.
43. The apparatus of claim 41, comprising a time-shared accumulator module, shared between said first module and said second module, that accumulates said partial results and said full matrix multiplication results.
44. The apparatus of claim 40, comprising an analog-to-digital converter that digitizes said input vector before use by said at least one module.
45. The apparatus of claim 40, comprising an ingresschannel cancellation filter that filters said input vector before use by said at least one module.
46. The apparatus of claim 40, comprising a vector register that stores said vector of full matrix multiplication results.
47. The apparatus of claim 40, wherein said input matrix comprises a matrix of direct-sequence codes.
48. The apparatus of claim 40, wherein said input matrix comprises an inverse matrix of direct-sequence codes.
49. The apparatus of claim 40, wherein said input vector comprises a vector of uncoded symbols.
50. The apparatus of claim 40, wherein said input vector comprises a vector of coded symbols.
51. The apparatus of claim 40, wherein each element of said input matrix comprises a value of +1 or \u22121.
52. The apparatus of claim 40, wherein said grouping elements comprises performing an optimal grouping based on tradeoffs between performance, power, cost, and hardware for said CDMA system.
53. The apparatus of claim 40, wherein said first dimension corresponds to a row dimension of said input matrix and said matrix of partial results.
54. The apparatus of claim 40, wherein said second dimension corresponds to a column dimension of said input matrix and said matrix of partial results.
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 semiconductor device in which a semiconductor layer is provided on a substrate including a metal base and said semiconductor layer is formed with at least a portion of an element, wherein said metal substrate comprises a metal base made of a first metal, a diffusion preventing layer adapted to prevent diffusion of the metal forming said metal base into said semiconductor layer, and a connecting metal layer made of a second metal for electrical connection between said metal base and said semiconductor layer.
2. A semiconductor device according to claim 1, wherein said semiconductor layer is made of a silicon crystal having a plane orientation selected from the group consisting of a {110} plane orientation, plane orientations equivalent to said plane orientation, a {511} plane, a {331} plane, a {221} plane, a {321} plane, a {531} plane, a {231} plane, a {351} plane, a {320} plane, a {230} plane, and plane orientations equivalent thereto.
3. A semiconductor device according to claim 1, wherein said semiconductor layer comprises a plurality of layers having different conductivity types.
4. A semiconductor device according to claim 1, wherein said first metal is Cu.
5. A semiconductor device according to claim 1, wherein said second metal is Ni.
6. A semiconductor device according to claim 1, wherein said diffusion preventing layer contains at least one of Ni, TaN, and TiN.
7. A semiconductor device according claim 1, wherein said diffusion preventing layer and said connecting metal layer are common layers made of the same metal.
8. A vertical-type semiconductor device in which a semiconductor layer is formed with at least a portion of an element, wherein said at least a portion of said element is formed in a silicon semiconductor layer having a plane orientation selected from the group consisting of a {110} plane orientation, a {511} plane, a {331} plane, a {221} plane, a {321} plane, a {531} plane, a {231} plane, a {351} plane, a {320} plane, a {230} plane, and plane orientations equivalent thereto.
9. A vertical-type semiconductor device according to claim 8, wherein said semiconductor layer formed with said at least a portion of said element comprises a plurality of semiconductor layer portions and an impurity profile of said semiconductor layer portions contacting each other represents substantially stepwise joining.
10. A vertical-type semiconductor device according to claim 8, wherein said element is an element selected from the group consisting of a bipolar transistor, a vertical-type MOSFET, an IGBT, a thyristor, and a GTO.
11. A vertical-type semiconductor device according to claim 8, wherein said semiconductor layer is the semiconductor layer provided on the substrate according to claim 1.
12. A vertical-type semiconductor device according to claim 11, wherein said semiconductor layer portion contacting said substrate has a thickness of 20 \u03bcm or less.
13. A vertical-type semiconductor device according to claim 8, wherein a plurality of elements having different polarities are separated from each other by an element separating region and at least portions of said plurality of elements are formed in the same semiconductor layer.
14. A manufacturing method of a semiconductor device having a plurality of semiconductor layers with different conductivity types on a metal substrate, said manufacturing method comprising:
a step of forming porous silicon on a silicon substrate, a step of epitaxially growing semiconductor layers having a plurality of conductivity types on said porous silicon,
a step of bonding together said epitaxial silicon layers and a metal substrate, and
a step of cutting off, from a substrate in which said metal substrate and a semiconductor substrate having said epitaxial silicon layers are bonded together, said semiconductor substrate at an interface between said epitaxial silicon layers and said porous silicon layer.
15. A manufacturing method of a semiconductor device having a plurality of semiconductor layers with different conductivity types on a metal substrate, said manufacturing method comprising:
a step of forming porous silicon on a silicon substrate, a step of epitaxially growing semiconductor layers alternately in divided regions, said semiconductor layers having a plurality of conductivity types and adjacent to each other in a horizontal direction with respect to a substrate surface,
a step of bonding together said epitaxial silicon layers and a metal substrate, a step of cutting off, from a substrate in which said metal substrate and a semiconductor substrate having said epitaxial silicon layers are bonded together, said semiconductor substrate at an interface between said epitaxial silicon layers and said porous silicon layer, and
a step of forming an electrically-insulating element separating layer at a boundary of said regions.
16. A manufacturing method of a semiconductor device according to claim 14, wherein a temperature of said epitaxial growth is 600\xb0 C. or less.